Sciweavers

55 search results - page 7 / 11
» On the Minimal Assumptions of Group Signature Schemes
Sort
View
76
Voted
ISPEC
2005
Springer
15 years 3 months ago
Short Linkable Ring Signatures for E-Voting, E-Cash and Attestation
Abstract. A ring signature scheme can be viewed as a group signature scheme with no anonymity revocation and with simple group setup. A linkable ring signature (LRS) scheme additio...
Patrick P. Tsang, Victor K. Wei
76
Voted
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
CCS
2008
ACM
14 years 11 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
ASIACRYPT
2001
Springer
15 years 2 months ago
Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
Threshold cryptosystems and signature schemes give ways to distribute trust throughout a group and increase the availability of cryptographic systems. A standard approach in design...
Anna Lysyanskaya, Chris Peikert
99
Voted
ESORICS
2005
Springer
15 years 3 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento