About the security of ciphers (semantic security and pseudo-random permutations)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3357, Issue , 2004, Pages 182-197

  Phan, Duong Hieu ^a   Pointcheval, David ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; COSTS; CRYPTOGRAPHY; DATA PRIVACY; MATHEMATICAL MODELS; PROBABILITY; SECURITY OF DATA;

ADAPTIVE ADVERSARY; DETERMINISTIC ENCRYPTIONS; FILESYSTEM; MINIMAL COST; PROBABILISTICS; PSEUDORANDOM PERMUTATION; SECURITY NOTION; SEMANTIC SECURITY; SYMMETRIC ENCRYPTION; SYMMETRIC ENCRYPTION SCHEMES;

CRYPTOGRAPHY; BLOCK CODES;

CIPHERS; PSEUDO-RANDOM PERMUTATION (PRP); SEMANTIC SECURITY; SYMMETRIC ENCRYPTION SCHEMES;

EID: 26444517444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30564-4_13     Document Type: Article

References (11)

1. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. Proc. of the 38th FOCS. IEEE, New York, 1997.
2. A. Desai and S. Miner. Concrete Security Characterization of PRFs and PRPs: Reduction and Applications. Asiacrypt '00, LNCS 1976, 503-516. Springer-Verlag, Berlin, 2000.
3. O. Goldreich, S. Goldwasser, and S. Micali. On The Cryptographic Applications of Random Functions. Crypto '84, LNCS 196. Springer-Verlag, Berlin, 1985.
4. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
5. S. Halevi and P. Rogaway. A Tweakable Enciphering Mode. Crypto '03, LNCS 2729, 482-499. Springer-Verlag, Berlin, 2003.
6. J. Katz and M. Yung. Complete Characterization of Security Notions for Probabilistic Private-Key Encryption. Proc. of the 32nd STOC. ACM Press, New York, 2000.
7. M. Luby and Ch. Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal of Computing, 17(2):373-386, 1988.
8. M. Naor and M. Yung. Public-Key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. Proc. of the 22nd STOC, 427-437. ACM Press, New York, 1990.
9. D. H. Phan and D. Pointcheval. About the Security of Ciphers (Semantic Security and Pseudo-Random Permutations). SAC '04. Springer-Verlag, Berlin, 2004. Pull version available from http://www.di.ens.fr/users/pointche/.
10. C. RackofT and D. R. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. Crypto '91, LNCS 576, 433-444. Springer-Verlag, Berlin, 1992.
11. C. E. Shannon. Communication Theory of Secrecy Systems. Bell System Technical Journal, 28(4):656-715, 1949.