M. Bellare

发表

Random oracles are practical: a paradigm for designing efficient protocols

Mihir Bellare, Phillip Rogaway, M. Bellare, 1993, CCS '93.

THE SPECTRAL NORM OF FINITE FUNCTIONS

M. Bellare, 1991 .

Efficient probabilistic checkable proofs and applications to approximation

M. Bellare, S. Goldwasser, A. Russell, 1994, STOC '94.

A Conventional Authenticated-Encryption Mode

D. Wagner, M. Bellare, P. Rogaway, 2003 .

Key-Privacy in Public-Key Encryption

Mihir Bellare, David Pointcheval, Alexandra Boldyreva, 2001, ASIACRYPT.

Adaptive Witness Encryption and Asymmetric Password-Based Cryptography

Mihir Bellare, Viet Tung Hoang, M. Bellare, 2015, Public Key Cryptography.

HMAC: Keyed-Hashing for Message Authentication, RFC 2104

M. Bellare, H. Krawczyk, 2000 .

Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig

Mihir Bellare, Sarah Meiklejohn, Susan Thomson, 2014, EUROCRYPT.

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

M. Bellare, T. Kohno, Pascal Paillier, 2008, Journal of Cryptology.

The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols

Mihir Bellare, Adriana Palacio, M. Bellare, 2004, CRYPTO.

Towards Plaintext-Aware Public-Key Encryption Without Random Oracles

Mihir Bellare, Adriana Palacio, M. Bellare, 2004, ASIACRYPT.

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Mihir Bellare, Eike Kiltz, Tadayoshi Kohno, 2005, Journal of Cryptology.

Lecture Notes on Cryptography

Mihir Bellare, Shafi Goldwasser, M. Bellare, 2001 .

A concrete security treatment of symmet-ric encryption: Analysis of the DES modes of operation

Mihir Bellare, Phillip Rogaway, Anand Desai, 1997, FOCS 1997.

Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements

Silvio Micali, Mihir Bellare, Alexandra Boldyreva, 2000, EUROCRYPT.

Mass-surveillance without the State: Strongly Undetectable Algorithm-Substitution Attacks

Mihir Bellare, Daniel Kane, Joseph Jaeger, 2015, IACR Cryptol. ePrint Arch..

Design, implementation, and deployment of the iKP secure electronic payment system

Hugo Krawczyk, Mihir Bellare, Gene Tsudik, 2000, IEEE Journal on Selected Areas in Communications.

How to sign given any trapdoor function

Silvio Micali, Mihir Bellare, S. Micali, 1988, STOC '88.

Batch Verification with Applications to Cryptography and Checking

Mihir Bellare, Tal Rabin, Juan A. Garay, 1998, LATIN.

Free bits, PCPs and non-approximability-towards tight results

Mihir Bellare, Oded Goldreich, Madhu Sudan, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

New Multi-Signature Schemes and a General Forking Lemma

M. Bellare, G. Neven, 2017 .

The complexity of approximating a nonlinear program

Mihir Bellare, Phillip Rogaway, M. Bellare, 1995, Math. Program..

Keying Hash Functions for Message Authentication

Hugo Krawczyk, Ran Canetti, Mihir Bellare, 1996, CRYPTO.

Fast Batch Verification for Modular Exponentiation and Digital Signatures

Mihir Bellare, Tal Rabin, Juan A. Garay, 1998, IACR Cryptol. ePrint Arch..

On Defining Proofs of Knowledge

Mihir Bellare, Oded Goldreich, M. Bellare, 1992, CRYPTO.

Multi-Recipient Encryption Schemes: Security Notions and Randomness Re-Use

M. Bellare, A. Boldyreva, Jessica Staddon, 2003 .

On Deening Proofs of Knowledge

M. Bellare, Oded Goldreichy, 1992 .

The EAX Mode of Operation (A Two-Pass Authenticated-Encryption Scheme Optimized for Simplicity and Efficiency)

Mihir Bellare, David Wagner, Phillip Rogaway, 2004 .

The EAX mode of operation - eScholarship

Mihir Bellare, David Wagner, Phillip Rogaway, 2004 .

The FFX Mode of Operation for Format-Preserving Encryption Draft 1 . 1

M. Bellare, P. Rogaway, T. Spies, 2010 .

DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem

Mihir Bellare, Phillip Rogaway, Michel Abdalla, 1999, IACR Cryptol. ePrint Arch..

Authenticated encryption in SSH: provably fixing the SSH binary packet protocol

Chanathip Namprempre, Mihir Bellare, Tadayoshi Kohno, 2002, CCS '02.

Provable Security Support for the Skein Hash Family Version 1

M. Bellare, 2009 .

Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization

Amit Sahai, Mihir Bellare, M. Bellare, 1999, CRYPTO.

Robust Encryption

Mihir Bellare, Gregory Neven, Michel Abdalla, 2010, TCC.

Making Zero Knowledge Provers E cient

M. Bellare, Erez Petrank, E. Petrank, 1995 .

The Multi-Base Discrete Logarithm Problem: Non-Rewinding Proofs and Improved Reduction Tightness for Identification and Signatures

M. Bellare, Wei Dai, 2020 .

Evaluation of Security Level of Cryptography

M. Bellare, P. Rogaway, D. Boneh, 2001 .

Foundations of group signatures: Formal de ni-tions

Mihir Bellare, Bogdan Warinschi, Daniele Micciancio, 2003 .

Signcryption in iMessage

M. Bellare, Igors Stepanovs, 2020 .

On-line Ciphers and the Hash-CBC Constructions

Chanathip Namprempre, Mihir Bellare, Lars R. Knudsen, 2012, Journal of Cryptology.

Lectures on NIZKs

M. Bellare, 2020 .

Submission to Journal of Cryptology . Encryption Schemes Secure under Selective Opening Attack

M. Bellare, Scott Yilek, 2012 .

Secure Multi-party Computation Dedication a Warning

M. Bellare, Oded Goldreich, H. Attiya, 1998 .

A New Suggestion for How to Encrypt with Rsa

M. Bellare, Phillip Rogawayy, 1994 .

Entity a U T H E N Tication and Key Distribution

M. Bellare, P. Rogaway, 1993 .

A theoretical treatment of related-key attacks

Mihir Bellare, Tadayoshi Kohno, M. Bellare, 2003 .

Addendum to “ The FFX Mode of Operation for Format-Preserving Encryption ” A parameter collection for enciphering strings of arbitrary radix and length

M. Bellare, P. Rogaway, T. Spies, 2010 .

A Conventional Authenticated-Encryption Mode

D. Wagner, M. Bellare, P. Rogaway, 2003 .

Design, Implementation and Deployment of a Secure Account-Based Electronic Payment System

Hugo Krawczyk, Ralf Hauser, Mihir Bellare, 2000 .

Encryption schemes: security notions, designs and analyses

Mihir Bellare, Anand Desai, M. Bellare, 2000 .

An Extension of the FF2 FPE Scheme

Mihir Bellare, Joachim Vance, M. Bellare, 2014 .

The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures

Mihir Bellare, Wei Dai, M. Bellare, 2020, INDOCRYPT.

Stronger Security for Non-Interactive Threshold Signatures: BLS and FROST

M. Bellare, Stefano Tessaro, Chenzhi Zhu, 2022 .

Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology

Mihir Bellare, M. Bellare, 2000 .

Foundations for Group Signatures: Simplified Requirements and a Construction Based on General Assumptions

Mihir Bellare, Bogdan Warinschi, Daniele Micciancio, 2003 .

Double-Authentication-Preventing Signatures from Trapdoor Identification

Mihir Bellare, Douglas Stebila, M. Bellare, 2015, IACR Cryptol. ePrint Arch..

Incremental Cryptography Revisited: PRFs, Nonces and Modular Design

Mihir Bellare, Vivek Arte, Louiza Khati, 2020, IACR Cryptol. ePrint Arch..

Incremental Cryptography and Application to Virus ProtectionMihir Bellare

Mihir Bellare, M. Bellare, Oded Goldreichy, 2014 .

On the Structure of Secret Key Exchange Protocols

Lenore Cowen, Mihir Bellare, Shafi Goldwasser, 1989, Distributed Computing And Cryptography.

Authenticated encryption in SSH

