| 2012 | ||
|---|---|---|
| j25 | Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre: On-line Ciphers and the Hash-CBC Constructions. J. Cryptology 25(4): 640-679 (2012) | |
| c118 | Mihir Bellare, Viet Tung Hoang, Phillip Rogaway: Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing. ASIACRYPT 2012: 134-153 | |
| c117 | Mihir Bellare, Kenneth G. Paterson, Susan Thomson: RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures. ASIACRYPT 2012: 331-348 | |
| c116 | Mihir Bellare, Viet Tung Hoang, Phillip Rogaway: Foundations of garbled circuits. ACM Conference on Computer and Communications Security 2012: 784-796 | |
| c115 | Mihir Bellare, Stefano Tessaro, Alexander Vardy: Semantic Security for the Wiretap Channel. CRYPTO 2012: 294-311 | |
| c114 | Mihir Bellare, Thomas Ristenpart, Stefano Tessaro: Multi-instance Security and Its Application to Password-Based Cryptography. CRYPTO 2012: 312-329 | |
| c113 | Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters: Identity-Based (Lossy) Trapdoor Functions and Applications. EUROCRYPT 2012: 228-245 | |
| c112 | Mihir Bellare, Rafael Dowsley, Brent Waters, Scott Yilek: Standard Security Does Not Imply Security against Selective-Opening. EUROCRYPT 2012: 645-662 | |
| i65 | Mihir Bellare, Stefano Tessaro, Alexander Vardy: A Cryptographic Treatment of the Wiretap Channel. CoRR abs/1201.2205 (2012) | |
| i64 | Mihir Bellare, Stefano Tessaro: Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity. CoRR abs/1201.3160 (2012) | |
| i63 | Mihir Bellare, Stefano Tessaro, Alexander Vardy: A Cryptographic Treatment of the Wiretap Channel. IACR Cryptology ePrint Archive 2012: 15 (2012) | |
| i62 | Mihir Bellare, Stefano Tessaro: Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity. IACR Cryptology ePrint Archive 2012: 22 (2012) | |
| i61 | Mihir Bellare, Stefano Tessaro, Thomas Ristenpart: Multi-Instance Security and its Application to Password-Based Cryptography. IACR Cryptology ePrint Archive 2012: 196 (2012) | |
| i60 | Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek: Hedged Public-key Encryption: How to Protect against Bad Randomness. IACR Cryptology ePrint Archive 2012: 220 (2012) | |
| i59 | Mihir Bellare, Viet Tung Hoang, Phillip Rogaway: Garbling Schemes. IACR Cryptology ePrint Archive 2012: 265 (2012) | |
| i58 | Mihir Bellare, Kenneth G. Paterson, Susan Thomson: RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures. IACR Cryptology ePrint Archive 2012: 514 (2012) | |
| i57 | Mihir Bellare, Adam O'Neill: Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition. IACR Cryptology ePrint Archive 2012: 515 (2012) | |
| i56 | Mihir Bellare, Viet Tung Hoang, Phillip Rogaway: Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing. IACR Cryptology ePrint Archive 2012: 564 (2012) | |
| i55 | Mihir Bellare, Sriram Keelveedhi, Thomas Ristenpart: Message-Locked Encryption and Secure Deduplication. IACR Cryptology ePrint Archive 2012: 631 (2012) | |
| 2011 | ||
| p2 | Mihir Bellare, Oded Goldreich: Proving Computational Ability. Studies in Complexity and Cryptography 2011: 6-12 | |
| p1 | Mihir Bellare, Oded Goldreich: On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge. Studies in Complexity and Cryptography 2011: 114-123 | |
| c111 | Mihir Bellare, David Cash, Rachel Miller: Cryptography Secure against Related-Key Attacks and Tampering. ASIACRYPT 2011: 486-503 | |
| c110 | Mihir Bellare, David Cash, Sriram Keelveedhi: Ciphers that securely encipher their own keys. ACM Conference on Computer and Communications Security 2011: 423-432 | |
| c109 | Mihir Bellare, Sriram Keelveedhi: Authenticated and Misuse-Resistant Encryption of Key-Dependent Data. CRYPTO 2011: 610-629 | |
| c108 | Mihir Bellare, Brent Waters, Scott Yilek: Identity-Based Encryption Secure against Selective Opening Attack. TCC 2011: 235-252 | |
| i54 | Mihir Bellare, David Cash, Rachel Miller: Cryptography Secure Against Related-Key Attacks and Tampering. IACR Cryptology ePrint Archive 2011: 252 (2011) | |
| i53 | Mihir Bellare, Sriram Keelveedhi: Authenticated and Misuse-Resistant Encryption of Key-Dependent Data. IACR Cryptology ePrint Archive 2011: 269 (2011) | |
| i52 | Mihir Bellare, David Cash, Sriram Keelveedhi: Ciphers that Securely Encipher their own Keys. IACR Cryptology ePrint Archive 2011: 432 (2011) | |
| i51 | Mihir Bellare, Eike Kiltz, Chris Peikert, Brent Waters: Identity-Based (Lossy) Trapdoor Functions and Applications. IACR Cryptology ePrint Archive 2011: 479 (2011) | |
| i50 | Mihir Bellare, Rafael Dowsley, Brent Waters, Scott Yilek: Standard Security Does Not Imply Security Against Selective-Opening. IACR Cryptology ePrint Archive 2011: 581 (2011) | |
| 2010 | ||
| c107 | Mihir Bellare, David Cash: Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks. CRYPTO 2010: 666-684 | |
| c106 | Tolga Acar, Mira Belenkiy, Mihir Bellare, David Cash: Cryptographic Agility and Its Relation to Circular Encryption. EUROCRYPT 2010: 403-422 | |
| c105 | ||
| i49 | Tolga Acar, Mira Belenkiy, Mihir Bellare, David Cash: Cryptographic Agility and its Relation to Circular Encryption. IACR Cryptology ePrint Archive 2010: 117 (2010) | |
| i48 | Mihir Bellare, Brent Waters, Scott Yilek: Identity-Based Encryption Secure against Selective Opening Attack. IACR Cryptology ePrint Archive 2010: 159 (2010) | |
| i47 | Mihir Bellare, David Cash: Pseudorandom Functions and Permutations Provably Secure Against Related-Key Attacks. IACR Cryptology ePrint Archive 2010: 397 (2010) | |
| 2009 | ||
| j24 | Mihir Bellare, Chanathip Namprempre, Gregory Neven: Security Proofs for Identity-Based Identification and Signature Schemes. J. Cryptology 22(1): 1-61 (2009) | |
| c104 | Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek: Hedged Public-Key Encryption: How to Protect against Bad Randomness. ASIACRYPT 2009: 232-249 | |
| c103 | Mihir Bellare, Shanshan Duan, Adriana Palacio: Key Insulation and Intrusion Resilience over a Public Channel. CT-RSA 2009: 84-99 | |
| c102 | Mihir Bellare, Dennis Hofheinz, Scott Yilek: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening. EUROCRYPT 2009: 1-35 | |
| c101 | Mihir Bellare, Thomas Ristenpart: Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme. EUROCRYPT 2009: 407-424 | |
| c100 | Mihir Bellare, Thomas Ristenpart, Phillip Rogaway, Till Stegers: Format-Preserving Encryption. Selected Areas in Cryptography 2009: 295-312 | |
| i46 | Mihir Bellare, Shanshan Duan, Adriana Palacio: Key Insulation and Intrusion Resilience Over a Public Channel. IACR Cryptology ePrint Archive 2009: 39 (2009) | |
| i45 | Mihir Bellare, Thomas Ristenpart: Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme. IACR Cryptology ePrint Archive 2009: 84 (2009) | |
| i44 | Mihir Bellare, Scott Yilek: Encryption Schemes Secure under Selective Opening Attack. IACR Cryptology ePrint Archive 2009: 101 (2009) | |
| i43 | Mihir Bellare, Thomas Ristenpart, Phillip Rogaway, Till Stegers: Format-Preserving Encryption. IACR Cryptology ePrint Archive 2009: 251 (2009) | |
| i42 | Mihir Bellare, Shanshan Duan: Partial Signatures and their Applications. IACR Cryptology ePrint Archive 2009: 336 (2009) | |
| i41 | Mihir Bellare, Dennis Hofheinz, Eike Kiltz: Subtleties in the Definition of IND-CCA: When and How Should Challenge-Decryption be Disallowed? IACR Cryptology ePrint Archive 2009: 418 (2009) | |
| 2008 | ||
| j23 | Mihir Bellare, Sarah Shoup: Two-tier signatures from the Fiat-Shamir transform, with applications to strongly unforgeable and one-time signatures. IET Information Security 2(2): 47-63 (2008) | |
| j22 | Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi: Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. J. Cryptology 21(3): 350-391 (2008) | |
| j21 | Mihir Bellare, Chanathip Namprempre: Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm. J. Cryptology 21(4): 469-491 (2008) | |
| j20 | Michel Abdalla, Jee Hea An, Mihir Bellare, Chanathip Namprempre: From Identification to Signatures Via the Fiat-Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security. IEEE Transactions on Information Theory 54(8): 3631-3646 (2008) | |
| c99 | Mihir Bellare, Todor Ristov: Hash Functions from Sigma Protocols and Improvements to VSH. ASIACRYPT 2008: 125-142 | |
| c98 | Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. CRYPTO 2008: 360-378 | |
| i40 | Mihir Bellare, Marc Fischlin, Adam O'Neill, Thomas Ristenpart: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. IACR Cryptology ePrint Archive 2008: 267 (2008) | |
| i39 | Mihir Bellare, Todor Ristov: A Characterization of Chameleon Hash Functions and New, Efficient Designs. IACR Cryptology ePrint Archive 2008: 379 (2008) | |
| i38 | Michel Abdalla, Mihir Bellare, Gregory Neven: Robust Encryption. IACR Cryptology ePrint Archive 2008: 440 (2008) | |
| 2007 | ||
| j19 | Mihir Bellare, Alexandra Boldyreva, K. Kurosawa, Jessica Staddon: Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security. IEEE Transactions on Information Theory 53(11): 3927-3943 (2007) | |
| c97 | Phillip Rogaway, Mihir Bellare: Robust computational secret sharing and a unified account of classical secret-sharing goals. ACM Conference on Computer and Communications Security 2007: 172-184 | |
| c96 | Mihir Bellare, Alexandra Boldyreva, Adam O'Neill: Deterministic and Efficiently Searchable Encryption. CRYPTO 2007: 535-552 | |
| c95 | ||
| c94 | Mihir Bellare, Thomas Ristenpart: Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. ICALP 2007: 399-410 | |
| c93 | Mihir Bellare, Chanathip Namprempre, Gregory Neven: Unrestricted Aggregate Signatures. ICALP 2007: 411-422 | |
| c92 | Mihir Bellare, Sarah Shoup: Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles. Public Key Cryptography 2007: 201-216 | |
| i37 | Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre: On-Line Ciphers and the Hash-CBC Constructions. IACR Cryptology ePrint Archive 2007: 197 (2007) | |
| i36 | Mihir Bellare, Thomas Ristenpart: Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms. IACR Cryptology ePrint Archive 2007: 271 (2007) | |
| i35 | Mihir Bellare, Sarah Shoup: Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir without Random Oracles. IACR Cryptology ePrint Archive 2007: 273 (2007) | |
| 2006 | ||
| j18 | Mihir Bellare, Adriana Palacio: Protecting against key-exposure: strongly key-insulated encryption with optimal threshold. Appl. Algebra Eng. Commun. Comput. 16(6): 379-396 (2006) | |
| c91 | Mihir Bellare, Thomas Ristenpart: Multi-Property-Preserving Hash Domain Extension and the EMD Transform. ASIACRYPT 2006: 299-314 | |
| c90 | Mihir Bellare, Tadayoshi Kohno, Victor Shoup: Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation. ACM Conference on Computer and Communications Security 2006: 380-389 | |
| c89 | Mihir Bellare, Gregory Neven: Multi-signatures in the plain public-Key model and a general forking lemma. ACM Conference on Computer and Communications Security 2006: 390-399 | |
| c88 | ||
| c87 | Mihir Bellare, Phillip Rogaway: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs. EUROCRYPT 2006: 409-426 | |
| i34 | Mihir Bellare, Oded Goldreich: On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge. Electronic Colloquium on Computational Complexity (ECCC) 13(136) (2006) | |
| i33 | Mihir Bellare: New Proofs for NMAC and HMAC: Security Without Collision-Resistance. IACR Cryptology ePrint Archive 2006: 43 (2006) | |
| i32 | Mihir Bellare, Alexandra Boldyreva, Adam O'Neill: Deterministic and Efficiently Searchable Encryption. IACR Cryptology ePrint Archive 2006: 186 (2006) | |
| i31 | Mihir Bellare, Amit Sahai: Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-based Characterization. IACR Cryptology ePrint Archive 2006: 228 (2006) | |
| i30 | Mihir Bellare, Tadayoshi Kohno, Victor Shoup: Stateful Public-Key Cryptosystems: How to Encrypt with One 160-bit Exponentiation. IACR Cryptology ePrint Archive 2006: 267 (2006) | |
| i29 | Mihir Bellare, Chanathip Namprempre, Gregory Neven: Unrestricted Aggregate Signatures. IACR Cryptology ePrint Archive 2006: 285 (2006) | |
| i28 | Mihir Bellare, Oded Goldreich: On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge. IACR Cryptology ePrint Archive 2006: 359 (2006) | |
| i27 | Mihir Bellare, Thomas Ristenpart: Multi-Property-Preserving Hash Domain Extension and the EMD Transform. IACR Cryptology ePrint Archive 2006: 399 (2006) | |
| i26 | Mihir Bellare, Phillip Rogaway: Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals. IACR Cryptology ePrint Archive 2006: 449 (2006) | |
| 2005 | ||
| j17 | Mihir Bellare, Gregory Neven: Transitive signatures: new schemes and proofs. IEEE Transactions on Information Theory 51(6): 2133-2151 (2005) | |
| c86 | Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi: Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. CRYPTO 2005: 205-222 | |
| c85 | Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway: Improved Security Analyses for CBC MACs. CRYPTO 2005: 527-545 | |
| c84 | Mihir Bellare, Haixia Shi, Chong Zhang: Foundations of Group Signatures: The Case of Dynamic Groups. CT-RSA 2005: 136-153 | |
| i25 | Michel Abdalla, Mihir Bellare, Dario Catalano, Eike Kiltz, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi: Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. IACR Cryptology ePrint Archive 2005: 254 (2005) | |
| 2004 | ||
| j16 | Mihir Bellare, Tadayoshi Kohno, Chanathip Namprempre: Breaking and provably repairing the SSH authenticated encryption scheme: A case study of the Encode-then-Encrypt-and-MAC paradigm. ACM Trans. Inf. Syst. Secur. 7(2): 206-241 (2004) | |
| c83 | Mihir Bellare, Adriana Palacio: Towards Plaintext-Aware Public-Key Encryption Without Random Oracles. ASIACRYPT 2004: 48-62 | |
| c82 | Mihir Bellare, Adriana Palacio: The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. CRYPTO 2004: 273-289 | |
| c81 | Mihir Bellare, Alexandra Boldyreva, Adriana Palacio: An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem. EUROCRYPT 2004: 171-188 | |
| c80 | Mihir Bellare, Chanathip Namprempre, Gregory Neven: Security Proofs for Identity-Based Identification and Signature Schemes. EUROCRYPT 2004: 268-286 | |
| c79 | Mihir Bellare, Tadayoshi Kohno: Hash Function Balance and Its Impact on Birthday Attacks. EUROCRYPT 2004: 401-418 | |
| c78 | ||
| i24 | Mihir Bellare, Adriana Palacio: The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. IACR Cryptology ePrint Archive 2004: 8 (2004) | |
| i23 | Mihir Bellare, Haixia Shi, Chong Zhang: Foundations of Group Signatures: The Case of Dynamic Groups. IACR Cryptology ePrint Archive 2004: 77 (2004) | |
| i22 | Mihir Bellare, Gregory Neven: Transitive Signatures: New Schemes and Proofs. IACR Cryptology ePrint Archive 2004: 215 (2004) | |
| i21 | Mihir Bellare, Adriana Palacio: Towards Plaintext-Aware Public-Key Encryption without Random Oracles. IACR Cryptology ePrint Archive 2004: 221 (2004) | |
| i20 | Mihir Bellare, Chanathip Namprempre, Gregory Neven: Security Proofs for Identity-Based Identification and Signature Schemes. IACR Cryptology ePrint Archive 2004: 252 (2004) | |
| i19 | Mihir Bellare, Oded Goldreich, Anton Mityagin: The Power of Verification Queries in Message Authentication and Authenticated Encryption. IACR Cryptology ePrint Archive 2004: 309 (2004) | |
| i18 | Mihir Bellare, Phillip Rogaway: Code-Based Game-Playing Proofs and the Security of Triple Encryption. IACR Cryptology ePrint Archive 2004: 331 (2004) | |
| 2003 | ||
| j15 | Mihir Bellare, Chanathip Namprempre, David Pointcheval, Michael Semanko: The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. J. Cryptology 16(3): 185-215 (2003) | |
| j14 | Phillip Rogaway, Mihir Bellare, John Black: OCB: A block-cipher mode of operation for efficient authenticated encryption. ACM Trans. Inf. Syst. Secur. 6(3): 365-403 (2003) | |
| c77 | ||
| c76 | Mihir Bellare, Tadayoshi Kohno: A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications. EUROCRYPT 2003: 491-506 | |
| c75 | Mihir Bellare, Daniele Micciancio, Bogdan Warinschi: Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. EUROCRYPT 2003: 614-629 | |
| c74 | Mihir Bellare, Alexandra Boldyreva, Jessica Staddon: Randomness Re-use in Multi-recipient Encryption Schemeas. Public Key Cryptography 2003: 85-99 | |
| i17 | Mihir Bellare, Tadayoshi Kohno: Hash Function Balance and its Impact on Birthday Attacks. IACR Cryptology ePrint Archive 2003: 65 (2003) | |
| i16 | Mihir Bellare, Phillip Rogaway, D. Wagner: EAX: A Conventional Authenticated-Encryption Mode. IACR Cryptology ePrint Archive 2003: 69 (2003) | |
| i15 | Mihir Bellare, Alexandra Boldyreva, Adriana Palacio: An Uninstantiable Random-Oracle-Model Scheme for a Hybrid Encryption Problem. IACR Cryptology ePrint Archive 2003: 77 (2003) | |
| 2002 | ||
| j13 | ||
| c73 | Mihir Bellare, Gregory Neven: Transitive Signatures Based on Factoring and RSA. ASIACRYPT 2002: 397-414 | |
| c72 | Mihir Bellare, Tadayoshi Kohno, Chanathip Namprempre: Authenticated encryption in SSH: provably fixing the SSH binary packet protocol. ACM Conference on Computer and Communications Security 2002: 1-11 | |
| c71 | Mihir Bellare, Adriana Palacio: GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks. CRYPTO 2002: 162-177 | |
| c70 | Michel Abdalla, Jee Hea An, Mihir Bellare, Chanathip Namprempre: From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. EUROCRYPT 2002: 418-433 | |
| i14 | Michel Abdalla, Jee Hea An, Mihir Bellare, Chanathip Namprempre: From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. IACR Cryptology ePrint Archive 2002: 22 (2002) | |
| i13 | Mihir Bellare, Adriana Palacio: Protecting against Key Exposure: Strongly Key-Insulated Encryption with Optimal Threshold. IACR Cryptology ePrint Archive 2002: 64 (2002) | |
| i12 | Mihir Bellare, Tadayoshi Kohno, Chanathip Namprempre: Breaking and Provably Repairing the SSH Authenticated Encryption Scheme: A Case Study of the Encode-then-Encrypt-and-MAC Paradigm. IACR Cryptology ePrint Archive 2002: 78 (2002) | |
| 2001 | ||
| c69 | Mihir Bellare, Alexandra Boldyreva, Anand Desai, David Pointcheval: Key-Privacy in Public-Key Encryption. ASIACRYPT 2001: 566-582 | |
| c68 | Phillip Rogaway, Mihir Bellare, John Black, Ted Krovetz: OCB: a block-cipher mode of operation for efficient authenticated encryption. ACM Conference on Computer and Communications Security 2001: 196-205 | |
| c67 | Mihir Bellare, Alexandra Boldyreva, Lars R. Knudsen, Chanathip Namprempre: Online Ciphers and the Hash-CBC Construction. CRYPTO 2001: 292-309 | |
| c66 | Michel Abdalla, Mihir Bellare, Phillip Rogaway: The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES. CT-RSA 2001: 143-158 | |
| c65 | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure against Reset Attacks. EUROCRYPT 2001: 495-511 | |
| c64 | Jee Hea An, Mihir Bellare: Does Encryption with Redundancy Provide Authenticity? EUROCRYPT 2001: 512-528 | |
| c63 | Mihir Bellare, Chanathip Namprempre, David Pointcheval, Michael Semanko: The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme. Financial Cryptography 2001: 309-328 | |
| i11 | Mihir Bellare, Chanathip Namprempre, David Pointcheval, Michael Semanko: The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme. IACR Cryptology ePrint Archive 2001: 2 (2001) | |
| i10 | Phillip Rogaway, Mihir Bellare, John Black, Ted Krovetz: OCB Mode. IACR Cryptology ePrint Archive 2001: 26 (2001) | |
| i9 | Mihir Bellare, Bennet S. Yee: Forward-Security in Private-Key Cryptography. IACR Cryptology ePrint Archive 2001: 35 (2001) | |
| i8 | Mihir Bellare, Ravi S. Sandhu: The Security of Practical Two-Party RSA Signature Schemes. IACR Cryptology ePrint Archive 2001: 60 (2001) | |
| 2000 | ||
| j12 | Mihir Bellare, Oded Goldreich, Erez Petrank: Uniform Generation of NP-Witnesses Using an NP-Oracle. Inf. Comput. 163(2): 510-526 (2000) | |
| j11 | Mihir Bellare, Joe Kilian, Phillip Rogaway: The Security of the Cipher Block Chaining Message Authentication Code. J. Comput. Syst. Sci. 61(3): 362-399 (2000) | |
| j10 | Mihir Bellare, Juan A. Garay, Ralf C. Hauser, Amir Herzberg, Hugo Krawczyk, Michael Steiner, Gene Tsudik, Els Van Herreweghen, Michael Waidner: Design, implementation, and deployment of the iKP secure electronic payment system. IEEE Journal on Selected Areas in Communications 18(4): 611-627 (2000) | |
| c62 | Mihir Bellare, Phillip Rogaway: Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography. ASIACRYPT 2000: 317-330 | |
| c61 | ||
| c60 | Mihir Bellare, Chanathip Namprempre: Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm. ASIACRYPT 2000: 531-545 | |
| c59 | Michel Abdalla, Mihir Bellare: Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques. ASIACRYPT 2000: 546-559 | |
| c58 | Mihir Bellare, David Pointcheval, Phillip Rogaway: Authenticated Key Exchange Secure against Dictionary Attacks. EUROCRYPT 2000: 139-155 | |
| c57 | Mihir Bellare, Alexandra Boldyreva, Silvio Micali: Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements. EUROCRYPT 2000: 259-274 | |
| e1 | Mihir Bellare (Ed.): Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000, Proceedings. Lecture Notes in Computer Science 1880, Springer 2000, isbn 3-540-67907-3 | |
| i7 | Mihir Bellare, Alexandra Boldyreva: The Security of Chaffing and Winnowing. IACR Cryptology ePrint Archive 2000: 10 (2000) | |
| i6 | Mihir Bellare, David Pointcheval, Phillip Rogaway: Authenticated Key Exchange Secure Against Dictionary Attacks. IACR Cryptology ePrint Archive 2000: 14 (2000) | |
| i5 | Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali: Identification Protocols Secure Against Reset Attacks. IACR Cryptology ePrint Archive 2000: 15 (2000) | |
| i4 | Mihir Bellare, Chanathip Namprempre: Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm. IACR Cryptology ePrint Archive 2000: 25 (2000) | |
| 1999 | ||
| j9 | Mihir Bellare, Ronald L. Rivest: Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer. J. Cryptology 12(2): 117-139 (1999) | |
| c56 | Jee Hea An, Mihir Bellare: Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions. CRYPTO 1999: 252-269 | |
| c55 | Mihir Bellare, Oded Goldreich, Hugo Krawczyk: Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier. CRYPTO 1999: 270-287 | |
| c54 | ||
| c53 | Mihir Bellare, Amit Sahai: Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization. CRYPTO 1999: 519-536 | |
| c52 | Mihir Bellare, Phillip Rogaway: On the Construction of Variable-Input-Length Ciphers. FSE 1999: 231-244 | |
| 1998 | ||
| j8 | Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir: On Chromatic Sums and Distributed Resource Allocation. Inf. Comput. 140(2): 183-202 (1998) | |
| j7 | Mihir Bellare, Oded Goldreich, Madhu Sudan: Free Bits, PCPs, and Nonapproximability-Towards Tight Results. SIAM J. Comput. 27(3): 804-915 (1998) | |
| c51 | ||
| c50 | Mihir Bellare, Anand Desai, David Pointcheval, Phillip Rogaway: Relations Among Notions of Security for Public-Key Encryption Schemes. CRYPTO 1998: 26-45 | |
| c49 | Mihir Bellare, Shai Halevi, Amit Sahai, Salil P. Vadhan: Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems. CRYPTO 1998: 283-298 | |
| c48 | William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan: Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers. CRYPTO 1998: 390-407 | |
| c47 | Mihir Bellare, Juan A. Garay, Tal Rabin: Fast Batch Verification for Modular Exponentiation and Digital Signatures. EUROCRYPT 1998: 236-250 | |
| c46 | Mihir Bellare, Ted Krovetz, Phillip Rogaway: Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible. EUROCRYPT 1998: 266-280 | |
| c45 | Mihir Bellare, Juan A. Garay, Tal Rabin: Batch Verification with Applications to Cryptography and Checking. LATIN 1998: 170-191 | |
| c44 | Mihir Bellare, Ran Canetti, Hugo Krawczyk: A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract). STOC 1998: 419-428 | |
| i3 | William Aiello, Mihir Bellare, Giovanni Di Crescenzo, Ramarathnam Venkatesan: Security amplification by composition: The case of doubly-iterated ideal ciphers. CoRR cs.CR/9809031 (1998) | |
| i2 | Mihir Bellare, Oded Goldreich, Erez Petrank: Uniform Generation of NP-witnesses using an NP-oracle. Electronic Colloquium on Computational Complexity (ECCC) 5(32) (1998) | |
| 1997 | ||
| c43 | Mihir Bellare, Shafi Goldwasser: Verifiable Partial Key Escrow. ACM Conference on Computer and Communications Security 1997: 78-91 | |
| c42 | Mihir Bellare, Shafi Goldwasser, Daniele Micciancio: "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case. CRYPTO 1997: 277-291 | |
| c41 | Mihir Bellare, Phillip Rogaway: Collision-Resistant Hashing: Towards Making UOWHFs Practical. CRYPTO 1997: 470-484 | |
| c40 | Mihir Bellare, Daniele Micciancio: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. EUROCRYPT 1997: 163-192 | |
| c39 | Mihir Bellare, Markus Jakobsson, Moti Yung: Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function. EUROCRYPT 1997: 280-305 | |
| c38 | Mihir Bellare, Russell Impagliazzo, Moni Naor: Does Parallel Repetition Lower the Error in Computationally Sound Protocols? FOCS 1997: 374-383 | |
| c37 | Mihir Bellare, Anand Desai, E. Jokipii, Phillip Rogaway: A Concrete Security Treatment of Symmetric Encryption. FOCS 1997: 394-403 | |
| c36 | Mihir Bellare, Phillip Rogaway: Minimizing the use of random oracles in authenticated encryption schemes. ICICS 1997: 1-16 | |
| c35 | ||
| 1996 | ||
| j6 | Mihir Bellare, Moti Yung: Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation. J. Cryptology 9(3): 149-166 (1996) | |
| j5 | Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan: Linearity testing in characteristic two. IEEE Transactions on Information Theory 42(6): 1781-1795 (1996) | |
| c34 | Mihir Bellare, Ran Canetti, Hugo Krawczyk: Keying Hash Functions for Message Authentication. CRYPTO 1996: 1-15 | |
| c33 | Mihir Bellare, Phillip Rogaway: The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin. EUROCRYPT 1996: 399-416 | |
| c32 | Mihir Bellare, Ran Canetti, Hugo Krawczyk: Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security. FOCS 1996: 514-523 | |
| c31 | Mihir Bellare, Juan A. Garay, Tal Rabin: Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing. PODC 1996: 191-200 | |
| 1995 | ||
| j4 | Mihir Bellare, Phillip Rogaway: The complexity of approximating a nonlinear program. Math. Program. 69: 429-441 (1995) | |
| c30 | Mihir Bellare, Roch Guérin, Phillip Rogaway: XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions. CRYPTO 1995: 15-28 | |
| c29 | Mihir Bellare, Oded Goldreich, Madhu Sudan: Free Bits, PCPs and Non-Approximability - Towards Tight Results. FOCS 1995: 422-431 | |
| c28 | Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan: Linearity Testing in Characteristic Two. FOCS 1995: 432-441 | |
| c27 | Mihir Bellare, Uriel Feige, Joe Kilian: On the Role of Shared Randomness in Two Prover Proof Systems. ISTCS 1995: 199-208 | |
| c26 | Mihir Bellare, Oded Goldreich, Shafi Goldwasser: Incremental cryptography and application to virus protection. STOC 1995: 45-56 | |
| c25 | Mihir Bellare, Phillip Rogaway: Provably secure session key distribution: the three party case. STOC 1995: 57-66 | |
| c24 | William Aiello, Mihir Bellare, Ramarathnam Venkatesan: Knowledge on the average-perfect, statistical and logarithmic. STOC 1995: 469-478 | |
| i1 | Mihir Bellare, Oded Goldreich, Madhu Sudan: Free Bits, PCP and Non-Approximability - Towards Tight Results. Electronic Colloquium on Computational Complexity (ECCC) 2(24) (1995) | |
| 1994 | ||
| j3 | Mihir Bellare, Shafi Goldwasser: The Complexity of Decision Versus Search. SIAM J. Comput. 23(1): 97-119 (1994) | |
| c23 | Mihir Bellare, Oded Goldreich, Shafi Goldwasser: Incremental Cryptography: The Case of Hashing and Signing. CRYPTO 1994: 216-233 | |
| c22 | Mihir Bellare, Joe Kilian, Phillip Rogaway: The Security of Cipher Block Chaining. CRYPTO 1994: 341-358 | |
| c21 | ||
| c20 | ||
| c19 | ||
| c18 | Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell: Efficient probabilistic checkable proofs and applications to approximation. STOC 1994: 820 | |
| 1993 | ||
| j2 | Mihir Bellare, Oded Goldreich, Shafi Goldwasser: Randomness in Interactive Proofs. Computational Complexity 3: 319-354 (1993) | |
| c17 | Mihir Bellare, Phillip Rogaway: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. ACM Conference on Computer and Communications Security 1993: 62-73 | |
| c16 | ||
| c15 | Mihir Bellare: Interactive Proofs and Approximation: Reduction from Two Provers in One Round. ISTCS 1993: 266-274 | |
| c14 | Mihir Bellare, Shafi Goldwasser, Carsten Lund, A. Russeli: Efficient probabilistically checkable proofs and applications to approximations. STOC 1993: 294-304 | |
| 1992 | ||
| j1 | Mihir Bellare, Silvio Micali: How to Sign Given Any Trapdoor Permutation. J. ACM 39(1): 214-233 (1992) | |
| c13 | Mihir Bellare: A Technique for Upper Bounding the Spectral Norm with Applications to Learning. COLT 1992: 62-70 | |
| c12 | ||
| c11 | Mihir Bellare, Moti Yung: Certifying Cryptographic Tools: The Case of Trapdoor Permutations. CRYPTO 1992: 442-460 | |
| c10 | ||
| 1991 | ||
| c9 | Richard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser: Languages that Are Easier than their Proofs. FOCS 1991: 19-28 | |
| 1990 | ||
| c8 | Mihir Bellare, Oded Goldreich, Shafi Goldwasser: Randomness in Interactive Proofs. FOCS 1990: 563-572 | |
| c7 | Mihir Bellare, Silvio Micali, Rafail Ostrovsky: Perfect Zero-Knowledge in Constant Rounds. STOC 1990: 482-493 | |
| c6 | Mihir Bellare, Silvio Micali, Rafail Ostrovsky: The (True) Complexity of Statistical Zero Knowledge. STOC 1990: 494-502 | |
| 1989 | ||
| c5 | Mihir Bellare, Shafi Goldwasser: New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs. CRYPTO 1989: 194-211 | |
| c4 | Mihir Bellare, Silvio Micali: Non-Interactive Oblivious Transfer and Spplications. CRYPTO 1989: 547-557 | |
| c3 | Mihir Bellare, Lenore Cowen, Shafi Goldwasser: On the Structure of Secret Key Exchange Protocols. CRYPTO 1989: 604-605 | |
| 1988 | ||
| c2 | ||
| c1 | Mihir Bellare, Silvio Micali: How to Sign Given Any Trapdoor Function (Extended Abstract). STOC 1988: 32-42 | |
Data released under the ODC-BY 1.0 license — See also our legal information page