How To Sign Given Any Trapdoor Function. - Mihir Bellare; Silvio Micali (CRYPTO, 1988)

How to Sign Given Any Trapdoor Function (Extended Abstract) - Mihir Bellare; Silvio Micali (STOC, 1988)

On the Structure of Secret Key Exchange Protocols. - Mihir Bellare; Lenore Cowen; Shafi Goldwasser (CRYPTO, 1989)

New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs. - Mihir Bellare; Shafi Goldwasser (CRYPTO, 1989)

Non-Interactive Oblivious Transfer and Applications. - Mihir Bellare; Silvio Micali (CRYPTO, 1989)

Perfect Zero-Knowledge in Constant Rounds - Mihir Bellare; Silvio Micali; Rafail Ostrovsky (STOC, 1990)

The (True) Complexity of Statistical Zero Knowledge - Mihir Bellare; Silvio Micali; Rafail Ostrovsky (STOC, 1990)

Languages that Are Easier than their Proofs - Richard Beigel; Mihir Bellare; Joan Feigenbaum; Shafi Goldwasser (FOCS, 1991)

A Technique for Upper Bounding the Spectral Norm with Applications to Learning. - Mihir Bellare (COLT, 1992)

On Defining Proofs of Knowledge. - Mihir Bellare; Oded Goldreich 001 (CRYPTO, 1992)

Certifying Cryptographic Tools: The Case of Trapdoor Permutations. - Mihir Bellare; Moti Yung (CRYPTO, 1992)

Making Zero-Knowledge Provers Efficient - Mihir Bellare; Erez Petrank (STOC, 1992)

How to Sign Given Any Trapdoor Permutation. - Mihir Bellare; Silvio Micali (J. ACM, 1992)

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. - Mihir Bellare; Phillip Rogaway (CCS, 1993)

Entity Authentication and Key Distribution. - Mihir Bellare; Phillip Rogaway (CRYPTO, 1993)

Interactive Proofs and Approximation: Reduction from Two Provers in One Round. - Mihir Bellare (ISTCS, 1993)

Efficient probabilistically checkable proofs and applications to approximations. - Mihir Bellare; Shafi Goldwasser; Carsten Lund; Alexander Russell (STOC, 1993)

Randomness in Interactive Proofs. - Mihir Bellare; Oded Goldreich 001; Shafi Goldwasser (Comput. Complex., 1993)

Incremental Cryptography: The Case of Hashing and Signing. - Mihir Bellare; Oded Goldreich 001; Shafi Goldwasser (CRYPTO, 1994)

The Security of Cipher Block Chaining. - Mihir Bellare; Joe Kilian; Phillip Rogaway (CRYPTO, 1994)

Optimal Asymmetric Encryption. - Mihir Bellare; Phillip Rogaway (EUROCRYPT, 1994)

Randomness-Efficient Oblivious Sampling - Mihir Bellare; John Rompel (FOCS, 1994)

Efficient probabilistic checkable proofs and applications to approximation. - Mihir Bellare; Shafi Goldwasser; Carsten Lund; Alexander Russell (STOC, 1994)

Improved non-approximability results. - Mihir Bellare; Madhu Sudan 001 (STOC, 1994)

The Complexity of Decision Versus Search. - Mihir Bellare; Shafi Goldwasser (SIAM J. Comput., 1994)

XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions. - Mihir Bellare; Roch Guérin; Phillip Rogaway (CRYPTO, 1995)

Free Bits, PCPs and Non-Approximability - Towards Tight Results. - Mihir Bellare; Oded Goldreich 001; Madhu Sudan 001 (FOCS, 1995)

On the Role of Shared Randomness in Two Prover Proof Systems. - Mihir Bellare; Uriel Feige; Joe Kilian (ISTCS, 1995)

Knowledge on the average-perfect, statistical and logarithmic. - William Aiello; Mihir Bellare; Ramarathnam Venkatesan (STOC, 1995)

Incremental cryptography and application to virus protection. - Mihir Bellare; Oded Goldreich 001; Shafi Goldwasser (STOC, 1995)

Provably secure session key distribution: the three party case. - Mihir Bellare; Phillip Rogaway (STOC, 1995)

iKP - A Family of Secure Electronic Payment Protocols. - Mihir Bellare; Amir Herzberg; Michael Steiner 001; Gene Tsudik; Michael Waidner; Ralf C. Hauser; Juan A. Garay (USENIX Workshop on Electronic Commerce, 1995)

Free Bits, PCP and Non-Approximability - Towards Tight Results - Mihir Bellare; Oded Goldreich 001; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 1995)

The complexity of approximating a nonlinear program. - Mihir Bellare; Phillip Rogaway (Math. Program., 1995)

Keying Hash Functions for Message Authentication. - Mihir Bellare; Ran Canetti; Hugo Krawczyk (CRYPTO, 1996)

The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin. - Mihir Bellare; Phillip Rogaway (EUROCRYPT, 1996)

Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security. - Mihir Bellare; Ran Canetti; Hugo Krawczyk (FOCS, 1996)

Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing. - Mihir Bellare; Juan A. Garay; Tal Rabin (PODC, 1996)

Verifiable Partial Key Escrow. - Mihir Bellare; Shafi Goldwasser (IACR Cryptol. ePrint Arch., 1996)

Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation. - Mihir Bellare; Moti Yung (J. Cryptol., 1996)

Linearity testing in characteristic two. - Mihir Bellare; Don Coppersmith; Johan Håstad; Marcos A. Kiwi; Madhu Sudan 001 (IEEE Trans. Inf. Theory, 1996)

"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case. - Mihir Bellare; Shafi Goldwasser; Daniele Micciancio (CRYPTO, 1997)

A Concrete Security Treatment of Symmetric Encryption. - Mihir Bellare; Anand Desai; E. Jokipii; Phillip Rogaway (FOCS, 1997)

Does Parallel Repetition Lower the Error in Computationally Sound Protocols? - Mihir Bellare; Russell Impagliazzo; Moni Naor (FOCS, 1997)

Minimizing the use of random oracles in authenticated encryption schemes. - Mihir Bellare; Phillip Rogaway (ICICS, 1997)

Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function. - Mihir Bellare; Markus Jakobsson; Moti Yung (IACR Cryptol. ePrint Arch., 1997)

A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost. - Mihir Bellare; Daniele Micciancio (IACR Cryptol. ePrint Arch., 1997)

Collision-Resistant Hashing: Towards Making UOWHFs Practical. - Mihir Bellare; Phillip Rogaway (IACR Cryptol. ePrint Arch., 1997)

HMAC: Keyed-Hashing for Message Authentication. - Hugo Krawczyk; Mihir Bellare; Ran Canetti (RFC, 1997)

Practice-Oriented Provable Security. - Mihir Bellare (Lectures on Data Security, 1998)

Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems. - Mihir Bellare; Shai Halevi; Amit Sahai; Salil P. Vadhan (CRYPTO, 1998)

Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible. - Mihir Bellare; Ted Krovetz; Phillip Rogaway (EUROCRYPT, 1998)

Batch Verification with Applications to Cryptography and Checking. - Mihir Bellare; Juan A. Garay; Tal Rabin (LATIN, 1998)

A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract). - Mihir Bellare; Ran Canetti; Hugo Krawczyk (STOC, 1998)

VarietyCash: A Multi-Purpose Electronic Payment System. - Mihir Bellare; Juan A. Garay; Charanjit S. Jutla; Moti Yung (USENIX Workshop on Electronic Commerce, 1998)

Uniform Generation of NP-witnesses using an NP-oracle. - Mihir Bellare; Oded Goldreich 001; Erez Petrank (Electron. Colloquium Comput. Complex., 1998)

Security amplification by composition: The case of doubly-iterated, ideal ciphers. - William Aiello; Mihir Bellare; Giovanni Di Crescenzo; Ramarathnam Venkatesan (IACR Cryptol. ePrint Arch., 1998)

A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols. - Mihir Bellare; Ran Canetti; Hugo Krawczyk (IACR Cryptol. ePrint Arch., 1998)

Relations among Notions of Security for Public-Key Encryption Schemes. - Mihir Bellare; Anand Desai; David Pointcheval; Phillip Rogaway (IACR Cryptol. ePrint Arch., 1998)

Fast Batch Verification for Modular Exponentiation and Digital Signatures. - Mihir Bellare; Juan A. Garay; Tal Rabin (IACR Cryptol. ePrint Arch., 1998)

Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems. - Mihir Bellare; Shai Halevi; Amit Sahai; Salil P. Vadhan (IACR Cryptol. ePrint Arch., 1998)

On Chromatic Sums and Distributed Resource Allocation. - Amotz Bar-Noy; Mihir Bellare; Magnús M. Halldórsson; Hadas Shachnai; Tami Tamir (Inf. Comput., 1998)

Free Bits, PCPs, and Nonapproximability-Towards Tight Results. - Mihir Bellare; Oded Goldreich 001; Madhu Sudan 001 (SIAM J. Comput., 1998)

Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions. - Jee Hea An; Mihir Bellare (CRYPTO, 1999)

Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier. - Mihir Bellare; Oded Goldreich 001; Hugo Krawczyk (CRYPTO, 1999)

On the Construction of Variable-Input-Length Ciphers. - Mihir Bellare; Phillip Rogaway (FSE, 1999)

DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem. - Michel Abdalla; Mihir Bellare; Phillip Rogaway (IACR Cryptol. ePrint Arch., 1999)

A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion. - Mihir Bellare; Russell Impagliazzo (IACR Cryptol. ePrint Arch., 1999)

A forward-secure digital signature scheme. - Mihir Bellare; Sara K. Miner (IACR Cryptol. ePrint Arch., 1999)

Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer. - Mihir Bellare; Ronald L. Rivest (J. Cryptol., 1999)

Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques. - Michel Abdalla; Mihir Bellare (ASIACRYPT, 2000)

Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography. - Mihir Bellare; Phillip Rogaway (ASIACRYPT, 2000)

Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. - Mihir Bellare; Alexandra Boldyreva; Silvio Micali (EUROCRYPT, 2000)

The Security of Chaffing and Winnowing. - Mihir Bellare; Alexandra Boldyreva (IACR Cryptol. ePrint Arch., 2000)

Identification Protocols Secure Against Reset Attacks. - Mihir Bellare; Marc Fischlin; Shafi Goldwasser; Silvio Micali (IACR Cryptol. ePrint Arch., 2000)

Authenticated Key Exchange Secure Against Dictionary Attacks. - Mihir Bellare; David Pointcheval; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2000)

The Security of the Cipher Block Chaining Message Authentication Code. - Mihir Bellare; Joe Kilian; Phillip Rogaway (J. Comput. Syst. Sci., 2000)

Design, implementation, and deployment of the iKP secure electronic payment system. - Mihir Bellare; Juan A. Garay; Ralf C. Hauser; Amir Herzberg; Hugo Krawczyk; Michael Steiner 001; Gene Tsudik; Els Van Herreweghen; Michael Waidner (IEEE J. Sel. Areas Commun., 2000)

Key-Privacy in Public-Key Encryption. - Mihir Bellare; Alexandra Boldyreva; Anand Desai; David Pointcheval (ASIACRYPT, 2001)

OCB: a block-cipher mode of operation for efficient authenticated encryption. - Phillip Rogaway; Mihir Bellare; John Black; Ted Krovetz (CCS, 2001)

Online Ciphers and the Hash-CBC Construction. - Mihir Bellare; Alexandra Boldyreva; Lars R. Knudsen; Chanathip Namprempre (CRYPTO, 2001)

The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES. - Michel Abdalla; Mihir Bellare; Phillip Rogaway (CT-RSA, 2001)

Does Encryption with Redundancy Provide Authenticity? - Jee Hea An; Mihir Bellare (EUROCRYPT, 2001)

The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme. - Mihir Bellare; Chanathip Namprempre; David Pointcheval; Michael Semanko (Financial Cryptography, 2001)

The Security of Practical Two-Party RSA Signature Schemes. - Mihir Bellare; Ravi S. Sandhu (IACR Cryptol. ePrint Arch., 2001)

Forward-Security in Private-Key Cryptography. - Mihir Bellare; Bennet S. Yee (IACR Cryptol. ePrint Arch., 2001)

OCB Mode. - Phillip Rogaway; Mihir Bellare; John Black; Ted Krovetz (IACR Cryptol. ePrint Arch., 2001)

Transitive Signatures Based on Factoring and RSA. - Mihir Bellare; Gregory Neven (ASIACRYPT, 2002)

Authenticated encryption in SSH: provably fixing the SSH binary packet protocol. - Mihir Bellare; Tadayoshi Kohno; Chanathip Namprempre (CCS, 2002)

GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. - Mihir Bellare; Adriana Palacio (CRYPTO, 2002)

From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. - Michel Abdalla; Jee Hea An; Mihir Bellare; Chanathip Namprempre (IACR Cryptol. ePrint Arch., 2002)

A Note on Negligible Functions. - Mihir Bellare (J. Cryptol., 2002)

A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications. - Mihir Bellare; Tadayoshi Kohno (EUROCRYPT, 2003)

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. - Mihir Bellare; Daniele Micciancio; Bogdan Warinschi (EUROCRYPT, 2003)

Randomness Re-use in Multi-recipient Encryption Schemeas. - Mihir Bellare; Alexandra Boldyreva; Jessica Staddon (Public Key Cryptography, 2003)

An Uninstantiable Random-Oracle-Model Scheme for a Hybrid Encryption Problem. - Mihir Bellare; Alexandra Boldyreva; Adriana Palacio (IACR Cryptol. ePrint Arch., 2003)

Hash Function Balance and its Impact on Birthday Attacks. - Mihir Bellare; Tadayoshi Kohno (IACR Cryptol. ePrint Arch., 2003)

EAX: A Conventional Authenticated-Encryption Mode. - Mihir Bellare; Phillip Rogaway; David A. Wagner 001 (IACR Cryptol. ePrint Arch., 2003)

The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. - Mihir Bellare; Chanathip Namprempre; David Pointcheval; Michael Semanko (J. Cryptol., 2003)

OCB: A block-cipher mode of operation for efficient authenticated encryption. - Phillip Rogaway; Mihir Bellare; John Black (ACM Trans. Inf. Syst. Secur., 2003)

The EAX Mode of Operation. - Mihir Bellare; Phillip Rogaway; David A. Wagner 001 (FSE, 2004)

The Power of Verification Queries in Message Authentication and Authenticated Encryption. - Mihir Bellare; Oded Goldreich 001; Anton Mityagin (IACR Cryptol. ePrint Arch., 2004)

The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. - Mihir Bellare; Adriana Palacio (IACR Cryptol. ePrint Arch., 2004)

Towards Plaintext-Aware Public-Key Encryption without Random Oracles. - Mihir Bellare; Adriana Palacio (IACR Cryptol. ePrint Arch., 2004)

Code-Based Game-Playing Proofs and the Security of Triple Encryption. - Mihir Bellare; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2004)

Foundations of Group Signatures: The Case of Dynamic Groups. - Mihir Bellare; Haixia Shi; Chong Zhang (IACR Cryptol. ePrint Arch., 2004)

Breaking and provably repairing the SSH authenticated encryption scheme: A case study of the Encode-then-Encrypt-and-MAC paradigm. - Mihir Bellare; Tadayoshi Kohno; Chanathip Namprempre (ACM Trans. Inf. Syst. Secur., 2004)

Improved Security Analyses for CBC MACs. - Mihir Bellare; Krzysztof Pietrzak; Phillip Rogaway (CRYPTO, 2005)

Transitive signatures: new schemes and proofs. - Mihir Bellare; Gregory Neven (IEEE Trans. Inf. Theory, 2005)

HOTP: An HMAC-Based One-Time Password Algorithm. - David M'Raïhi; Mihir Bellare; Frank Hoornaert; David Naccache; Ohad Ranen (RFC, 2005)

Multi-signatures in the plain public-Key model and a general forking lemma. - Mihir Bellare; Gregory Neven (CCS, 2006)

The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs. - Mihir Bellare; Phillip Rogaway (EUROCRYPT, 2006)

Protecting against key-exposure: strongly key-insulated encryption with optimal threshold. - Mihir Bellare; Adriana Palacio (Appl. Algebra Eng. Commun. Comput., 2006)

On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge. - Mihir Bellare; Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2006)

Deterministic and Efficiently Searchable Encryption. - Mihir Bellare; Alexandra Boldyreva; Adam O'Neill (IACR Cryptol. ePrint Arch., 2006)

Stateful Public-Key Cryptosystems: How to Encrypt with One 160-bit Exponentiation. - Mihir Bellare; Tadayoshi Kohno; Victor Shoup (IACR Cryptol. ePrint Arch., 2006)

Unrestricted Aggregate Signatures. - Mihir Bellare; Chanathip Namprempre; Gregory Neven (IACR Cryptol. ePrint Arch., 2006)

Multi-Property-Preserving Hash Domain Extension and the EMD Transform. - Mihir Bellare; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2006)

Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals. - Mihir Bellare; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2006)

Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-based Characterization. - Mihir Bellare; Amit Sahai (IACR Cryptol. ePrint Arch., 2006)

The Secure Shell (SSH) Transport Layer Encryption Modes. - Mihir Bellare; Tadayoshi Kohno; Chanathip Namprempre (RFC, 2006)

Identity-Based Multi-signatures from RSA. - Mihir Bellare; Gregory Neven (CT-RSA, 2007)

Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. - Mihir Bellare; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2007)

Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir without Random Oracles. - Mihir Bellare; Sarah Shoup (IACR Cryptol. ePrint Arch., 2007)

Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security. - Mihir Bellare; Alexandra Boldyreva; Kaoru Kurosawa; Jessica Staddon (IEEE Trans. Inf. Theory, 2007)

Hash Functions from Sigma Protocols and Improvements to VSH. - Mihir Bellare; Todor Ristov (ASIACRYPT, 2008)

Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. - Mihir Bellare; Marc Fischlin; Adam O'Neill; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2008)

Two-tier signatures from the Fiat-Shamir transform, with applications to strongly unforgeable and one-time signatures. - Mihir Bellare; Sarah Shoup (IET Inf. Secur., 2008)

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. - Michel Abdalla; Mihir Bellare; Dario Catalano; Eike Kiltz; Tadayoshi Kohno; Tanja Lange 001; John Malone-Lee; Gregory Neven; Pascal Paillier; Haixia Shi (J. Cryptol., 2008)

Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm. - Mihir Bellare; Chanathip Namprempre (J. Cryptol., 2008)

From Identification to Signatures Via the Fiat-Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security. - Michel Abdalla; Jee Hea An; Mihir Bellare; Chanathip Namprempre (IEEE Trans. Inf. Theory, 2008)

Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening. - Mihir Bellare; Dennis Hofheinz; Scott Yilek (EUROCRYPT, 2009)

Partial Signatures and their Applications. - Mihir Bellare; Shanshan Duan (IACR Cryptol. ePrint Arch., 2009)

Key Insulation and Intrusion Resilience Over a Public Channel. - Mihir Bellare; Shanshan Duan; Adriana Palacio (IACR Cryptol. ePrint Arch., 2009)

Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme. - Mihir Bellare; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2009)

Format-Preserving Encryption. - Mihir Bellare; Thomas Ristenpart; Phillip Rogaway; Till Stegers (IACR Cryptol. ePrint Arch., 2009)

Encryption Schemes Secure under Selective Opening Attack. - Mihir Bellare; Scott Yilek (IACR Cryptol. ePrint Arch., 2009)

Security Proofs for Identity-Based Identification and Signature Schemes. - Mihir Bellare; Chanathip Namprempre; Gregory Neven (J. Cryptol., 2009)

Cryptographic Agility and its Relation to Circular Encryption. - Tolga Acar; Mira Belenkiy; Mihir Bellare; David Cash (IACR Cryptol. ePrint Arch., 2010)

Pseudorandom Functions and Permutations Provably Secure Against Related-Key Attacks. - Mihir Bellare; David Cash (IACR Cryptol. ePrint Arch., 2010)

Identity-Based Encryption Secure against Selective Opening Attack. - Mihir Bellare; Brent Waters; Scott Yilek (IACR Cryptol. ePrint Arch., 2010)

Proving Computational Ability. - Mihir Bellare; Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge. - Mihir Bellare; Oded Goldreich 001 (Studies in Complexity and Cryptography, 2011)

Ciphers that Securely Encipher their own Keys. - Mihir Bellare; David Cash; Sriram Keelveedhi (IACR Cryptol. ePrint Arch., 2011)

Cryptography Secure Against Related-Key Attacks and Tampering. - Mihir Bellare; David Cash; Rachel Miller (IACR Cryptol. ePrint Arch., 2011)

Standard Security Does Not Imply Security Against Selective-Opening. - Mihir Bellare; Rafael Dowsley; Brent Waters; Scott Yilek (IACR Cryptol. ePrint Arch., 2011)

Authenticated and Misuse-Resistant Encryption of Key-Dependent Data. - Mihir Bellare; Sriram Keelveedhi (IACR Cryptol. ePrint Arch., 2011)

Identity-Based (Lossy) Trapdoor Functions and Applications. - Mihir Bellare; Eike Kiltz; Chris Peikert; Brent Waters (IACR Cryptol. ePrint Arch., 2011)

Foundations of garbled circuits. - Mihir Bellare; Viet Tung Hoang; Phillip Rogaway (CCS, 2012)

Semantic Security for the Wiretap Channel. - Mihir Bellare; Stefano Tessaro; Alexander Vardy (CRYPTO, 2012)

Hedged Public-key Encryption: How to Protect against Bad Randomness. - Mihir Bellare; Zvika Brakerski; Moni Naor; Thomas Ristenpart; Gil Segev 001; Hovav Shacham; Scott Yilek (IACR Cryptol. ePrint Arch., 2012)

Garbling Schemes. - Mihir Bellare; Viet Tung Hoang; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2012)

Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing. - Mihir Bellare; Viet Tung Hoang; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2012)

Message-Locked Encryption and Secure Deduplication. - Mihir Bellare; Sriram Keelveedhi; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2012)

Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition. - Mihir Bellare; Adam O'Neill (IACR Cryptol. ePrint Arch., 2012)

RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures. - Mihir Bellare; Kenneth G. Paterson; Susan Thomson 001 (IACR Cryptol. ePrint Arch., 2012)

Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity. - Mihir Bellare; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2012)

Multi-Instance Security and its Application to Password-Based Cryptography. - Mihir Bellare; Stefano Tessaro; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2012)

A Cryptographic Treatment of the Wiretap Channel. - Mihir Bellare; Stefano Tessaro; Alexander Vardy (IACR Cryptol. ePrint Arch., 2012)

On-line Ciphers and the Hash-CBC Constructions. - Mihir Bellare; Alexandra Boldyreva; Lars R. Knudsen; Chanathip Namprempre (J. Cryptol., 2012)

Policy-Based Signatures. - Mihir Bellare; Georg Fuchsbauer (IACR Cryptol. ePrint Arch., 2013)

Adaptive Witness Encryption and Asymmetric Password-based Cryptography. - Mihir Bellare; Viet Tung Hoang (IACR Cryptol. ePrint Arch., 2013)

Instantiating Random Oracles via UCEs. - Mihir Bellare; Viet Tung Hoang; Sriram Keelveedhi (IACR Cryptol. ePrint Arch., 2013)

Efficient Garbling from a Fixed-Key Blockcipher. - Mihir Bellare; Viet Tung Hoang; Sriram Keelveedhi; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2013)

DupLESS: Server-Aided Encryption for Deduplicated Storage. - Mihir Bellare; Sriram Keelveedhi; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2013)

Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig. - Mihir Bellare; Sarah Meiklejohn; Susan Thomson 001 (IACR Cryptol. ePrint Arch., 2013)

Poly-Many Hardcore Bits for Any One-Way Function. - Mihir Bellare; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2013)

Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation. - Mihir Bellare; Igors Stepanovs; Stefano Tessaro (ASIACRYPT (2), 2014)

How Secure is Deterministic Encryption? - Mihir Bellare; Rafael Dowsley; Sriram Keelveedhi (IACR Cryptol. ePrint Arch., 2014)

UCE+LTDFs: Efficient, Subversion-Resistant PKE in the Standard Model. - Mihir Bellare; Viet Tung Hoang (IACR Cryptol. ePrint Arch., 2014)

Cryptography from Compression Functions: The UCE Bridge to the ROM. - Mihir Bellare; Viet Tung Hoang; Sriram Keelveedhi (IACR Cryptol. ePrint Arch., 2014)

Security of Symmetric Encryption against Mass Surveillance. - Mihir Bellare; Kenneth G. Paterson; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2014)

A Characterization of Chameleon Hash Functions and New, Efficient Designs. - Mihir Bellare; Todor Ristov (J. Cryptol., 2014)

Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model. - Mihir Bellare; Viet Tung Hoang (EUROCRYPT (2), 2015)

Mass-surveillance without the State: Strongly Undetectable Algorithm-Substitution Attacks. - Mihir Bellare; Joseph Jaeger; Daniel Kane 001 (IACR Cryptol. ePrint Arch., 2015)

Interactive Message-Locked Encryption and Secure Deduplication. - Mihir Bellare; Sriram Keelveedhi (IACR Cryptol. ePrint Arch., 2015)

Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of an HMAC Assumption. - Mihir Bellare; Anna Lysyanskaya (IACR Cryptol. ePrint Arch., 2015)

Point-Function Obfuscation: A Framework and Generic Constructions. - Mihir Bellare; Igors Stepanovs (IACR Cryptol. ePrint Arch., 2015)

Double-Authentication-Preventing Signatures from Trapdoor Identification. - Mihir Bellare; Douglas Stebila (IACR Cryptol. ePrint Arch., 2015)

Contention in Cryptoland: Obfuscation, Leakage and UCE. - Mihir Bellare; Igors Stepanovs; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2015)

New Proofs for NMAC and HMAC: Security without Collision Resistance. - Mihir Bellare (J. Cryptol., 2015)

Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed? - Mihir Bellare; Dennis Hofheinz; Eike Kiltz (J. Cryptol., 2015)

From Identification to Signatures, Tightly: A Framework and Generic Transforms. - Mihir Bellare; Bertram Poettering; Douglas Stebila (ASIACRYPT (2), 2016)

Hash-Function based PRFs: AMAC and its Multi-User Security. - Mihir Bellare; Daniel J. Bernstein; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2016)

NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion. - Mihir Bellare; Georg Fuchsbauer; Alessandra Scafuro (IACR Cryptol. ePrint Arch., 2016)

Message-recovery attacks on Feistel-based Format Preserving Encryption. - Mihir Bellare; Viet Tung Hoang; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2016)

Big-Key Symmetric Encryption: Resisting Key Exfiltration. - Mihir Bellare; Daniel Kane 001; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2016)

Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures. - Mihir Bellare; Bertram Poettering; Douglas Stebila (IACR Cryptol. ePrint Arch., 2016)

Ratcheted Encryption and Key Exchange: The Security of Messaging. - Mihir Bellare; Asha Camper Singh; Joseph Jaeger; Maya Nyayapati; Igors Stepanovs (IACR Cryptol. ePrint Arch., 2016)

New Negative Results on Differing-Inputs Obfuscation. - Mihir Bellare; Igors Stepanovs; Brent Waters (IACR Cryptol. ePrint Arch., 2016)

Nonce-Based Cryptography: Retaining Security when Randomness Fails. - Mihir Bellare; Björn Tackmann (IACR Cryptol. ePrint Arch., 2016)

The Multi-User Security of Authenticated Encryption: AES-GCM in TLS 1.3. - Mihir Bellare; Björn Tackmann (IACR Cryptol. ePrint Arch., 2016)

Identity-Based Format-Preserving Encryption. - Mihir Bellare; Viet Tung Hoang (IACR Cryptol. ePrint Arch., 2017)

Forward-Security under Continual Leakage. - Mihir Bellare; Adam O'Neill; Igors Stepanovs (IACR Cryptol. ePrint Arch., 2017)

Public-Key Encryption Resistant to Parameter Subversion and its Realization from Efficiently-Embeddable Groups. - Benedikt Auerbach; Mihir Bellare; Eike Kiltz (IACR Cryptol. ePrint Arch., 2018)

The Fiat-Shamir Zoo: Relating the Security of Different Signature Variants. - Matilda Backendal; Mihir Bellare; Jessica Sorrell; Jiahao Sun (IACR Cryptol. ePrint Arch., 2018)

Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction. - Mihir Bellare; Wei Dai 011 (IACR Cryptol. ePrint Arch., 2018)

Better Than Advertised: Improved Collision-Resistance Guarantees for MD-Based Hash Functions. - Mihir Bellare; Joseph Jaeger; Julia Len (IACR Cryptol. ePrint Arch., 2018)

Robust Encryption. - Michel Abdalla; Mihir Bellare; Gregory Neven (J. Cryptol., 2018)

The Local Forking Lemma and its Application to Deterministic Encryption. - Mihir Bellare; Wei Dai 011; Lucy Li (IACR Cryptol. ePrint Arch., 2019)

Nonces are Noticed: AEAD Revisited. - Mihir Bellare; Ruth Ng; Björn Tackmann (IACR Cryptol. ePrint Arch., 2019)

The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures. - Mihir Bellare; Wei Dai 011 (INDOCRYPT, 2020)

