On tolerant cryptographic constructions

Lecture Notes in Computer Science

Volumn 3376, Issue , 2005, Pages 172-190

  Herzberg, Amir ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA;

CRYPTOGRAPHIC SCHEMES; PLAINTEXT ATTACK; TOLERANT CONSTRUCTION;

CRYPTOGRAPHY;

EID: 24144475180     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30574-3_13     Document Type: Conference Paper

References (44)

1. C. A. Asmuth and G. R. Blakley. An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems. Comp. and Maths, with Appls., 7:447-450, 1981.
2. B. Aiello, M. Bellare, G. Di Crescenzo, and R. Venkatesan, Security amplification by construction: the case of doubly-iterated, ideal ciphers, Proc. of CRYPTO 98.
3. Jee Hea An, Yevgeniy Dodis and Tal Rabin, On the Security of Joint Signature and Encryption, in Theory and Application of Cryptographic Techniques, pp. 83-107, 2002.
4. Also in Advances in Cryptology - EUROCRYPT 2002, volume 2332 of Lecture Notes in Computer Science, pages 83-107. Springer-Verlag, 2002.
5. Ross Anderson, Roger Needham. Robustness Principles for Public Key Protocols. In Proceedings of Int'l. Conference on Advances in Cryptology (CRYPTO 95), Vol. 963 of Lecture Notes in Computer Science, pp. 236-247, Springer-Verlag, 1995.
6. Martin Abadi, Roger Needham. Prudent Engineering Practice for Cryptographic Protocols. IEEE Transactions on Software Engineering, 22, 1 (Jan.), 1996, pp. 6-15.
7. Daniel Bleichenbacher. Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS#1. In Advances in Cryptology - CRYPTO '98, LNCS 1462, pages 1-12. Springer, 1998.
8. M.Bellare, A.Desai, E. Jokipii, P.Rogaway: A Concrete Security Treatment of Symmetric Encryption, Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 394-403, 1997. Revised version at http://www-cse.ucsd.edu/users/mihir/papers/sym-enc.html.
9. Mihir Bellare, Joe Kilian and Phil Rogaway, The security of cipher block chaining, Journal of Computer and System Sciences, Vol. 61, No. 3, Dec 2000, pp. 362-399.
10. Extended abstract in Advances in Cryptology - Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed, Springer-Verlag, 1994.
11. Mihir Bellare and Chanathip Namprempre. Authenticated encryption: Relations among notions and analysis of the generic construction paradigm. In T. Okamoto, editor, Asiacrypt 2000, volume 1976 of LNCS, pages 531-545. Springer-Verlag, Berlin Germany, Dec. 2000.
12. Mihir Bellare and Phillip Rogaway, Collision-Resistant Hashing: Towards Making UOWHFs Practical, Extended abstract was in Advances in Cryptology- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed, Springer-Verlag, 1997. Full paper available at http://www.cs.ucsd.edu/users/mihir/papers/tcr-hash.html.
13. Joonsang Baek, Ron Steinfeld, and Yuliang Zheng. Formal proofs for the security of signcryption. In David Naccache and Pascal Pailler, editors, 5th International Workshop on Practice and Theory in Public Key Cryptosystems - PKC 2002, pp. 80-98, LNCS Vol. 2274, 2002.
14. Danny Dolev, Cynthia Dwork, and Moni Naor. Non-malleable cryptography. In Proceedings of the 23rd Symposium on Theory of Computing, ACM STOC, 1991.
15. Ivan B. Damgård, Lars Ramkilde Knudsen. Enhancing the Strength of Conventional Cryptosystems, BRICS report RS-94-38, November 1994.
16. Yevgeniy Dodis and Jonathan Katz, Chosen Ciphertext Security of Multiple Encryption, Manuscript, December 2003.
17. Ivan B. Damgård, Torben P. Pedersen, Birgit Pfitzmann: On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures; Crypto '93, LNCS 773, Springer-Verlag, Berlin 1994, 250-265.
18. Ivan B. Damgård, Torben P. Pedersen, Birgit Pfitzmann: Statistical Secrecy and Multi-Bit Commitments; IEEE Transactions on Information Theory 44/3 (1998) 1143-1151.
19. Shimon Even and Oded Goldreich, On the Power of Cascade Ciphers, ACM Transactions on Computer Systems, Vol. 3, 1985, pp. 108-116.
20. National Institute of Standards and Technology, Federal Information Processing Standards Publication, FIPS Pub 180-1: Secure Hash Standard (SHA-1), April 17, (1995), 14 pages.
21. Oded Goldreich, The Foundations of Cryptography, Volume 1 (Basic Tools), ISBN 0-521-79172-3, Cambridge University Press, June 2001.
22. Oded Goldreich, Fragments of a Chapter on Encryptions Schemes, Extracts from working drafts of Volume 2, The Foundations of Cryptography.
23. Oded Goldreich and Shafi Goldwasser and Silvio Micali "How to Construct Random Functions" Journal of the ACM, 33(4), 1984, 792-807.
24. Oded Goldreich, R. Impagliazzo, L. Levin, R. Venkatesen, D. Zuckerman. "Security preserving amplification of randomness", 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, (1990), 318-326.
25. Shafi Goldwasser and Silvio Micali. "Probabilistic Encryption, " JCSS (28), 1984, 270-299.
26. Philippe Golle, Markus Jakobsson, Ari Juels, and Paul Syverson. Universal reencryption for mixnets. In Tatsuaki Okamoto, editor, RSA Conference Cryptographers' Track, volume 2964 of LNCS, Springer-Verlag, pages 163-178, San Francisco, California, USA, February 2004.
27. Shai Halevi and Silvio Micali, "Practical and Provably-Secure Commitment Schemes from Collision Free Hashing", in Advances in Cryptology - CRYPTO96, Lecture Notes in Computer Science 1109, Springer-Verlag, 1996, pp. 201-215.
28. Johan Hastad, Rudich Impagliazzo, Leonid A. Levin, and Mike Luby, Construction of a Pseudorandom Generator from any One-Way Function. SIAM Journal on Computing, Vol. 28, No. 4, pp. 1364-1396, 1999.
29. Amir Herzberg and Mike Luby, "Public Randomness in Cryptography", proceedings of CRYPTO 1992, ICSI technical report TR-92-068, October, 1992.
30. Amir Herzberg and Shlomit Pinter, "Composite Ciphers", EE Pub. no. 576, Dept of Electrical Engineering, Technion, Haifa, Israel, Feb. 1986.
31. Hugo Krawczyk, "The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)," In Crypto '01, pp. 310-331, LNCS Vol. 2139, J. Kilian ed., Springer-Verlag, 2001.
32. Hugo Krawczyk and Tal Rabin. Chameleon signatures. In Network and Distributed System Security Symposium, pages 143-154. The Internet Society, 2000.
33. Arjen K. Lenstra and Eric R. Verheul. Selecting Cryptographic Key Sizes. Journal of Cryptology: The Journal of the International Association for Cryptologic Research, 14(4):255-293, September 2001.
34. U.M. Maurer and J.L. Massey, Cascade ciphers: the importance of being first, Journal of Cryptology, Vol. 6, No. 1, pp. 55-61, 1993.
35. Alfred J. Menezes, Paul C. van Oorschot, Scott A. Vanstone, Handbook of Applied Cryptography, Section 9.2.6, CRC Press, ISBN 0-8493-8523-7, October 1996. Available online at http://www.cacr.math.uwaterloo.ca/hac/.
36. Moni Naor and Moti Yung, Universal one-way hash functions and their crypto-graphic applications, Proc. 21st Annual ACM Symposium on Theory of Computing (STOC), 1989, pp. 33-43.
37. T. Dierks, C. Allen, The TLS Protocol: Version 1.0, Network Working Group, Internet Engineering Task Force (IETF). Available online at http://www.ietf.org/rfc/rfc2246.txt.
38. Eric Rescorla. SSL and TLS: Designing and Building Secure Systems. Addison-Wesley, 2000.
39. Adi Shamir, How to share a secret, Comm. of the ACM, 22(11):612-613, 1979.
40. Bruce Schneier, Applied Cryptography, John Wiley and Sons, 1996.
41. Victor Shoup, Using hash functions as a hedge against chosen ciphertext attacks, Adv. in Cryptology - Proc. of Eurocrypt '2000, LNCS 1807, pp. 275-288.
42. Adi Shamir and Yael Tauman. Improved online/online signature schemes. In Joe Killian, editor, Proceedings of Crypto 01, volume 2139 of LNCS, pages 355-367. Springer-Verlag, August 2001.
43. Yuliang Zheng, Digital signcryption or how to achieve cost(signature+encryption) ≪ cost(signature)+cost(encryption), in Advances in Cryptology - CRYPTO'97, Berlin, New York, Tokyo, 1997, vol. 1294 of Lecture Notes in Computer Science, pp. 165-179, Springer-Verlag.
44. Phil R. Zimmerman. The Official PGP User's Guide. MIT Press, Boston, 1995.