Mihir Bellare | Academic Influence

Mihir Bellare's AcademicInfluence.com Rankings

Mihir Bellare

Computer Science

#1041

World Rank

#1079

Historical Rank

#552

USA Rank

Database

#530

World Rank

#554

Historical Rank

#205

USA Rank

computer-science Degrees

Download Badge

Computer Science

Mihir Bellare's Degrees

Bachelors Computer Science IIT Bombay

Similar Degrees You Can Earn

Why Is Mihir Bellare Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Mihir Bellare is a cryptographer and professor at the University of California San Diego. He holds a Bachelor of Science degree from Caltech and a Ph.D. from Massachusetts Institute of Technology. He has published several seminal papers in the field of cryptography , 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.

(See a Problem?)

Mihir Bellare's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Random oracles are practical: a paradigm for designing efficient protocols (1993) (4936)
HMAC: Keyed-Hashing for Message Authentication (1997) (2384)
Keying Hash Functions for Message Authentication (1996) (1787)
Entity Authentication and Key Distribution (1993) (1752)
Authenticated Key Exchange Secure against Dictionary Attacks (2000) (1490)
Relations among Notions of Security for Public-Key Encryption Schemes (1998) (1148)
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm (2000) (1090)
The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin (1996) (1040)
A concrete security treatment of symmetric encryption (1997) (1033)
Optimal Asymmetric Encryption (1994) (944)
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions (2005) (931)
Deterministic and Efficiently Searchable Encryption (2007) (828)
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs (2006) (753)
Message-Locked Encryption and Secure Deduplication (2013) (743)
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions (2003) (723)
OCB: a block-cipher mode of operation for efficient authenticated encryption (2001) (700)
Provably secure session key distribution: the three party case (1995) (674)
A Forward-Secure Digital Signature Scheme (1999) (660)
DupLESS: Server-Aided Encryption for Deduplicated Storage (2013) (654)
The Security of the Cipher Block Chaining Message Authentication Code (2000) (654)
On Defining Proofs of Knowledge (1992) (614)
Free bits, PCPs and non-approximability-towards tight results (1995) (613)
A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract) (1998) (588)
Advances in Cryptology — CRYPTO 2000 (2000) (560)
Foundations of Group Signatures: The Case of Dynamic Groups (2005) (532)
Multi-signatures in the plain public-Key model and a general forking lemma (2006) (529)
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements (2000) (507)
Foundations of garbled circuits (2012) (490)
Optimal Asymmetric Encryption-How to Encrypt with RSA (1995) (490)
Security Proofs for Identity-Based Identification and Signature Schemes (2008) (481)
Fast Batch Verification for Modular Exponentiation and Digital Signatures (1998) (461)
The Security of Cipher Block Chaining (1994) (455)
Key-Privacy in Public-Key Encryption (2001) (451)
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES (2001) (444)
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks (2002) (399)
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme (2003) (344)
Non-Interactive Oblivious Transfer and Spplications (1989) (332)
Incremental Cryptography: The Case of Hashing and Signing (1994) (329)
Efficient Garbling from a Fixed-Key Blockcipher (2013) (317)
Forward-Security in Private-Key Cryptography (2003) (313)
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications (2003) (308)
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions (1995) (304)
Efficient probabilistically checkable proofs and applications to approximations (1993) (303)
An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem (2004) (300)
Lecture Notes on Cryptography (2001) (298)
HOTP: An HMAC-Based One-Time Password Algorithm (2005) (274)
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost (1997) (266)
Collision-Resistant Hashing: Towards Making UOWHFs Practical (1997) (260)
New Proofs for NMAC and HMAC: Security without Collision Resistance (2015) (258)
The EAX Mode of Operation (2004) (257)
The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols (2004) (255)
Pseudorandom functions revisited: the cascade construction and its concrete security (1996) (233)
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (2009) (233)
Forward Integrity For Secure Audit Logs (1997) (226)
Format-Preserving Encryption (2009) (209)
Code-Based Game-Playing Proofs and the Security of Triple Encryption (2004) (204)
A concrete security treatment of symmet-ric encryption: Analysis of the DES modes of operation (1997) (201)
iKP - A Family of Secure Electronic Payment Protocols (1995) (197)
Multi-Property-Preserving Hash Domain Extension and the EMD Transform (2006) (193)
Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography (2000) (193)
From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security (2002) (188)
Linearity testing in characteristic two (1995) (188)
HMAC: Keyed-Hashing for Message Authentication, RFC 2104 (2000) (184)
Improved non-approximability results (1994) (184)
Hash Function Balance and Its Impact on Birthday Attacks (2004) (176)
Design, implementation, and deployment of the iKP secure electronic payment system (2000) (175)
Semantic Security for the Wiretap Channel (2012) (173)
Randomness-efficient oblivious sampling (1994) (172)
Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization (1999) (170)
DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem (1999) (169)
On Chromatic Sums and Distributed Resource Allocation (1998) (167)
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles (2008) (155)
Incremental cryptography and application to virus protection (1995) (148)
Security Proofs for Identity-Based Identification and Signature Schemes (2004) (146)
Verifiable partial key escrow (1997) (143)
Randomness Re-use in Multi-recipient Encryption Schemeas (2003) (143)
Practice-Oriented Provable-Security (1997) (140)
The complexity of approximating a nonlinear program (1995) (139)
New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs (1989) (139)
Security of Symmetric Encryption against Mass Surveillance (2014) (139)
Does parallel repetition lower the error in computationally sound protocols? (1997) (137)
OCB: A block-cipher mode of operation for efficient authenticated encryption (2003) (135)
Hedged Public-Key Encryption: How to Protect against Bad Randomness (2009) (133)
Towards Plaintext-Aware Public-Key Encryption Without Random Oracles (2004) (126)
Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme (2009) (126)
Efficient probabilistic checkable proofs and applications to approximation (1994) (124)
The Power of Verification Queries in Message Authentication and Authenticated Encryption (2004) (123)
Authenticated encryption in SSH: provably fixing the SSH binary packet protocol (2002) (123)
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles (2007) (123)
Breaking and provably repairing the SSH authenticated encryption scheme: A case study of the Encode-then-Encrypt-and-MAC paradigm (2004) (121)
Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks (2010) (119)
Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques (2000) (118)
Interactive Message-Locked Encryption and Secure Deduplication (2015) (116)
Cryptography Secure Against Related-Key Attacks and Tampering (2011) (116)
Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible (1998) (113)
Unrestricted Aggregate Signatures (2007) (111)
Identification Protocols Secure against Reset Attacks (2001) (106)
Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing (2012) (106)
Robust computational secret sharing and a unified account of classical secret-sharing goals (2007) (103)
Improved Security Analyses for CBC MACs (2005) (103)
Perfect zero-knowledge in constant rounds (1990) (102)
Uniform Generation of NP-Witnesses Using an NP-Oracle (2000) (100)
Robust Encryption (2010) (98)
Identity-Based Multi-signatures from RSA (2007) (97)
Identity-Based Encryption Secure against Selective Opening Attack (2011) (96)
NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (2016) (95)
The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme (2002) (94)
A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion (1999) (92)
How to sign given any trapdoor function (1988) (91)
Instantiating Random Oracles via UCEs (2013) (88)
The Complexity of Decision Versus Search (1991) (88)
Certifying Permutations: Noninteractive zero-knowledge based on any trapdoor permutation (1996) (86)
Randomness in interactive proofs (1990) (84)
The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3 (2016) (83)
The AuthA Protocol for Password-Based Authenticated Key Exchange (2000) (82)
Policy-Based Signatures (2014) (82)
Protecting against key-exposure: strongly key-insulated encryption with optimal threshold (2005) (81)
RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures (2012) (79)
The (true) complexity of statistical zero knowledge (1990) (79)
"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case (1997) (78)
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function (1997) (77)
Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions (1999) (75)
Online Ciphers and the Hash-CBC Construction (2001) (73)
Ratcheted Encryption and Key Exchange: The Security of Messaging (2017) (72)
Cryptographic Agility and Its Relation to Circular Encryption (2010) (71)
Mass-surveillance without the State: Strongly Undetectable Algorithm-Substitution Attacks (2015) (69)
Transitive Signatures Based on Factoring and RSA (2002) (69)
Minimizing the use of random oracles in authenticated encryption schemes (1997) (69)
Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems (1998) (67)
A Note on Negligible Functions (2002) (66)
Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms (2007) (66)
Standard Security Does Not Imply Security against Selective-Opening (2012) (66)
Multi-instance Security and Its Application to Password-Based Cryptography (2012) (66)
On the Construction of Variable-Input-Length Ciphers (1999) (64)
A Cryptographic Treatment of the Wiretap Channel (2012) (64)
Encapsulated Key Escrow (1996) (62)
Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier (1999) (62)
The FFX Mode of Operation for Format-Preserving Encryption Draft 1 . 1 (2010) (61)
How to sign given any trapdoor permutation (1992) (60)
Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model (2015) (57)
Identity-Based (Lossy) Trapdoor Functions and Applications (2012) (57)
Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed? (2013) (56)
Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition (2013) (55)
Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security (2007) (55)
Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation (2006) (52)
Transitive signatures: new schemes and proofs (2005) (51)
Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers (1998) (51)
The Security of Practical Two-Party RSA Signature Schemes (2001) (50)
Practice-Oriented Provable Security (1998) (49)
Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation (2014) (48)
Does Encryption with Redundancy Provide Authenticity? (2001) (47)
Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity (2012) (46)
EAX: A Conventional Authenticated-Encryption Mode (2003) (46)
Certifying Cryptographic Tools: The Case of Trapdoor Permutations (1992) (45)
On-line Ciphers and the Hash-CBC Constructions (2012) (45)
Batch Verification with Applications to Cryptography and Checking (1998) (44)
Advances in Cryptology — CRYPTO '97 (1996) (41)
The Game-Playing Technique (2004) (41)
Adaptive Witness Encryption and Asymmetric Password-Based Cryptography (2015) (39)
Hash-Function Based PRFs: AMAC and Its Multi-User Security (2016) (39)
Interactive proofs and approximation: reductions from two provers in one round (1993) (38)
Encryption Schemes Secure under Selective Opening Attack (2009) (38)
Big-Key Symmetric Encryption: Resisting Key Exfiltration (2016) (36)
Point-Function Obfuscation: A Framework and Generic Constructions (2016) (34)
The EAX Mode of Operation (A Two-Pass Authenticated-Encryption Scheme Optimized for Simplicity and Efficiency) (2004) (33)
Multi-Recipient Encryption Schemes: Security Notions and Randomness Re-Use (2003) (32)
Message-Recovery Attacks on Feistel-Based Format Preserving Encryption (2016) (32)
From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security (2008) (31)
New Negative Results on Differing-Inputs Obfuscation (2016) (31)
Making zero-knowledge provers efficient (1992) (31)
From Identification to Signatures, Tightly: A Framework and Generic Transforms (2016) (30)
A Conventional Authenticated-Encryption Mode (2003) (30)
The Secure Shell (SSH) Transport Layer Encryption Modes (2006) (29)
On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge (2006) (29)
On Deening Proofs of Knowledge (1992) (29)
VarietyCash: A Multi-Purpose Electronic Payment System (1998) (29)
The Security of Chaffing and Winnowing (2000) (29)
PSS: Provably Secure Encoding Method for Digital Signatures (1998) (28)
Foundations of group signatures: Formal de ni-tions (2003) (27)
Languages that are easier than their proofs (1991) (26)
Provable Security Support for the Skein Hash Family Version 1 (2009) (24)
Translucent Cryptography—An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer (1999) (23)
Contention in Cryptoland: Obfuscation, Leakage and UCE (2016) (23)
Hash Functions from Sigma Protocols and Improvements to VSH (2008) (23)
A technique for upper bounding the spectral norm with applications to learning (1992) (22)
Message Authentication using Hash Functions (1996) (21)
Introduction to Modern Cryptography (2019) (21)
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data (2011) (19)
A Characterization of Chameleon Hash Functions and New, Efficient Designs (2014) (19)
Nonces are Noticed: AEAD Revisited (2019) (19)
Knowledge on the average—perfect, statistical and logarithmic (1995) (19)
Nonce-Based Cryptography: Retaining Security When Randomness Fails (2016) (19)
Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures (2017) (18)
New Proofs for NMAC and HMAC: Security without Collision Resistance (2006) (17)
Identity-Based Format-Preserving Encryption (2017) (16)
Public-Key Encryption Resistant to Parameter Subversion and its Realization from Efficiently-Embeddable Groups (2018) (16)
Proof Checking and Approximation: Towards Tight Results (1996) (16)
Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig (2014) (16)
Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability (2020) (15)
Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing (1996) (14)
Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of an HMAC Assumption (2015) (14)
On the Structure of Secret Key Exchange Protocols (1989) (13)
Addendum to “ The FFX Mode of Operation for Format-Preserving Encryption ” A parameter collection for enciphering strings of arbitrary radix and length (2010) (13)
The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures (2020) (13)
Making Zero Knowledge Provers E cient (1995) (13)
A theoretical treatment of related-key attacks (2003) (13)
Searchable encryption revisited (2006) (13)
Evaluation of Security Level of Cryptography (2001) (12)
Design, Implementation and Deployment of a Secure Account-Based Electronic Payment System (2000) (12)
Cryptography from Compression Functions: The UCE Bridge to the ROM (2014) (12)
Key Insulation and Intrusion Resilience over a Public Channel (2009) (12)
Foundations for Group Signatures: Simplified Requirements and a Construction Based on General Assumptions (2003) (11)
The Fiat-Shamir Zoo: Relating the Security of Different Signature Variants (2018) (11)
Partial Signatures and their Applications (2009) (11)
Ciphers that securely encipher their own keys (2011) (10)
Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction (2017) (10)
Efficiently-Searchable and Deterministic Asymmetric Encryption (2006) (10)
On the role of shared randomness in two prover proof systems (1995) (10)
How Secure is Deterministic Encryption? (2015) (9)
Two-tier signatures from the Fiat-Shamir transform, with applications to strongly unforgeable and one-time signatures (2008) (9)
Proving Computational Ability (2011) (9)
Garbling Schemes (2012) (9)
THE SPECTRAL NORM OF FINITE FUNCTIONS (1991) (8)
Better than Advertised Security for Non-interactive Threshold Signatures (2022) (7)
Provably Fixing the SSH Binary Packet Protocol (2002) (7)
“Pseudo-Random” Number Generation within Cryptographic Algorithms: the DSS Case (2021) (7)
Stronger Security for Non-Interactive Threshold Signatures: BLS and FROST (2022) (6)
Forward-Security under Continual Leakage (2017) (6)
Chain Reductions for Multi-signatures and the HBMS Scheme (2021) (6)
Better Than Advertised: Improved Collision-Resistance Guarantees for MD-Based Hash Functions (2017) (6)
New Multi-Signature Schemes and a General Forking Lemma (2017) (6)
Dual-Mode NIZKs: Possibility and Impossibility Results for Property Transfer (2020) (4)
The Local Forking Lemma and its Application to Deterministic Encryption (2019) (4)
Many-toone Trapdoor Functions and Their Relation to Public-Key Cryptosystems (2009) (4)
An Extension of the FF2 FPE Scheme (2014) (3)
Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology (2000) (3)
Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements (2020) (3)
Security under Message-Derived Keys: Signcryption in iMessage (2020) (3)
SSH transport layer encryption modes (2004) (3)
A Concrete-Security Analysis of the Apple PSI Protocol (2021) (3)
Efficient Schemes for Committing Authenticated Encryption (2022) (3)
The Multi-Base Discrete Logarithm Problem: Concrete Security Improvements for Schnorr Identification, Signatures and Multi-Signatures (2020) (2)
Chain Reductions for Multi-Signatures (2021) (2)
The Multi-Base Discrete Logarithm Problem: Non-Rewinding Proofs and Improved Reduction Tightness for Identification and Signatures (2020) (2)
Decision versus Search (2004) (2)
Notes on Randomized Algorithms (2004) (2)
Separate Your Domains: NIST PQC KEMs and Oracle Cloning (2020) (2)
The Security of a Family of Two-Party RSA Signature Schemes (2001) (2)
UCE+LTDFs: Efficient, Subversion-Resistant PKE in the Standard Model (2014) (2)
The EAX mode of operation - eScholarship (2004) (2)
Robust Encryption (2017) (1)
Rekeyed Digital Signature Schemes: Damage-containment in the face of key exposure (2001) (1)
Incremental Cryptography and Application to Virus ProtectionMihir Bellare (2014) (1)
Incremental Cryptography Revisited: PRFs, Nonces and Modular Design (2020) (1)
On-line Ciphers and the Hash-CBC Constructions (2011) (1)
Advances in cryptology - CRYPTO 2000 : 20th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2000 : proceedings (2000) (1)
An Extension of the FF 2 FPE Scheme (2014) (1)
How To Sign Given Any Trapdoor Function (extended abstract) (1988) (1)
Authenticated encryption in SSH (2002) (1)
Secure Transport Protocols for High-Speed Networks (1994) (1)
Entity a U T H E N Tication and Key Distribution (1993) (1)
Better than for Non-interactive Threshold Signatures (2022) (0)
Intensive Convergence Encryption for Secure Deduplication in Cloud (2016) (0)
On identification, zero-knowledge, and plaintext-aware-encryption (2006) (0)
Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed? (2013) (0)
Hardening Signature Schemes via Derive-then-Derandomize: Stronger Security Proofs for EdDSA (2023) (0)
Submission to Journal of Cryptology . Encryption Schemes Secure under Selective Opening Attack (2012) (0)
Linearity Testing in Characteristic Two-Information Theory, IEEE Transactions on (2004) (0)
A Secured and Authorized Data Deduplication in Hybrid Cloud with Public Auditing (2020) (0)
Lectures on NIZKs (2020) (0)
Flexible Password-Based Encryption: Securing Cloud Storage and Provably Resisting Partitioning-Oracle Attacks (2023) (0)
Simultaneously ensuring privacy and authenticity in digital communication (2002) (0)
Format Preserving Encryption using Feistel Cipher (2020) (0)
Encryption schemes: security notions, designs and analyses (2000) (0)
Ciphers and the Hash-CBC Construction (2001) (0)
Process for encryption / decryption of data using Cipher Block Chaining (CBC), and Message Authentication Code (MAC) (1996) (0)
Systems and methods for distributing and ensuring data (2007) (0)
Luby-rackoo Backwards: Increasing Security by Making Block Ciphers Non-invertible Mihir Bellare (1998) (0)
Method and device for data authentication in data communication environment (1994) (0)
Evaluation of Security Level of Cryptography HIME-1 (2001) (0)
Secure Multi-party Computation Dedication a Warning (1998) (0)
Making Zero-Knowledge Provers Efficient ( Extended Abstract ) (2021) (0)
Signcryption in iMessage (2020) (0)
Rendering Wormhole Attacks Trivial using the Scalability Features of a Geocasting Protocol (2016) (0)
A Characterization of Chameleon Hash Functions and New, Efficient Designs (2013) (0)
Double-Authentication-Preventing Signatures from Trapdoor Identification (2015) (0)
Public-key encryption in the multi-user setting: privacy, anonymity and efficiency (2004) (0)
A New Suggestion for How to Encrypt with Rsa (1994) (0)

This paper list is powered by the following services:

Other Resources About Mihir Bellare

en.wikipedia.org

What Schools Are Affiliated With Mihir Bellare?

Mihir Bellare is affiliated with the following schools: