Skip to search formSkip to main contentSkip to account menu

Mihir Bellare

Mihir Bellare is a cryptographer and professor at the University of California, San Diego. He has published several seminal papers in the field of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Birthday attackChosen-ciphertext attackConcrete securityCryptography

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Taxation, Risk, and Portfolio Choice: The Treatment of Returns to Risk Under a Normative Income Tax
Many articles in the legal and economic literature claim that a pure Haig-Simons income tax cannot effectively tax investment… 
2012
2012
CMDR Monograph Series No .50 Structure , Employment and Productivity Growth in the Indian Unorganized Manufacturing Sector : An Industry Level Analysis
*This study forms a part of my Ph.D thesis submitted to IIT Madras. I am thankful to my supervisor Malathy Duraisamy for valuable… 
2011
2011
How Nations Share
Every nation has an interest in sharing the gains they help create by participating in globalization. If governments fail to… 
2011
2011
Where in the world are "permanently reinvested" foreign earnings?
This study uses permanently reinvested earnings (PRE) reported in U.S. multinational corporations (MNCs) financial statements… 
2010
2010
The Last Best Hope for Progressivity in Tax
We argue that a spending tax, as opposed to an income or wage tax, is the “last best hope” for a return to significantly more… 
2008
2008
The Encrypted Elliptic Curve Hash
Bellare and Micciancio’s MuHASH applies a pre-existing hash function to map indexed message blocks into a secure group. The… 
2004
2004
Comments on Mihir A. Desai's 'New Foundations for Taxing Multinational Corporations'
2004
2004
A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs
We present a realization of the transitive signature scheme based on the algebraic properties of bilinear group pairs. The scheme… 
Highly Cited
2003
Highly Cited
2003
Introduction to Fuel Cell Technology
Highly Cited
1996
Highly Cited
1996
Testing of the long code and hardness for clique
We prove that unless NP = COR, Max Clique is hard to approximate wit hin polynomial time within a factor ni /2 ‘c for any c >0… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)