Sciweavers

31 search results - page 2 / 7
» Random Oracles are Practical: A Paradigm for Designing Effic...
Sort
View
ASIACRYPT
2006
Springer
13 years 9 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
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
13 years 3 months ago
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...
AINA
2006
IEEE
13 years 9 months ago
Efficient Authentication for Reactive Routing Protocols
Ad hoc networks are dynamic networks formed "on the fly" by a set of nodes. Achieving secure routing in such networks is a big challenge. Asymmetric signature schemes pr...
Raghav Bhaskar, Javier Herranz, Fabien Laguillaumi...
ACISP
2008
Springer
13 years 7 months ago
Efficient One-Round Key Exchange in the Standard Model
We consider one-round key exchange protocols secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of...
Colin Boyd, Yvonne Cliff, Juan Manuel Gonzá...
ACISP
2007
Springer
13 years 9 months ago
Practical Compact E-Cash
Compact e-cash schemes allow a user to withdraw a wallet containing k coins in a single operation, each of which the user can spend unlinkably. One big open problem for compact e-c...
Man Ho Au, Willy Susilo, Yi Mu