Mihir Bellare
Artificial Intelligence · 1992–2013
A researcher in the Science corpus: 35 papers; trusts 93 researchers and is trusted by 197 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 155 citations into it; #2,153 of 36,961 by trust here, #2,587 by citations
- Computational Theory and Mathematics — 58 citations into it; #1,128 of 12,489 by trust here, #999 by citations
- Information Systems — 55 citations into it; #1,150 of 9,233 by trust here, #2,122 by citations
- Computer Networks and Communications — 53 citations into it; #644 of 9,996 by trust here, #1,439 by citations
- Computer Vision and Pattern Recognition — 42 citations into it; #4,048 of 21,973 by trust here, #4,657 by citations
- Privacy & Security — 25 citations into it
- Algorithms & Complexity — 9 citations into it
- Discrete Mathematics and Combinatorics — 8 citations into it
Whom Mihir Bellare trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Phillip Rogaway
- Shafi Goldwasser
- Silvio Micali
- Oded Goldreich
- Hugo Krawczyk
- Amos Fiat
- Dan Boneh
- Ran Canetti
- Claus-Peter Schnorr
- Yehuda Lindell
Who trusts Mihir Bellare overall
- Victor Shoup
- Dan Boneh
- David Pointcheval
- Phillip Rogaway
- Jens Groth
- Jonathan Katz
- Michel Abdalla
- Sriram Keelveedhi
- Dennis Hofheinz
- Hugo Krawczyk
Papers from Mihir Bellare's perspective
Ordered by how strongly the researchers Mihir Bellare trusts endorse each paper. Same corpus, a different order for every researcher.
- Random oracles are practical: a paradigm for designing efficient protocols
- New Directions in Cryptography
- Probabilistic Encryption
- A method for obtaining digital signatures and public-key cryptosystems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Protocols for secure computations
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- Short Signatures from the Weil Pairing
- Fair exchange with a semi-trusted third party (extended abstract)
Their papers
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (2005) — 999 citations
- Key-Privacy in Public-Key Encryption (2001) — 511 citations
- The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols (2004) — 272 citations
- Multi-signatures in the plain public-Key model and a general forking lemma (2006) — 730 citations
- Efficient Garbling from a Fixed-Key Blockcipher (2013) — 355 citations
- An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem (2004) — 298 citations
- Robust computational secret sharing and a unified account of classical secret-sharing goals (2007) — 112 citations
- Security Proofs for Identity-Based Identification and Signature Schemes (2008) — 505 citations
- Message-Locked Encryption and Secure Deduplication (2013) — 847 citations
- DupLESS: Server-Aided Encryption for Deduplicated Storage (2013) — 749 citations
- Foundations of garbled circuits (2012) — 620 citations
- Deterministic and Efficiently Searchable Encryption (2007) — 858 citations
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs (2006) — 863 citations
- New Proofs for NMAC and HMAC: Security without Collision Resistance (2006) — 294 citations
- HOTP: An HMAC-Based One-Time Password Algorithm (2005) — 319 citations
- Foundations of Group Signatures: The Case of Dynamic Groups (2005) — 575 citations
- A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications (2003) — 320 citations
- The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme (2003) — 399 citations
- Forward-Security in Private-Key Cryptography (2003) — 349 citations
- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions (2003) — 785 citations