Bellare, Mihir - Department of Computer Science and Engineering, University of California at San Diego

• Appears in Proceedings of the Twenty Sixth Annual Symposium on the Theory of Computing, Improved NonApproximability Results
• A preliminary version of this paper appears in Advances in Cryptology CRYPTO '99, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., Springer-Verlag, 1999. This revised version
• An extended abstract of this paper appears in Tatsuaki Okamoto, editor, Advances in Cryptology --ASIACRYPT 2000, Volume 1976 of Lecture Notes in Computer Science, pages 531545, Kyoto,
• An abridged version of this paper appears in Advances in Cryptology --Crypto '93 Proceedings, SpringerVerlag. This is the full version.
• An abridged version of this paper appears in Advances in Cryptology --Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., SpringerVerlag, 1997.
• An extended abstract of this paper appears in Advances in Cryptology { CRYPTO '98, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998. This is the full
• PSEUDO-RANDOM FUNCTIONS We studied security of a block cipher against key recovery.
• An extended abstract of this paper appears in Victor Shoup, editor, Advances in Cryptology --CRYPTO 2005, Volume 3621 of Lecture Notes in Computer Science, pages 205--222, Santa Barbara,
• Appears in Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (COLT), 1992.
• Appears in Proceedings of the Third Israel Symposium on Theory and Computing Systems, 1995. On the Role of Shared Randomness
• An extended abstract of this paper appears in Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997. This is the full paper.
• Appears as IBM Research Report RC 19981, March 1994. Secure Transport Protocols for HighSpeed Networks
• A preliminary version of this paper appears in Advances in Cryptology --CRYPTO '06, Lecture Notes in Computer Science Vol. 4117 , C. Dwork ed., SpringerVerlag, 2006. This is the full version.
• A preliminary version of this paper appears in Advances in Cryptology --ASIACRYPT '00, Lecture Notes in Computer Science Vol. 1976, T. Okamoto ed., SpringerVerlag, 2000.
• Linearity Testing in Characteristic Two \Lambda M. Bellare y D. Coppersmith z J. H astad x M. Kiwi --M. Sudan k
• Appears in Journal of Cryptology, Vol. 12, No. 2, 1999, pp. 117--140. Early version was MIT Laboratory for Computer Science Technical Memo No. 683, February 1996.
• Appears in Journal of Cryptology, Vol. 9, No. 1, Winter 1996, pp. 149--166. Preliminary version in Advances in Cryptology --Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740,
• Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design
• A preliminary version of this paper appeared in Advances in Cryptology CRYPTO '04, Lecture Notes in Computer Science Vol. ?? , M. Franklin ed., Springer-Verlag, 2004. This is the full version.
• Digital signatures In the public key setting, the primitive used to provide data integrity is a digital signature scheme.
• An abridged version of this paper appears in Advances in Cryptology Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996.
• Symmetric Encryption The symmetric setting considers two parties who share a key and will use this key to imbue commu-
• Appears in Journal of Cryptology, Vol. 12, No. 2, 1999, pp. 117 140. Early version was MIT Laboratory for Computer Science Technical Memo No. 683, February 1996.
• worth what you pay for it. To improve the quality of available electronic information, we must create
• AUTHENTICATED ENCRYPTION So Far ...
• An extended abstract of this paper appears in Advances in Cryptology EUROCRYPT '01, Lecture Notes in Computer Science Vol. 2045, B. Pfitzmann ed., Springer-Verlag, 2001. This is the full version.
• MESSAGE AUTHENTICATION Integrity and authenticity
• A preliminary version of this papers appears in Fast Software Encryption '04, Lecture Notes in Computer Science, vol. ?? , R. Bimal and W. Meier ed., Springer-Verlag, 2004. This is the full version.
• Computer Science and Engineering, UCSD October 12, 1999 Tail Inequalities Author: Bellare
• An extended abstract of this paper appears in Advances in Cryptology EUROCRYPT '01, Lecture Notes in Computer Science Vol. 2045, B. Pfitzmann ed., Springer-Verlag, 2001. This is the full
• Appears in Proceedings of the Second Israel Symposium on Theory and Computing Systems, IEEE, June 1993. Preliminary version in IBM Research Report RC 17969, May 1992.
• Free Bits, PCPs and NonApproximability---Towards Tight Results \Lambda
• Earlier version appeared as MIT Laboratory for Computer Science Technical Report 688, April 1996. Latest version available at http://wwwcse.ucsd.edu/users/mihir.
• Appears in Advances in Cryptology --Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740, E. Brickell ed., SpringerVerlag, 1992.
• An extended abstract of this paper appears in Tatsuaki Okamoto, editor, Advances in Cryptology ---ASIACRYPT 2000, Volume 1976 of Lecture Notes in Computer Science, pages 531--545, Kyoto,
• Appears in Journal of Cryptology Vol. 15, 2002, pp. 271--284. Earlier version was Technical Report CS97529, Department of Computer Science and Engineering, University of California at San Diego,
• An extended abstract of this paper appears in Advances in Cryptology --Crypto 99 Proceedings, Lecture Notes in Computer Science Vol. ??, M. Wiener ed., SpringerVerlag, 1999. This is the full
• A preliminary version of this paper appears in Proceedings of the 35th Symposium on Foundations of Computer Science, IEEE, 1994.
• Appears in Journal of Mathematical Programming B, Vol. 69, No. 3, pp. 429--441, September 1995. Also in Complexity of Numerical Optimization, Ed. P. M. Pardalos, World Scientific, 1993.
• An extended abstract of this paper appears in Advances in Cryptology --EUROCRYPT '01, Lecture Notes in Computer Science Vol. 2045, B. Pfitzmann ed., SpringerVerlag, 2001. This is the full
• COMPUTATIONAL NUMBER THEORY Z = {. . . , -2, -1, 0, 1, 2, . . .}
• Appears in Journal of Computer and System Sciences, Vol. 61, No. 3, Dec 2000, pp. 362{399. Preliminary version was in Advances in Cryptology { Crypto 94 Proceedings, Lecture Notes in
• Appears in Advances in Cryptology Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Springer-Verlag, Y. Desmedt, ed., 1994.
• An extended abstract of this paper appears in Advances in Cryptology Crypto 99 Proceedings, Lec. Notes in Comp. Sci. Vol. ??, M. Wiener ed., Springer-Verlag, 1999. This is the full version.
• An extended abstract of this paper appears in Advances in Cryptology Crypto 99 Proceedings, Lecture Notes in Computer Science Vol. ??, M. Wiener ed., Springer-Verlag, 1999. This is the full
• An extended abstract of this paper appears in Advances in Cryptology { EUROCRYPT '03, Lecture Notes in Computer Science Vol. ??, E. Biham ed., Springer-Verlag, 2003. This is the full version.
• A preliminary version of this paper appears in Topics in Cryptology --CTRSA '05, Lecture Notes in Computer Science Vol. ??, A. Menezes ed., SpringerVerlag, 2005. This is the full version.
• Earlier versions of of this work appear in [9] and [1]. This is the full version. DHIES: An encryption scheme
• The Security of Practical Two-Party RSA Signature Schemes
• Authenticated Key Exchange Secure Against Dictionary Attacks
• TR 98032, Electronic Colloquium on Computational Complexity, June 1998. Uniform Generation of NPwitnesses
• An extended abstract of this paper appears in Christian Cachin, editor, International Colloquium on Automata, Languages and Programming --ICALP 2007, Volume ?? of Lecture Notes in Computer
• A preliminary version of this paper appears in Advances in Cryptology --CRYPTO '99, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., SpringerVerlag, 1999. This revised version
• Asymmetric Encryption The setting of public-key cryptography is also called the "asymmetric" setting due to the asymmetry
• SessionKey Distribution
• Computer Science and Engineering, UCSD Spring 04 CSE 105: Introduction to the Theory of Computation Instructor: Mihir Bellare
• The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
• Electronic Cash Stefan Brands
• An extended abstract of this paper appears in Advances in Cryptology --EUROCRYPT '04, Lecture Notes in Computer Science Vol. 3027, C. Cachin and J. Camenisch eds., SpringerVerlag, 2004. This
• A preliminary version of this paper appeared in Advances in Cryptology --Eurocrypt 97 Proceed ings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., SpringerVerlag, 1997. This is a
• An extended abstract of this paper appears in Advances in Cryptology Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., Springer-Verlag, 1997. This is the
• CRYPTO 2000 August 20--24, 2000, Santa Barbara, California, USA
• Appears in Journal of the ACM, Vol. 39, No. 1, January 1992, pp. 214--233. Prelimanary version in Proceedings of the 20th Annual Symposium on Theory of Computing, ACM, 1988.
• Appears in SIAM J. on Computing, Vol. 23, No. 1, February 1994. The Complexity of Decision versus Search
• Computer Science and Engineering, UCSD Winter 10 CSE 200: Computability and Complexity Instructor: Mihir Bellare
• An extended abstract of this work appears in Advances in Cryptology Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998. This is the
• Appears in RSA Laboratories' CryptoBytes, Vol. 2, No. 1, Spring 1996. Message Authentication using Hash Functions| The
• An extended abstract of this paper appears in Advances in Cryptology { EUROCRYPT '04, Lecture Notes in Computer Science Vol. , C. Cachin and J. Camenisch ed., Springer-Verlag, 2004. This is
• Appears in RSA Laboratories' CryptoBytes, Vol. 2, No. 1, Spring 1996. Message Authentication using Hash Functions---The
• Computer Science and Engineering, UCSD Spring 04 CSE 105: Introduction to the Theory of Computation Instructor: Mihir Bellare
• An extended abstract of this paper appeared as ``Transitive Signatures based on Factoring and RSA'' in Advances in Cryptology --ASIACRYPT '02, Lecture Notes in Computer Science Vol. 2501,
• This paper appears in the Proceedings of the 6th Workshop on Fast Software Encryption, Lecture Notes in Computer Science Vol. ??, Ed. L. Knudsen, SpringerVerlag, 1999.
• Course Information CSE 207 --Modern Cryptography
• An extended abstract of this paper appears in Advances in Cryptology Eurocrypt 98 Proceedings, Lecture Notes in Computer Science Vol. 1403, K. Nyberg ed., Springer-Verlag, 1998. This is the
• A preliminary version of this paper appears in Advances in Cryptology CRYPTO '05, Lecture Notes in Computer Science Vol. , V. Shoup ed., Springer-Verlag, 2005. This is the full version.
• BLOCK CIPHERS Permutations and Inverses
• UNIVERSITT DES SAARLANDES FACHBEREICH 14, INFORMATIK
• CRYPTO 2000 August 20 24, 2000, Santa Barbara, California, USA
• Identity-Based Multi-Signatures from RSA Mihir Bellare1
• An extended abstract of this paper appears in Christian Cachin, editor, International Colloquium on Automata, Languages and Programming ICALP 2007, Volume ?? of Lecture Notes in Computer
• Multi-Signatures in the Plain Public-Key Model and a General Forking Lemma
• A preliminary version of this paper appears in Advances in Cryptology CRYPTO '06, Lecture Notes in Computer Science Vol. 4117 , C. Dwork ed., Springer-Verlag, 2006. This is the full version.
• An extended abstract of this paper appears in Victor Shoup, editor, Advances in Cryptology CRYPTO 2005, Volume 3621 of Lecture Notes in Computer Science, pages 205222, Santa Barbara,
• A preliminary version of this paper appears in Topics in Cryptology CT-RSA '05, Lecture Notes in Computer Science Vol. ??, A. Menezes ed., Springer-Verlag, 2005. This is the full version.
• An extended abstract of this paper appears in Advances in Cryptology EUROCRYPT '04, Lecture Notes in Computer Science Vol. 3027, C. Cachin and J. Camenisch eds., Springer-Verlag, 2004. This
• An extended abstract of this paper appears in Advances in Cryptology EUROCRYPT '04, Lecture Notes in Computer Science Vol. , C. Cachin and J. Camenisch ed., Springer-Verlag, 2004. This is
• An extended abstract of this paper appears in Advances in Cryptology EUROCRYPT '03, Lecture Notes in Computer Science Vol. 2656 , E. Biham ed., Springer-Verlag, 2003. This is the full version.
• An extended abstract of this paper appears in Advances in Cryptology EUROCRYPT '03, Lecture Notes in Computer Science Vol. ??, E. Biham ed., Springer-Verlag, 2003. This is the full version.
• A preliminary version of this paper, entitled "Randomness re-use in multi-recipient encryption schemes," appeared in Public-Key Cryptography '03, Lecture Notes in Computer Science Vol. 2567
• An extended abstract of this paper appears in Lars R. Knudsen, editor, Advances in Cryptology EUROCRYPT 2002, Volume 2332 of Lecture Notes in Computer Science, pages 418433, Amster-
• On-Line Ciphers and the Hash-CBC Constructions A. Boldyreva
• The Security of Practical Two-Party RSA Signature Schemes
• A preliminary version of this paper appears in Advances in Cryptology ASIACRYPT '00, Lecture Notes in Computer Science Vol. 1976, T. Okamoto ed., Springer-Verlag, 2000.
• An abridged version of this paper appears in Advances in Cryptology Crypto '93 Proceedings, Springer-Verlag. This is the full version.
• Provably Secure Session Key Distribution| The Three Party Case
• An extended abstract of this paper appears in Proceedings of the 30th Annual Symposium on the Theory of Computing, ACM, 1998. This is the full version.
• Authenticated Key Exchange Secure Against Dictionary Attacks
• An extended abstract of this paper appears in Advances in Cryptology Crypto 99 Proceedings, Lecture Notes in Computer Science Vol. ??, M. Wiener ed., Springer-Verlag, 1999. This is the full
• This paper appears in the Proceedings of the 6th Workshop on Fast Software Encryption, Lecture Notes in Computer Science Vol. ??, Ed. L. Knudsen, Springer-Verlag, 1999.
• Appears in Proceedings of the 3rd Usenix Workshop on Electronic Commerce, 1998. VarietyCash: a Multi-purpose
• An extended abstract appears in Advances in Cryptology Eurocrypt 98 Proceedings, Lecture Notes in Computer Science Vol. 1403, K. Nyberg ed., Springer-Verlag, 1998. This is the full
• An extended abstract of this paper appears in Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997. This is the full version.
• Appears in Journal of Cryptology Vol. 15, 2002, pp. 271284. Earlier version was Technical Report CS97-529, Department of Computer Science and Engineering, University of California at San Diego,
• Appears in Advances in Cryptology Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.
• A preliminary version of this paper appeared in Advances in Cryptology Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
• Appears in Journal of Cryptology, Vol. 9, No. 1, Winter 1996, pp. 149 166. Preliminary version in Advances in Cryptology Crypto 92 Proceedings, Lecture Notes in Computer Science Vol. 740,
• Appears in Proceedings of First International Workshop on Information Security ISW 97, Lecture Notes in Computer Science Vol. 1396, E. Okamoto, G. Davida and M. Mambo eds., Springer Verlag,
• Introduction to Modern Cryptography Mihir Bellare1
• Introduction Historically, cryptography arose as a means to enable parties to maintain privacy of the information
• SYMMETRIC ENCRYPTION A symmetric encryption scheme SE = (K, E, D) consists of three
• HASH FUNCTIONS What is a hash function?
• Message Authentication In most people's minds, privacy is the goal most strongly associated to cryptography. But message
• STREAM CIPHERS and PRGs Stateful Generators
• The Birthday Problem The setting is that we have q balls. View them as numbered, 1, . . . , q. We also have N bins, where
• Appears in Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, 1996
• Computer Science and Engineering, UCSD Spring 11 CSE 207: Modern Cryptography Instructor: Mihir Bellare
• Computer Science and Engineering, UCSD Fall 10 CSE 107: Introduction to Modern Cryptography Instructor: Mihir Bellare
• Computer Science and Engineering, UCSD Fall 10 CSE 107: Introduction to Modern Cryptography Instructor: Mihir Bellare
• Crypto 2000 General Information August 20-24, 2000, Santa Barbara, California, USA
• An extended abstract of this paper appears in Advances in Cryptology --Eurocrypt 98 Proceedings, Lecture Notes in Computer Science Vol. 1403, K. Nyberg ed., SpringerVerlag, 1998. This is the
• A. BarNoy et al., On Chromatic Sums.. 23 [20] Irani, S. and Leung, V. (1996), Scheduling with Conflicts, and Applications to Traffic
• An abridged version of this paper appears in Proceedings of the Twenty Seventh Annual Symposium on the Theory of Computing, ACM, 1995.
• Appears in Advances in Cryptology --Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., SpringerVerlag, 1996.
• A preliminary version of this paper appears in Advances in Cryptology --EUROCRYPT '00, Lecture Notes in Computer Science Vol. 1807, B. Preneel ed., SpringerVerlag, 2000.
• A preliminary version of this paper appeared in Advances in Cryptology --Eurocrypt 94 Proceed ings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., SpringerVerlag, 1994.
• Appears in Advances in Cryptology --Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, SpringerVerlag, Y. Desmedt, ed., 1994.
• An extended abstract of this paper appears in Advances in Cryptology --ASIACRYPT '04, Lecture Notes in Computer Science Vol. ??, P. J. Lee ed., SpringerVerlag, 2004. This is the full version.
• An abridged version of this paper appears in Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996.
• To appear in Proceedings of the Fourth Annual Conference on Computer and Communications Security , ACM, 1997. Earlier version was Technical Report CS95447, Department of Computer
• A preliminary version of this paper, entitled \Randomness re-use in multi-recipient encryption schemes," appeared in Public-Key Cryptography '03, Lecture Notes in Computer Science Vol. 2567
• Proving Computational Ability Mihir Bellare \Lambda Oded Goldreich y
• An extended abstract of this paper appears in Ninth ACM Conference on Computer and Commu-nications Security, ACM, 2002. This is the full version.
• Computer Science and Engineering, UCSD Spring 04 CSE 105: Introduction to the Theory of Computation Instructor: Mihir Bellare
• Incremental Cryptography and Application to Virus Mihir Bellare \Lambda Oded Goldreich y Shafi Goldwasser z
• Appears in Proceedings of the 3rd Usenix Workshop on Electronic Commerce, 1998. VarietyCash: a Multipurpose
• Incremental Cryptography and Application to Virus Mihir Bellare
• Block Ciphers Blockciphers are the central tool in the design of protocols for shared-key cryptography (aka. sym-
• Appears in the proceedings of the First ACM Conference on Computer and Communications Se-curity, ACM, November 1993.
• A preliminary version of this paper appears in Advances in Cryptology --Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., SpringerVerlag, 1998.
• A preliminary version of this paper appears in Topics in Cryptology { CT-RSA '03, Lecture Notes in Computer Science Vol. ?? , M. Joye ed., Springer-Verlag, 2003. This is the full version.
• This is a slightly extended and updated version of a survey that appears in Complexity Theory Column 12, Sigact News, Vol. 27, No. 1, March 1996. The most recent version is available via
• An extended abstract of this paper appears in Advances in Cryptology { EUROCRYPT '03, Lecture Notes in Computer Science Vol. 2656 , E. Biham ed., Springer-Verlag, 2003. This is the full version.
• Extended abstract appears in Advances in Cryptology | ASIACRYPT 2000, Tatsuaki Okamoto, editor, volume 1976 of Lecture Notes in Computer Science, Springer-Verlag, 2000. c
• An extended abstract of this paper appears in Lars R. Knudsen, editor, Advances in Cryptology --EUROCRYPT 2002, Volume 2332 of Lecture Notes in Computer Science, pages 418--433, Amster
• A preliminary version of this paper appears in Advances in Cryptology --EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, C. Cachin and J. Camenisch ed., SpringerVerlag, 2004.
• A preliminary version of this paper appeared in Advances in Cryptology CRYPTO '02, Lecture Notes in Computer Science Vol. ?? , M. Yung ed., Springer-Verlag, 2002. This is the full version.
• A preliminary version of this paper appears in Advances in Cryptology EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, C. Cachin and J. Camenisch ed., Springer-Verlag, 2004.
• Hash Functions A hash function usually means a function that compresses, meaning the output is shorter than the
• An extended abstract of this paper appears in Ninth ACM Conference on Computer and Commu-nications Security, ACM, 2002. This is the full version.
• ASYMMETRIC ENCRYPTION Recommended Book
• An extended abstract of this paper appears in Advances in Cryptology ASIACRYPT '04, Lecture Notes in Computer Science Vol. ??, P. J. Lee ed., Springer-Verlag, 2004. This is the full version.
• An extended abstract of this paper appeared as "Transitive Signatures based on Factoring and RSA" in Advances in Cryptology ASIACRYPT '02, Lecture Notes in Computer Science Vol. 2501,
• A preliminary version of this paper appears in Topics in Cryptology CT-RSA '03, Lecture Notes in Computer Science Vol. ?? , M. Joye ed., Springer-Verlag, 2003. This is the full version.
• The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
• A preliminary version of this paper appears in Proceedings of the 13th Annual Conference on Computer and Communications Security, ACM, 2006. This is the full version.
• IEEE Journal of Selected Areas in Communications, VOL ?, NO. ?, ? 2000 1 Design, Implementation and Deployment of the
• OnLine Ciphers and the HashCBC Constructions M. Bellare # A. Boldyreva + L. Knudsen # C. Namprempre
• An extended abstract of this paper appeared as ``Transitive Signatures based on Factoring and RSA'' in Advances in Cryptology --ASIACRYPT '02, Lecture Notes in Computer Science Vol. 2501,
• An extended abstract appears in Advances in Cryptology --Eurocrypt 98 Proceedings, Lecture Notes in Computer Science Vol. 1403, K. Nyberg ed., SpringerVerlag, 1998. This is the full
• A preliminary version of this paper appeared in Advances in Cryptology { CRYPTO '04, Lecture Notes in Computer Science Vol. ?? , M. Franklin ed., Springer-Verlag, 2004. This is the full version.
• A preliminary version of this paper appeared in Advances in Cryptology --Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., SpringerVerlag, 1995.
• Appears in Proceedings of First International Workshop on Information Security (ISW 97), Lecture Notes in Computer Science Vol. 1396, E. Okamoto, G. Davida and M. Mambo eds., Springer Verlag,
• An extended abstract of this paper appears in Proceedings of the 30th Annual Symposium on the Theory of Computing, ACM, 1998. This is the full version.
• Appears in Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, 1996
• An extended abstract of this paper appears in Advances in Cryptology { EUROCRYPT '01, Lecture Notes in Computer Science Vol. 2045, B. P tzmann ed., Springer-Verlag, 2001. This is the full version.
• TR 98-032, Electronic Colloquium on Computational Complexity, June 1998. Uniform Generation of NP-witnesses
• An abridged version of this paper appears in Advances in Cryptology Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed., Springer-Verlag, 1997.
• An extended abstract of this paper appears in Advances in Cryptology ASIACRYPT '01, Lecture Notes in Computer Science Vol. 2248, C. Boyd ed., Springer-Verlag, 2001. This is full version.
• Computational Number Theory 9.1 The basic groups
• Pseudorandom Functions Pseudorandom functions (PRFs) and their cousins, pseudorandom permutations (PRPs), figure as
• Appears in Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, ACM (1993). Efficient Probabilistically Checkable Proofs
• Appears in Advances in Cryptology --Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., SpringerVerlag, 1997.
• A preliminary version of this paper appears in Proceedings of the 13th Annual Conference on Computer and Communications Security , ACM, 2006. This is the full version.
• A preliminary version of this paper appeared in Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, ACM (1992).
• A preliminary version of this papers appears in Advances in Cryptology { ASIACRYPT '00, Lecture Notes in Computer Science Vol. 1976, T. Okamoto ed., Springer-Verlag, 2000. This is the full
• An extended abstract of this paper appears in Advances in Cryptology { ASIACRYPT '01, Lecture Notes in Computer Science Vol. 2248, C. Boyd ed., Springer-Verlag, 2001. This is full version.
• An extended abstract of this paper appears in Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE, 1997. This is the full version.
• An extended abstract of this paper appears in Advances in Cryptology --Crypto 99 Proceedings, Lec. Notes in Comp. Sci. Vol. ??, M. Wiener ed., SpringerVerlag, 1999. This is the full version.
• A preliminary version of this paper appears in Advances in Cryptology Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998.
• A preliminary version of this paper appeared in Advances in Cryptology Eurocrypt 94 Proceed-ings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed., Springer-Verlag, 1994.
• An extended abstract of this paper appears in Advances in Cryptology --Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed., SpringerVerlag, 1997. This is the
• An extended abstract of this work appears in Advances in Cryptology --Crypto 98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., SpringerVerlag, 1998. This is the
• Appears in Computational Complexity Vol. 3, 319--354, 1993. Preliminary version in FOCS 90. Randomness in Interactive Proofs \Lambda
• A preliminary version of this papers appears in Fast Software Encryption '04, Lecture Notes in Computer Science, vol. ?? , R. Bimal and W. Meier ed., SpringerVerlag, 2004. This is the full version.
• A preliminary version of this paper appears in Advances in Cryptology --CRYPTO '05, Lecture Notes in Computer Science Vol. , V. Shoup ed., SpringerVerlag, 2005. This is the full version.
• An extended abstract of this paper appears in Advances in Cryptology --Crypto 99 Proceedings, Lecture Notes in Computer Science Vol. ??, M. Wiener ed., SpringerVerlag, 1999. This is the full
• Provably Secure Session Key Distribution---The Three Party Case
• A preliminaryversion of this paper appears in Advances inCryptology EUROCRYPT '00, Lecture Notes in Computer Science Vol. 1807, B. Preneel ed., Springer-Verlag, 2000.
• An abridged version of this paper appears in Advances in Cryptology --Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., SpringerVerlag, 1996.
• Computer Science and Engineering, UCSD October 12, 1999 Tail Inequalities Author: Bellare
• A preliminary version of this paper appeared in Advances in Cryptology { CRYPTO '02, Lecture Notes in Computer Science Vol. ?? , M. Yung ed., Springer-Verlag, 2002. This is the full version.
• Earlier versions of of this work appear in [9] and [1]. This is the full version. DHIES: An encryption scheme
• Computer Science and Engineering, UCSD Spring 04 CSE 105: Introduction to the Theory of Computation Instructor: Mihir Bellare
• Appears in the proceedings of the First ACM Conference on Computer and Communications Se curity, ACM, November 1993.
• Computer Science and Engineering, UCSD October 7, 1999 GoldreichLevin Theorem Author: Bellare
• IEEE Journal of Selected Areas in Communications, VOL ?, NO. ?, ? 2000 1 Design, Implementation and Deployment of the
• An abridged version of this paper appears in Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996.
• Computer Science and Engineering, UCSD October 7, 1999 Goldreich-Levin Theorem Author: Bellare
• Computer Science and Engineering, UCSD Wi12 CSE 107: Introduction to Modern Cryptography Instructor: Mihir Bellare