Fundamental problems in provable security and cryptography

References

• Barak, B. 2001 How to go beyond the black-box simulation barrier. In Proc. 42nd IEEE Annual Symp. on Foundations of Computer Science, Las Vegas, NV, USA, 14–17 October 2001, pp. 106–115. Google Scholar
• Barak, B., Goldrecih, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S. & Yang K. 2001 On the (im)possibility of obfuscating programs. In Advances in cryptology—CRYPTO 2001, Proc. 21st Annual Int. Cryptology Conf., Santa Barbara, California, USA, 19–23 August 2001 (ed. J. Kilian), pp. 1–18. Springer-Verlag Lecture Notes in Computer Science, no. 2139. Google Scholar
• Bellare, M. 1997 Practice-oriented provable-security. In Lectures on data security: modern cryptology in theory and practice (ed. I. Damgård), pp. 1–15. Springer-Verlag Lecture Notes in Computer Science, no. 1561. Google Scholar
• Bellare, M. & Palacio, A. 2004 Towards plaintext-aware public-key encryption without random oracles. In Advances in cryptology—ASIACRYPT 2004, Proc. 10th Int. Conf. on the Theory and Application of Cryptology and Information Security, Jeju Island, Korea, 5–9 December 2004 (ed. P. J. Lee), pp. 48–62. Springer-Verlag Lecture Notes in Computer Science, no. 3329. Google Scholar
• Bellare, M. & Rogaway, P. 1993 Random oracles are practical: a paradigm for designing efficient protocols. In Proc. 1st ACM Conf. on Computer and Communications Security, Fairfax, VA, USA, 3–5 November 1993, pp. 62–73. Google Scholar
• Bellare, M., Desai, A., Jokipii, E. & Rogaway, P. 1997 A concrete security treatment of symmetric encryption. In Proc. 38th Annual Symp. Foundations of Computer Science, Washington, DC, USA, 19–22 October 1997, pp. 394–405. Google Scholar
• Bellare, M., Desai, A., Pointcheval, D. & Rogaway, P. 1998 Relations among notions for public-key encryption schemes. In Advances in cryptology—CRYPTO '98, Proc. 18th Annual International Cryptology Conference, Santa Barbara, CA, USA, 23–27 August 1998 (ed. H. Krawczyk), pp. 26–45. Springer-Verlag Lecture Notes in Computer Science, no. 1462. Google Scholar
• Boneh, D. & Boyen, X. 2004 Short signatures without random oracles. In Advances in cryptology—EUROCRYPT 2004, Proc. Int. Conf. on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, 2–6 May 2004 (ed. C. Cachin, J. Camenisch), pp. 56–73. Springer-Verlag Lecture Notes in Computer Science, no. 3027. Google Scholar
• Canetti, R. 2001 Universally composable security: a new paradigm for cryptographic protocols. In Proc. 42nd IEEE Annual Symp. on Foundations of Computer Science, Las Vegas, NV, USA, 14–17 October 2001, pp. 136–145. Google Scholar
• Canetti, R. & Fischlin, M. 2001 Universally composable commitments. In Advances in cryptology–CRYPTO 2001, Proc. 21st Annual Int. Cryptology Conf., Santa Barbara, CA, USA, 19–23 August 2001 (ed. J. Kilian), pp. 19–40. Springer-Verlag Lectures Notes in Computer Science, no. 2139. Google Scholar
• Canetti R, Goldreich O& Halevi S. 2004The random oracle methodology, revisited. J. ACM. 51, 557–594.doi:10.1145/1008731.1008734. . Crossref, ISI, Google Scholar
• Cramer R& Shoup V. 2003Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comp. 33, 167–226.doi:10.1137/S0097539702403773. . Crossref, ISI, Google Scholar
• Dent, A. W. 2002 Adapting the weaknesses of the random oracle model to the generic group model. In Advances in cryptoloyg—ASIACRYPT 2002, Proc. 8th Int. Conf. on the Theory and Applicatino of Cryptology and Information Security, Queenstown, New Zealand, 1–5 December 2002 (ed. Y. Zheng), pp. 100–109. Springer-Verlag Lecture Notes in Computer Science, no. 2501. Google Scholar
• Diffie W& Hellman M.E. 1976New directions in cryptography. IEEE Trans. Inf. Th. 22, 644–654.doi:10.1109/TIT.1976.1055638. . Crossref, ISI, Google Scholar
• Goldwasser S, Micali S& Rivest R. 1988A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing. 17, 281–308.doi:10.1137/0217017. . Crossref, ISI, Google Scholar
• Koblitz, N. & Menezes, A. J. 2004 Another look at “provable security”. Preprint, University of Washington & University of Waterloo. Google Scholar
• Nielsen, J. B. 2002 Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In Advances in cryptology—CRYPTO 2002, Proc. 22nd Annual Int. Cryptology Conf., Santa Barbara, CA, USA, 18–22 August, 2002 (ed. M. Yung), pp. 111–126. Springer-Verlag Lecture Notes in Computer Science, no. 2442. Google Scholar
• Pfitzmann, B. & Waidner, M. 2000 Composition and integrity preservation of secure reactive systems. In Proc. 7th ACM Conf. Computer and Communications Security, Athens, Greece, 1–4 November 2000, pp. 245–254. Google Scholar
• Rabin, M. O. 1979 Digitalized signatures and public-key functions as intractable as factorization. Report no. MIT/LCS/TR-212, MIT Laboratory for Computer Science, Massachusetts Institute of Technology. Google Scholar
• Rackoff, C. & Simon, D. R. 1991 Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in cryptology—CRYPTO '91, Proc. 11th Annual Int. Cryptology Conference, Santa Barbara, CA, USA, 11–15 August 1991 (ed. J. Feigenbaum), pp. 433–444. Springer-Verlag Lectures Notes in Computer Science, no. 576. Google Scholar
• Shannon C.E. 1948A mathematical theory of communication. Bell Syst. Tech. J. 27, 379–423.see also 623–656. Crossref, Google Scholar
• Shannon C.E. 1949Communication theory of secrecy systems. Bell System Tech. J. 28, 656–715. Crossref, Google Scholar
• Shoup, V. 1997 Lower bounds for discrete logarithms and related problems. In Advances in cryptology—EUROCRYPT '97, Proc. Int. Conf. on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, 11–15 May 1997 (ed. W. Fumy), pp. 256–266. Springer-Verlag Lecture Notes in Computer Science, no. 1233. Google Scholar
• Turing A.M. 1936On computable numbers, with an application to the Entscheidungsproblem. Proc. Lon. Math. Soc. ser. 2. 42, 230–265. Google Scholar