Searching for "Information-Theoretic Cryptography." – sorted by Relevance.
18 documents found, showing 1 through 10.
Next 10 →
-
Information-Theoretic Cryptography (Extended Abstract)
- …Information-Theoretic Cryptography (Extended Abstract) Ueli Maurer ? Department of Computer…
- Cited by 19 (0 self) – Add To MetaCart
-
On the hardness of information-theoretic multiparty computation
- … revisit the following open problem in information-theoretic cryptography: Does the communication…
- Cited by 1 (0 self) – Add To MetaCart
-
General Constructions for Information-TheoreticPrivate Information Retrieval \Lambda
- … by the servers. Key words. private information retrieval, information-theoretic cryptography, locally decodable…
- Add To MetaCart
-
Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion
- … between computational and information-theoretic cryptography. In both models a secret channel from Alice…
- Cited by 13 (1 self) – Add To MetaCart
-
Provably Secure Steganography
- … theoretic models for steganography [3, 13, 15, 19], but these are limited in the same way that information…
- Cited by 30 (2 self) – Add To MetaCart
-
Simple and tight bounds for information reconciliation and privacy amplification
- … and monotonicity. Key words. Information-theoretic cryptography, entropy measures, data compression, randomness…
- Cited by 7 (1 self) – Add To MetaCart
-
Leo Reyzin. Notes for BU CAS CS 538. 1 1 Information-Theoretic Encryption: Perfect Secrecy
- …Leo Reyzin. Notes for BU CAS CS 538. 1 1 Information-Theoretic Encryption: Perfect Secrecy…
- Add To MetaCart
-
unknown title
- … of information-theoretic cryptography: we have an efficient encryption scheme, and a proof that you can’t do…
- Add To MetaCart
-
Information Protection
- …. Information Theoretic Cryptography 9. Current Research Trends d. Private and Public Key Cryptography e…
- Add To MetaCart
-
Design of Near-Optimal Pseudorandom Functions and Pseudorandom Permutations in the Information-Theoretic
- … of the birthday bound. This bound m ≪ 2 n is called “optimal” or “optimal in information-theoretic cryptography…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
