15 search results - page 2 / 3 » Fully Secure Functional Encryption with General Relations fr... |
IACR
2011
12 years 5 months ago
2011
In this paper, we explore a general methodology for converting composite order pairingbased cryptosystems into the prime order setting. We employ the dual pairing vector space app...
CRYPTO
2009
Springer
14 years 10 days ago
2009
Springer
Most of the work in the analysis of cryptographic schemes is concentrated in abstract adversarial models that do not capture side-channel attacks. Such attacks exploit various for...
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
EUROCRYPT
2010
Springer
13 years 10 months ago
2010
Springer
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...