Mihir Bellare

Mihir Bellare
OccupationProfessor
Board member of
San Diego Privacy Advisory Board
Awards
Academic background
Education
ThesisRandomness in Interactive Proofs (1991)
Silvio Micali[1]
Academic work
DisciplineComputer science
Sub-discipline
Cryptography
InstitutionsUniversity of California San Diego
Notable ideas
Random oracle model

Mihir Bellare is a cryptographer and professor at the University of California San Diego. He holds a Bachelor of Science degree from the California Institute of Technology and a Ph.D. from the Massachusetts Institute of Technology.[2] He has published several seminal papers in the field of cryptography (notably in the area of provable security), many of which were co-written with Phillip Rogaway. Bellare has published a number of papers in the field of Format-Preserving Encryption. His students include Michel Abdalla, Chanathip Namprempre, Tadayoshi Kohno and Anton Mityagin. Bellare is one of the authors of skein.

In 2003 Bellare was a recipient of RSA Conference's Sixth Annual Award for outstanding contributions in the field of mathematics for his research in cryptography.[3] In 2013 he became a Fellow of the Association for Computing Machinery.[4] In 2019 he was awarded Levchin Prize for Real-World Cryptography for his outstanding contributions to the design and analysis of real-world cryptosystems, including the development of random oracle model, modes of operation, HMAC, and models for key exchange.[5]

Bellare's papers cover topics including:


On September 14, 2022, Bellare was appointed by the mayor of San Diego to the city's Privacy Advisory Board.[46][2]

References

  1. ↑ Mihir Bellare at the Mathematics Genealogy Project
  2. 1 2 Gloria, Todd (2022-09-14). "Memorandum | Appointments to the Privacy Advisory Board" (PDF). The City of San Diego. Archived (PDF) from the original on 2022-10-20.
  3. ↑ "RSA Conference Announces Sixth Annual Award Recipients". www.rsa.com. Archived from the original on January 7, 2010.
  4. ↑ "ACM Names Fellows for Computing Advances that Are Transforming Science and Society" (Press release). Association for Computing Machinery. Archived from the original on 2014-07-22. Retrieved 2013-12-10.
  5. ↑ "Levchin Prize Names Winners at the 2019 Real-World Crypto Conference". AP NEWS. 2019-01-09. Retrieved 2019-01-09.
  6. ↑ Bellare, M.; Namprempre, C. (2000). Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm. Asiacrypt 2000.
  7. ↑ Bellare, M.; Hoang, V. T.; Rogaway, P. (2012). Foundations of garbled circuits. ACM CCS 2012.
  8. ↑ Bellare, M.; Neven, G. (2006). Multisignatures in the Plain Public-Key Model and a General Forking Lemma (PDF). ACM CCS 2006.
  9. ↑ Bellare, M.; Miner, S. (1999). A forward-secure digital signature scheme (PDF). Crypto 1999.
  10. ↑ Bellare, M.; Tessaro, S.; Zhu, C. (2022). Stronger Security for Non-Interactive Threshold Signatures: BLS and FROST.
  11. ↑ Bellare, M.; Boldyreva, A.; O'Neill, A. (2007). Deterministic and efficiently searchable encryption. Crypto 2007.
  12. ↑ Abdalla, M.; Bellare, M.; Catalano, D.; Kiltz, E.; Kohno, T.; Lange, T.; Malone-Lee, J.; Neven, G.; Paillier, P.; Shi, H. (2005). Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. Crypto 2005.
  13. ↑ Bellare, M.; Brakerski, Z.; Naor, M.; Ristenpart, T.; Segev, G.; Shacham, H.; Yilek, S. (2009). Hedged Public-Key Encryption: How to Protect against Bad Randomness. Asiacrypt 2009.
  14. ↑ Bellare, M.; Kohno, T. (2003). A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications (PDF). Eurocrypt 2003.
  15. ↑ Bellare, M.; Micciancio, D.; Warinschi, B. (2003). Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions (PDF). Eurocrypt 2003.
  16. ↑ Bellare, M.; Keelveedhi, S. (2011). Authenticated and Misuse-Resistant Encryption of Key-Dependent Data. Crypto 2011.
  17. ↑ Bellare, M.; Keelveedhi, S.; Ristenpart, T. (2013). Message-Locked Encryption and Secure Deduplication. Eurocrypt 2013.
  18. ↑ Bellare, M.; Singh, A. C.; Jaeger, J.; Nyayapati, M.; Stepanovs, I. (2017). Ratcheted encryption and key exchange: The security of messaging. Crypto 2017.
  19. ↑ Bellare, M.; Kiltz, E.; Peikert, C.; Waters, B. (2012). Identity-Based (Lossy) Trapdoor Functions and Applications. Eurocrypt 2012.
  20. ↑ Bellare, M.; Sahai, A. (1999). Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization (PDF). Crypto 1999.
  21. ↑ Bellare, M.; Goldreich, O. (1992). On defining proofs of knowledge (PDF). Crypto 1992.
  22. ↑ Bellare, M.; Canetti, R.; Krawczyk, H. (1996). Pseudorandom functions revisited: The cascade construction and its concrete security (PDF). FOCS 1996.
  23. ↑ Bellare, M.; Kilian, J.; Rogaway, P. (2000). "The security of the cipher block chaining message authentication code" (PDF). Journal of Computer and System Sciences. 61 (3): 362–399. doi:10.1006/jcss.1999.1694.
  24. ↑ Bellare, M.; Rogaway, P. (2006). Code-Based Game-Playing Proofs and the Security of Triple Encryption. Eurocrypt 2006.
  25. ↑ Bellare, M.; Desai, A.; Jokipii, E.; Rogaway, P. (1997). A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation (PDF). FOCS 1997.
  26. ↑ Bellare, M.; Jaeger, J.; Kane, D. (2015). Mass-surveillance without the state: Strongly undetectable algorithm-substitution attacks. ACM CCS 2015.
  27. ↑ Bellare, M.; Pointcheval, D.; Rogaway, P. (2000). Authenticated Key Exchange Secure Against Dictionary Attacks. Eurocrypt 2000.
  28. ↑ Bellare, M.; Namprempre, C.; Pointcheval, D.; Semanko, M. (2003). "The One-More-RSA-Inversion Problems and the security of Chaum's Blind Signature Scheme". Journal of Cryptology. 16 (3): 185–215. doi:10.1007/s00145-002-0120-1.
  29. ↑ Bellare, M.; Goldreich, O.; Goldwasser, S. (1994). Incremental cryptography: the case of hashing and signing (PDF). Crypto 1994.
  30. ↑ Bellare, M.; Dai, W.; Rogaway, P. (2020). Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements. PETS 2020.
  31. ↑ Bellare, M.; Stepanovs, I. (2016). Point-function obfuscation: a framework and generic constructions. TCC 2016-A.
  32. ↑ Rogaway, P.; Bellare, M.; Black, J.; Krovetz, T. (2001). OCB: A block-cipher mode of operation for efficient authenticated encryption. ACM CCS 2001.
  33. ↑ Bellare, M.; Goldreich, O.; Sudan, M. (1998). "Free bits, PCPs and non-approximability" (PDF). SIAM Journal on Computing. 27 (3). doi:10.1137/S0097539796302531.
  34. ↑ Bellare, M.; Micali, S.; Ostrovsky, R. (1990). Perfect Zero-Knowledge in Constant Rounds (PDF). STOC 1990.
  35. ↑ Abdalla, M.; An, J.; Bellare, M.; Namprempre, C. (2002). From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. Eurocrypt 2002.
  36. ↑ Bellare, M.; Shea, L. (2023). Flexible Password-Based Encryption: Securing Cloud Storage and Provably Resisting Partitioning-Oracle Attacks. CT-RSA 2023.
  37. ↑ Bellare, M.; Tackmann, B. (2016). The multi-user security of authenticated encryption: AES-GCM in TLS 1.3. Crypto 2016.
  38. ↑ Abdalla, M.; Bellare, M.; Neven, G. (2010). Robust Encryption. TCC 2010.
  39. ↑ Bellare, M.; Hoang, V. T.; Keelveedhi, S. (2013). Instantiating random oracles via UCEs. Crypto 2013.
  40. ↑ Bellare, M.; Kane, D.; Rogaway, P. (2016). Big-key symmetric encryption: resisting key exfiltration. Crypto 2016.
  41. ↑ Bellare, M.; Ristov, T. (2014). "A characterization of chameleon hash functions and new, efficient designs". Journal of Cryptology. 27 (4): 799–823. doi:10.1007/s00145-013-9155-8.
  42. ↑ Bellare, M.; Tessaro, S.; Vardy, A. (2012). Semantic Security for the Wiretap Channel. Crypto 2012.
  43. ↑ Bellare, M.; O'Neill, A. (2013). Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition. CANS 2013.
  44. ↑ Bellare, M.; Garay, J.; Hauser, R.; Herzberg, A.; Krawczyk, H.; Steiner, M.; Tsudik, G.; Van Herreweghen, E.; Waidner, M. (2000). "Design, implementation, and deployment of the iKP secure electronic payment system" (PDF). IEEE Journal on Selected Areas in Communications. 18 (4): 611–627. Bibcode:2000IJSAC..18..611B. doi:10.1109/49.839936.
  45. ↑ Bellare, M.; Garay, J.; Rabin, T. (1998). Fast batch verification for modular exponentiation and digital signatures (PDF). Eurocrypt 1998.
  46. ↑ "OnBoard2 | City of San Diego". The City of San Diego. Archived from the original on 2023-03-08. Retrieved 2023-03-08.


This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.