The security of chaffing and winnowing

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

Volumn 1976, Issue , 2000, Pages 517-530

  Bellare, Mihir ^a   Boldyreva, Alexandra ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY;

ALL OR NOTHINGS; EFFICIENT SCHEMES; QUALITY OF DATA;

CRYPTOGRAPHY;

EID: 84937422374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_40     Document Type: Conference Paper

References (12)

1. M. Bellare, and A. Boldyreva, “The security of chaffing and winnowing,” Full version of this paper, available via http://www-cse.ucsd.edu/users/mihir.
2. M. BELLARE, A. DESAI, E. JOKIPII and P. ROGAWAY, “A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation,” Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997.
3. M. BELLARE, J. KILIAN and P. ROGAWAY, “The security of cipher block chaining,” Advances in Cryptology – Crypto ’94, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.
4. M. BELLARE and P. ROGAWAY, “Random oracles are practical: a paradigm for designing efficient protocols,” Proceedings of the 1st Annual Conference on Computer and Communications Security, ACM, 1993.
5. M. BELLARE, P. ROGAWAY, “Optimal asymmetric encryption - How to encrypt with RSA,” Advances in Cryptology – Eurocrypt ’94, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994.
6. V. BOYKO, “On the security properties of OAEP as an all-or-nothing transform,”Advances in Cryptology – Crypto ’99, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., Springer-Verlag, 1999.
7. R. CANETTI, Y. DODIS, S. HALEVI, E. KUSHILEVITZ, A. SAHAI, “Exposure-resilient functions and all-or-nothing transforms,” Advances in Cryptology – Eurocrypt ’00, Lecture Notes in Computer Science Vol. 1807, B. Preneel ed., Springer-Verlag, 2000.
8. A. DESAI, “The security of all-or-nothing encryption: protecting against exhaustive key search,”Advances in Cryptology – Crypto ’00, Lecture Notes in Computer Science Vol. 1880, M. Bellare ed., Springer-Verlag, 2000.
9. O. GOLDREICH, S. GOLDWASSER and S. MICALI, “How to construct random functions,” Journal of the ACM, Vol. 33, No. 4, 210–217, (1986).
10. S. GOLDWASSER and S. MICALI, “Probabilistic encryption,” Journal of Computer and System Science, Vol. 28, 1984, pp. 270–299.
11. R. RIVEST, “Chaffing and winnowing: Confidentiality without encryption,” http://theory.lcs.mit.edu/˜rivest/publications.html.
12. R. RIVEST, “all-or-nothing encryption and the package transform,” Proceedings of the 4th Workshop on Fast Software Encryption, Lecture Notes in Computer Science Vol. 1267, Springer-Verlag, 1997.