Sciweavers

27 search results - page 1 / 6
» Efficient Non-interactive Proof Systems for Bilinear Groups
Sort
View
EUROCRYPT
2008
Springer
13 years 6 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
EUROCRYPT
2006
Springer
13 years 8 months ago
Compact Group Signatures Without Random Oracles
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
Xavier Boyen, Brent Waters
ITIIS
2010
200views more  ITIIS 2010»
12 years 11 months ago
New Techniques for Anonymous HIBE with Short Ciphertexts in Prime Order Groups
Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key...
Kwangsu Lee, Dong Hoon Lee
CANS
2009
Springer
276views Cryptology» more  CANS 2009»
13 years 2 months ago
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...
Benoît Libert, Damien Vergnaud
ASIACRYPT
2006
Springer
13 years 8 months ago
Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
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...
Jens Groth