Sciweavers

102 search results - page 9 / 21
» Practical Identity-Based Encryption Without Random Oracles
Sort
View
ASIACRYPT
2006
Springer
15 years 1 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
ASIACRYPT
2007
Springer
15 years 3 months ago
Fully Anonymous Group Signatures Without Random Oracles
We construct a new group signature scheme using bilinear groups. The group signature scheme is practical, both keys and group signatures consist of a constant number of group elem...
Jens Groth
INDOCRYPT
2003
Springer
15 years 2 months ago
Practical Mental Poker Without a TTP Based on Homomorphic Encryption
A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-ga...
Jordi Castellà-Roca, Josep Domingo-Ferrer, ...
116
Voted
AFRICACRYPT
2010
Springer
15 years 4 months ago
Fair Blind Signatures without Random Oracles
A fair blind signature is a blind signature with revocable anonymity and unlinkability, i.e., an authority can link an issuing session to the resulting signature and trace a signat...
Georg Fuchsbauer, Damien Vergnaud
69
Voted
DAM
2006
121views more  DAM 2006»
14 years 9 months ago
Fine-grained forward-secure signature schemes without random oracles
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-...
Jan Camenisch, Maciej Koprowski