Dual-Mode NIZKs: Possibility and Impossibility Results for Property Transfer. - Vivek Arte; Mihir Bellare (IACR Cryptol. ePrint Arch., 2020)

Incremental Cryptography Revisited: PRFs, Nonces and Modular Design. - Vivek Arte; Mihir Bellare; Louiza Khati (IACR Cryptol. ePrint Arch., 2020)

The Multi-Base Discrete Logarithm Problem: Concrete Security Improvements for Schnorr Identification, Signatures and Multi-Signatures. - Mihir Bellare; Wei Dai 011 (IACR Cryptol. ePrint Arch., 2020)

Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability. - Mihir Bellare; Hannah Davis; Felix Günther 001 (IACR Cryptol. ePrint Arch., 2020)

Security under Message-Derived Keys: Signcryption in iMessage. - Mihir Bellare; Igors Stepanovs (IACR Cryptol. ePrint Arch., 2020)

Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements. - Mihir Bellare; Wei Dai 011; Phillip Rogaway (Proc. Priv. Enhancing Technol., 2020)

Chain Reductions for Multi-signatures and the HBMS Scheme. - Mihir Bellare; Wei Dai 011 (ASIACRYPT (4), 2021)

Chain Reductions for Multi-Signatures. - Mihir Bellare; Wei Dai 011 (IACR Cryptol. ePrint Arch., 2021)

Better than Advertised Security for Non-interactive Threshold Signatures. - Mihir Bellare; Elizabeth C. Crites; Chelsea Komlo; Mary Maller; Stefano Tessaro; Chenzhi Zhu (CRYPTO (4), 2022)

Efficient Schemes for Committing Authenticated Encryption. - Mihir Bellare; Viet Tung Hoang (IACR Cryptol. ePrint Arch., 2022)

Stronger Security for Non-Interactive Threshold Signatures: BLS and FROST. - Mihir Bellare; Stefano Tessaro; Chenzhi Zhu (IACR Cryptol. ePrint Arch., 2022)

When Messages are Keys: Is HMAC a dual-PRF? - Matilda Backendal; Mihir Bellare; Felix Günther 001; Matteo Scarlata (IACR Cryptol. ePrint Arch., 2023)

Hardening Signature Schemes via Derive-then-Derandomize: Stronger Security Proofs for EdDSA. - Mihir Bellare; Hannah Davis; Zijing Di (IACR Cryptol. ePrint Arch., 2023)

Flexible Password-Based Encryption: Securing Cloud Storage and Provably Resisting Partitioning-Oracle Attacks. - Mihir Bellare; Laura Shea (IACR Cryptol. ePrint Arch., 2023)

Succinctly-Committing Authenticated Encryption. - Mihir Bellare; Viet Tung Hoang (IACR Cryptol. ePrint Arch., 2024)

The Concrete Security of Two-Party Computation: Simple Definitions, and Tight Proofs for PSI and OPRFs. - Mihir Bellare; Rishabh Ranjan; Doreen Riepel; Ali Aldakheel (IACR Cryptol. ePrint Arch., 2024)

Highly-Effective Backdoors for Hash Functions and Beyond. - Mihir Bellare; Doreen Riepel; Laura Shea (IACR Cryptol. ePrint Arch., 2024)

Count Corruptions, Not Users: Improved Tightness for Signatures, Encryption and Authenticated Key Exchange. - Mihir Bellare; Doreen Riepel; Stefano Tessaro; Yizhao Zhang (IACR Cryptol. ePrint Arch., 2024)

Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption. - Mihir Bellare; Anna Lysyanskaya (J. Cryptol., 2024)

Public-Algorithm Substitution Attacks: Subverting Hashing and Verification. - Mihir Bellare; Doreen Riepel; Laura Shea (PKC (4), 2025)

Intermundium-DL: Assessing the Resilience of Current Schemes to Discrete-Log-Computation Attacks on Public Parameters. - Mihir Bellare; Doreen Riepel; Laura Shea (IACR Cryptol. ePrint Arch., 2025)

Prεεmpt: Sanitizing Sensitive Prompts for LLMs. - Amrita Roy Chowdhury 001; David Glukhov; Divyam Anshumaan; Prasad Chalasani; Nicolas Papernot; Somesh Jha; Mihir Bellare (CoRR, 2025)