Chanathip Namprempre, Mihir Bellare, Tadayoshi Kohno, 2002, CCS 2002.

Process for encryption / decryption of data using Cipher Block Chaining (CBC), and Message Authentication Code (MAC)

Mihir Bellare, Phillip Rogaway, M. Bellare, 1996 .

UCE+LTDFs: Efficient, Subversion-Resistant PKE in the Standard Model

Mihir Bellare, Viet Tung Hoang, M. Bellare, 2014, IACR Cryptology ePrint Archive.

The Multi-Base Discrete Logarithm Problem: Concrete Security Improvements for Schnorr Identification, Signatures and Multi-Signatures

Mihir Bellare, Wei Dai, M. Bellare, 2020, IACR Cryptol. ePrint Arch..

Searchable encryption revisited

Tanja Lange, Mihir Bellare, Eike Kiltz, 2006, CRYPTO 2006.

Advances in Cryptology — CRYPTO '97

Mihir Bellare, Sara K. Miner, M. Bellare, 1996, Lecture Notes in Computer Science.

Introduction to Modern Cryptography

Mihir Bellare, Phillip Rogaway, M. Bellare, 2019 .

The Security of a Family of Two-Party RSA Signature Schemes

Mihir Bellare, Ravi S. Sandhu, M. Bellare, 2001 .

Separate Your Domains: NIST PQC KEMs and Oracle Cloning

Mihir Bellare, Felix Günther, Hannah Davis, 2020 .

Proof Checking and Approximation: Towards Tight Results

M. Bellare, 1996 .

Robust Encryption

Mihir Bellare, Gregory Neven, Michel Abdalla, 2010, Journal of Cryptology.

“Pseudo-Random” Number Generation within Cryptographic Algorithms: the DSS Case

M. Bellare, S. Goldwasser, D. Micciancio, 2021 .

The Local Forking Lemma and its Application to Deterministic Encryption

Mihir Bellare, Wei Dai, Lucy Li, 2019, IACR Cryptol. ePrint Arch..

Public-Key Encryption Resistant to Parameter Subversion and its Realization from Efficiently-Embeddable Groups

Mihir Bellare, Eike Kiltz, Benedikt Auerbach, 2018, IACR Cryptol. ePrint Arch..

Nonce-Based Cryptography: Retaining Security When Randomness Fails

Mihir Bellare, Björn Tackmann, M. Bellare, 2016, EUROCRYPT.

Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model

Mihir Bellare, Viet Tung Hoang, M. Bellare, 2015, EUROCRYPT.

How Secure is Deterministic Encryption?

Mihir Bellare, Rafael Dowsley, Sriram Keelveedhi, 2015, Public Key Cryptography.

Security of Symmetric Encryption against Mass Surveillance

Kenneth G. Paterson, Mihir Bellare, Phillip Rogaway, 2014, IACR Cryptol. ePrint Arch..

Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation

Mihir Bellare, Stefano Tessaro, Igors Stepanovs, 2014, ASIACRYPT.

Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition

Mihir Bellare, Adam O'Neill, M. Bellare, 2013, CANS.

Instantiating Random Oracles via UCEs

Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi, 2013, IACR Cryptol. ePrint Arch..

DupLESS: Server-Aided Encryption for Deduplicated Storage

Mihir Bellare, Thomas Ristenpart, Sriram Keelveedhi, 2013, USENIX Security Symposium.

Message-Locked Encryption and Secure Deduplication

Mihir Bellare, Thomas Ristenpart, Sriram Keelveedhi, 2013, EUROCRYPT.

Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed?

Mihir Bellare, Eike Kiltz, Dennis Hofheinz, 2013, Journal of Cryptology.

Foundations of garbled circuits

Mihir Bellare, Phillip Rogaway, Viet Tung Hoang, 2012, CCS.

Semantic Security for the Wiretap Channel

Alexander Vardy, Mihir Bellare, Stefano Tessaro, 2012, CRYPTO.

Standard Security Does Not Imply Security against Selective-Opening

Brent Waters, Mihir Bellare, Rafael Dowsley, 2012, EUROCRYPT.

Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity pdf

Mihir Bellare, Stefano Tessaro, M. Bellare, 2012, IACR Cryptol. ePrint Arch..

A Cryptographic Treatment of the Wiretap Channel

Alexander Vardy, Mihir Bellare, Stefano Tessaro, 2012, IACR Cryptol. ePrint Arch..

Authenticated and Misuse-Resistant Encryption of Key-Dependent Data

Mihir Bellare, Sriram Keelveedhi, M. Bellare, 2011, IACR Cryptol. ePrint Arch..

Identity-Based Encryption Secure against Selective Opening Attack

Brent Waters, Mihir Bellare, Scott Yilek, 2011, TCC.

Cryptographic Agility and Its Relation to Circular Encryption

David Cash, Mihir Bellare, Tolga Acar, 2010, EUROCRYPT.

Hedged Public-Key Encryption: How to Protect against Bad Randomness

Hovav Shacham, Moni Naor, Mihir Bellare, 2009, ASIACRYPT.

Format-Preserving Encryption

Mihir Bellare, Thomas Ristenpart, Phillip Rogaway, 2009, IACR Cryptol. ePrint Arch..

Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

Mihir Bellare, Dennis Hofheinz, Scott Yilek, 2009, EUROCRYPT.

Encryption Schemes Secure under Selective Opening Attack

Mihir Bellare, Scott Yilek, M. Bellare, 2009, IACR Cryptol. ePrint Arch..

Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles

Adam O'Neill, Marc Fischlin, Mihir Bellare, 2008, CRYPTO.

Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm

Chanathip Namprempre, Mihir Bellare, M. Bellare, 2000, Journal of Cryptology.

Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security

Mihir Bellare, Jessica Staddon, Alexandra Boldyreva, 2007, IEEE Transactions on Information Theory.

Robust computational secret sharing and a unified account of classical secret-sharing goals

Mihir Bellare, Phillip Rogaway, M. Bellare, 2007, CCS '07.

Deterministic and Efficiently Searchable Encryption

Mihir Bellare, Alexandra Boldyreva, Adam O'Neill, 2007, CRYPTO.

Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation

Mihir Bellare, Tadayoshi Kohno, Victor Shoup, 2006, CCS '06.

The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs

Mihir Bellare, Phillip Rogaway, M. Bellare, 2006, EUROCRYPT.

Protecting against key-exposure: strongly key-insulated encryption with optimal threshold

Mihir Bellare, Adriana Palacio, M. Bellare, 2005, Applicable Algebra in Engineering, Communication and Computing.

Foundations of Group Signatures: The Case of Dynamic Groups

Mihir Bellare, Chong Zhang, Haixia Shi, 2005, CT-RSA.

An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem

Mihir Bellare, Alexandra Boldyreva, Adriana Palacio, 2004, EUROCRYPT.

Breaking and provably repairing the SSH authenticated encryption scheme: A case study of the Encode-then-Encrypt-and-MAC paradigm

Chanathip Namprempre, Mihir Bellare, Tadayoshi Kohno, 2004, TSEC.

Code-Based Game-Playing Proofs and the Security of Triple Encryption

Mihir Bellare, Phillip Rogaway, M. Bellare, 2004, IACR Cryptol. ePrint Arch..

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions

Mihir Bellare, Bogdan Warinschi, Daniele Micciancio, 2003, EUROCRYPT.

Forward-Security in Private-Key Cryptography

Mihir Bellare, Bennet S. Yee, M. Bellare, 2003, CT-RSA.

Randomness Re-use in Multi-recipient Encryption Schemeas

Mihir Bellare, Jessica Staddon, Alexandra Boldyreva, 2003, Public Key Cryptography.

OCB: a block-cipher mode of operation for efficient authenticated encryption

Mihir Bellare, John Black, Phillip Rogaway, 2001, CCS '01.

Does Encryption with Redundancy Provide Authenticity?

Mihir Bellare, Jee Hea An, M. Bellare, 2001, EUROCRYPT.

The Security of Chaffing and Winnowing

Mihir Bellare, Alexandra Boldyreva, M. Bellare, 2000, ASIACRYPT.

Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography

Mihir Bellare, Phillip Rogaway, M. Bellare, 2000, ASIACRYPT.

Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques

Mihir Bellare, Michel Abdalla, M. Bellare, 2000, ASIACRYPT.

Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions

Mihir Bellare, Jee Hea An, M. Bellare, 1999, CRYPTO.

On the Construction of Variable-Input-Length Ciphers

Mihir Bellare, Phillip Rogaway, M. Bellare, 1999, FSE.

A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion

Mihir Bellare, Russell Impagliazzo, M. Bellare, 1999, IACR Cryptol. ePrint Arch..

Relations among Notions of Security for Public-Key Encryption Schemes

Mihir Bellare, David Pointcheval, Phillip Rogaway, 1998, IACR Cryptol. ePrint Arch..

Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems

Amit Sahai, Mihir Bellare, Shai Halevi, 1998, CRYPTO.

Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible

Mihir Bellare, Phillip Rogaway, Ted Krovetz, 1998, EUROCRYPT.

Minimizing the use of random oracles in authenticated encryption schemes

Mihir Bellare, Phillip Rogaway, M. Bellare, 1997, ICICS.

A concrete security treatment of symmetric encryption

Mihir Bellare, Phillip Rogaway, Anand Desai, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

Does parallel repetition lower the error in computationally sound protocols?

Moni Naor, Mihir Bellare, Russell Impagliazzo, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

Practice-Oriented Provable-Security

Mihir Bellare, M. Bellare, 1997, ISW.

"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case

Mihir Bellare, Shafi Goldwasser, Daniele Micciancio, 1997, CRYPTO.

Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function

Markus Jakobsson, Moti Yung, Mihir Bellare, 1997, EUROCRYPT.

Encapsulated Key Escrow

Mihir Bellare, Shafi Goldwasser, M. Bellare, 1996 .

Incremental cryptography and application to virus protection

Mihir Bellare, Oded Goldreich, Shafi Goldwasser, 1995, STOC '95.

Provably secure session key distribution: the three party case

Mihir Bellare, Phillip Rogaway, M. Bellare, 1995, STOC '95.

Optimal Asymmetric Encryption-How to Encrypt with RSA

Mihir Bellare, M. Bellare, 1995 .

Entity Authentication and Key Distribution

Mihir Bellare, Phillip Rogaway, M. Bellare, 1993, CRYPTO.

A Note on Negligible Functions

Mihir Bellare, M. Bellare, 2002, Journal of Cryptology.

Identification Protocols Secure against Reset Attacks

Marc Fischlin, Silvio Micali, Mihir Bellare, 2001, EUROCRYPT.

Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing

Mihir Bellare, Tal Rabin, Juan A. Garay, 1996, PODC '96.

Multi-instance Security and Its Application to Password-Based Cryptography

Mihir Bellare, Stefano Tessaro, Thomas Ristenpart, 2012, CRYPTO.

Authenticated Key Exchange Secure against Dictionary Attacks

Mihir Bellare, David Pointcheval, Phillip Rogaway, 2000, EUROCRYPT.

A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract)

Hugo Krawczyk, Ran Canetti, Mihir Bellare, 1998, STOC '98.

Optimal Asymmetric Encryption

Mihir Bellare, Phillip Rogaway, M. Bellare, 1994, EUROCRYPT.

A Forward-Secure Digital Signature Scheme

Mihir Bellare, Sara Miner More, M. Bellare, 1999, CRYPTO.

Uniform Generation of NP-Witnesses Using an NP-Oracle

Mihir Bellare, Oded Goldreich, Erez Petrank, 2000, Inf. Comput..

The Complexity of Decision Versus Search

Mihir Bellare, Shafi Goldwasser, M. Bellare, 1991, SIAM J. Comput..

Languages that are easier than their proofs

Joan Feigenbaum, Mihir Bellare, Shafi Goldwasser, 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

Efficient Garbling from a Fixed-Key Blockcipher

Mihir Bellare, Phillip Rogaway, Viet Tung Hoang, 2013, 2013 IEEE Symposium on Security and Privacy.

HMAC: Keyed-Hashing for Message Authentication

Hugo Krawczyk, Ran Canetti, Mihir Bellare, 1997, RFC.

Chain Reductions for Multi-signatures and the HBMS Scheme

Mihir Bellare, Wei Dai, M. Bellare, 2021, ASIACRYPT.

Chain Reductions for Multi-Signatures

Mihir Bellare, Wei Dai, M. Bellare, 2021, IACR Cryptol. ePrint Arch..

Identity-Based Multi-signatures from RSA

Mihir Bellare, Gregory Neven, M. Bellare, 2007, CT-RSA.

Multi-signatures in the plain public-Key model and a general forking lemma

Mihir Bellare, Gregory Neven, M. Bellare, 2006, CCS '06.

The Security of the Cipher Block Chaining Message Authentication Code

Mihir Bellare, Joe Kilian, Phillip Rogaway, 2000, J. Comput. Syst. Sci..

XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions

Mihir Bellare, Roch Guérin, Phillip Rogaway, 1995, CRYPTO.

NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion

Georg Fuchsbauer, Mihir Bellare, Alessandra Scafuro, 2016, IACR Cryptol. ePrint Arch..

The EAX Mode of Operation

Mihir Bellare, David A. Wagner, Phillip Rogaway, 2004, FSE.

OCB: A block-cipher mode of operation for efficient authenticated encryption

M. Bellare, P. Rogaway, J. Black, 2003, TSEC.

EAX: A Conventional Authenticated-Encryption Mode

Mihir Bellare, David A. Wagner, Phillip Rogaway, 2003, IACR Cryptol. ePrint Arch..

The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin

Mihir Bellare, Phillip Rogaway, M. Bellare, 1996, EUROCRYPT.

Incremental Cryptography: The Case of Hashing and Signing

Mihir Bellare, Oded Goldreich, Shafi Goldwasser, 1994, CRYPTO.

The Security of Cipher Block Chaining

Mihir Bellare, Joe Kilian, Phillip Rogaway, 1994, CRYPTO.

On the Structure of Secret Key Exchange Protocols

Lenore Cowen, Mihir Bellare, Shafi Goldwasser, 1989, Distributed Computing And Cryptography.

New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs

Mihir Bellare, Shafi Goldwasser, M. Bellare, 1989, CRYPTO.

Non-Interactive Oblivious Transfer and Spplications

Silvio Micali, Mihir Bellare, S. Micali, 1989, CRYPTO.

New Proofs for NMAC and HMAC: Security without Collision Resistance

Mihir Bellare, M. Bellare, 2015, Journal of Cryptology.

New Proofs for NMAC and HMAC: Security without Collision Resistance

Mihir Bellare, M. Bellare, 2006, Journal of Cryptology.

The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES

Mihir Bellare, Phillip Rogaway, Michel Abdalla, 2001, CT-RSA.

Improved Security Analyses for CBC MACs

Mihir Bellare, Phillip Rogaway, Krzysztof Pietrzak, 2005, CRYPTO.

Verifiable partial key escrow

Mihir Bellare, Shafi Goldwasser, M. Bellare, 1997, CCS '97.

A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost

Mihir Bellare, Daniele Micciancio, M. Bellare, 1997, EUROCRYPT.

Collision-Resistant Hashing: Towards Making UOWHFs Practical

Mihir Bellare, Phillip Rogaway, M. Bellare, 1997, CRYPTO.

On Chromatic Sums and Distributed Resource Allocation

Mihir Bellare, Amotz Bar-Noy, Hadas Shachnai, 1998, Inf. Comput..

Interactive proofs and approximation: reductions from two provers in one round

Mihir Bellare, M. Bellare, 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

Multi-Property-Preserving Hash Domain Extension and the EMD Transform

Mihir Bellare, Thomas Ristenpart, M. Bellare, 2006, ASIACRYPT.

Interactive Message-Locked Encryption and Secure Deduplication

Mihir Bellare, Sriram Keelveedhi, M. Bellare, 2015, Public Key Cryptography.

Cryptography Secure Against Related-Key Attacks and Tampering

David Cash, Mihir Bellare, Rachel Miller, 2011, IACR Cryptol. ePrint Arch..

Forward Integrity For Secure Audit Logs

Mihir Bellare, Bennet S. Yee, Bennet Yee, 1997 .

Hash Function Balance and Its Impact on Birthday Attacks

Mihir Bellare, Tadayoshi Kohno, M. Bellare, 2004, EUROCRYPT.

iKP - A Family of Secure Electronic Payment Protocols

Mihir Bellare, Gene Tsudik, Amir Herzberg, 1995, USENIX Workshop on Electronic Commerce.

Dual-Mode NIZKs: Possibility and Impossibility Results for Property Transfer

Mihir Bellare, Vivek Arte, M. Bellare, 2020, IACR Cryptol. ePrint Arch..

A Characterization of Chameleon Hash Functions and New, Efficient Designs

Mihir Bellare, Todor Ristov, M. Bellare, 2014, Journal of Cryptology.

Practice-Oriented Provable Security

Mihir Bellare, M. Bellare, 1998, Lectures on Data Security.

Proving Computational Ability

Mihir Bellare, Oded Goldreich, M. Bellare, 2011, Studies in Complexity and Cryptography.

On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge

Mihir Bellare, Oded Goldreich, M. Bellare, 2006, IACR Cryptol. ePrint Arch..

The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3

Mihir Bellare, Björn Tackmann, M. Bellare, 2016, CRYPTO.

The Power of Verification Queries in Message Authentication and Authenticated Encryption

Mihir Bellare, Oded Goldreich, Anton Mityagin, 2004, IACR Cryptol. ePrint Arch..

Transitive Signatures Based on Factoring and RSA

Mihir Bellare, Gregory Neven, M. Bellare, 2002, ASIACRYPT.

The AuthA Protocol for Password-Based Authenticated Key Exchange

Mihir Bellare, Phillip Rogaway, M. Bellare, 2000 .

A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications

Mihir Bellare, Tadayoshi Kohno, M. Bellare, 2003, EUROCRYPT.

Certifying Permutations: Noninteractive zero-knowledge based on any trapdoor permutation

Moti Yung, Mihir Bellare, M. Bellare, 1996, Journal of Cryptology.

Certifying Cryptographic Tools: The Case of Trapdoor Permutations

Moti Yung, Mihir Bellare, M. Bellare, 1992, CRYPTO.

PSS: Provably Secure Encoding Method for Digital Signatures

Mihir Bellare, Phillip Rogaway, M. Bellare, 1998 .

Unrestricted Aggregate Signatures

Chanathip Namprempre, Mihir Bellare, Gregory Neven, 2007, ICALP.

The (true) complexity of statistical zero knowledge

Rafail Ostrovsky, Silvio Micali, Mihir Bellare, 1990, STOC '90.

The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme

Chanathip Namprempre, Mihir Bellare, David Pointcheval, 2003, Journal of Cryptology.

Pseudorandom functions revisited: the cascade construction and its concrete security

Hugo Krawczyk, Ran Canetti, Mihir Bellare, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

HOTP: An HMAC-Based One-Time Password Algorithm

David M'Raïhi, David Naccache, Mihir Bellare, 2005, RFC.

Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability

Mihir Bellare, Hannah Davis, Felix Günther, 2020, IACR Cryptol. ePrint Arch..

From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security

Chanathip Namprempre, Mihir Bellare, Jee Hea An, 2002, EUROCRYPT.

Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles

Mihir Bellare, Sarah Shoup, M. Bellare, 2007, Public Key Cryptography.

Better than Advertised Security for Non-interactive Threshold Signatures

Elizabeth C. Crites, M. Bellare, Stefano Tessaro, 2022, CRYPTO.

New Negative Results on Differing-Inputs Obfuscation

Brent Waters, Mihir Bellare, Igors Stepanovs, 2016, EUROCRYPT.

Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing

Mihir Bellare, Phillip Rogaway, Viet Tung Hoang, 2012, ASIACRYPT.

Security Proofs for Identity-Based Identification and Signature Schemes

Chanathip Namprempre, Mihir Bellare, Gregory Neven, 2008, Journal of Cryptology.

Randomness-efficient oblivious sampling

Mihir Bellare, John Rompel, M. Bellare, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Intensive Convergence Encryption for Secure Deduplication in Cloud

M. Bellare, M. Laurent, P. Lee, 2016 .

Knowledge on the average—perfect, statistical and logarithmic

Mihir Bellare, Ramarathnam Venkatesan, William Aiello, 1995, STOC '95.

Making zero-knowledge provers efficient

Mihir Bellare, Erez Petrank, M. Bellare, 1992, STOC '92.

Making Zero-Knowledge Provers Efficient ( Extended Abstract )

M. Bellare, E. Petrank, 2021 .

RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures

Kenneth G. Paterson, Mihir Bellare, Susan Thomson, 2012, IACR Cryptol. ePrint Arch..

Identity-Based (Lossy) Trapdoor Functions and Applications

Brent Waters, Mihir Bellare, Eike Kiltz, 2012, EUROCRYPT.

Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme

Mihir Bellare, Thomas Ristenpart, M. Bellare, 2009, EUROCRYPT.

Two-tier signatures from the Fiat-Shamir transform, with applications to strongly unforgeable and one-time signatures

Mihir Bellare, Sarah Shoup, M. Bellare, 2008, IET Inf. Secur..

Efficient probabilistic checkable proofs and applications to approximation

Carsten Lund, Alexander Russell, Mihir Bellare, 1994, STOC '94.

Contention in Cryptoland: Obfuscation, Leakage and UCE

Mihir Bellare, Stefano Tessaro, Igors Stepanovs, 2016, TCC.

How to sign given any trapdoor permutation

Silvio Micali, Mihir Bellare, S. Micali, 1992, JACM.

When Messages are Keys: Is HMAC a dual-PRF?

M. Bellare, Felix Günther, Matilda Backendal, 2023, IACR Cryptology ePrint Archive.

Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of an HMAC Assumption

Mihir Bellare, Anna Lysyanskaya, M. Bellare, 2015, IACR Cryptol. ePrint Arch..

How To Sign Given Any Trapdoor Function (extended abstract)

Silvio Micali, Mihir Bellare, S. Micali, 1988, STOC 1988.

Randomness in interactive proofs

Mihir Bellare, Oded Goldreich, Shafi Goldwasser, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Hash-Function Based PRFs: AMAC and Its Multi-User Security

Mihir Bellare, Stefano Tessaro, Daniel J. Bernstein, 2016, EUROCRYPT.

Efficient Schemes for Committing Authenticated Encryption

M. Bellare, V. Hoang, 2022, IACR Cryptol. ePrint Arch..

Efficient probabilistically checkable proofs and applications to approximations

Carsten Lund, Mihir Bellare, Shafi Goldwasser, 1993, STOC.

Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier

Hugo Krawczyk, Mihir Bellare, Oded Goldreich, 1999, CRYPTO.

Ratcheted Encryption and Key Exchange: The Security of Messaging

Mihir Bellare, Igors Stepanovs, Joseph Jaeger, 2017, CRYPTO.

Hash Functions from Sigma Protocols and Improvements to VSH

Mihir Bellare, Todor Ristov, M. Bellare, 2008, ASIACRYPT.

The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme

Chanathip Namprempre, Mihir Bellare, David Pointcheval, 2002, Financial Cryptography.

Linearity testing in characteristic two

Mihir Bellare, Madhu Sudan, Johan Håstad, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Big-Key Symmetric Encryption: Resisting Key Exfiltration

Mihir Bellare, Phillip Rogaway, Daniel Kane, 2016, CRYPTO.

Security under Message-Derived Keys: Signcryption in iMessage

Mihir Bellare, Igors Stepanovs, M. Bellare, 2020, IACR Cryptol. ePrint Arch..

From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security

Chanathip Namprempre, Mihir Bellare, Jee Hea An, 2008, IEEE Transactions on Information Theory.

Improved non-approximability results

Mihir Bellare, Madhu Sudan, M. Bellare, 1994, STOC '94.

The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin

M. Bellare, P. Rogaway, 1996, EUROCRYPT.

Random oracles are practical: a paradigm for designing efficient protocols

M. Bellare, P. Rogaway, 1993, CCS '93.

The Security of Practical Two-Party RSA Signature Schemes

Mihir Bellare, Ravi S. Sandhu, M. Bellare, 2001, IACR Cryptol. ePrint Arch..

Eecient Probabilistically Checkable Proofs and Applications to Approximation

M. Bellare, S. Goldwasser, 1993 .

Rekeyed Digital Signature Schemes: Damage-containment in the face of key exposure

Mihir Bellare, Michel Abdalla, M. Bellare, 2001 .