Sciweavers

121 search results - page 14 / 25
» A Ring Signature Scheme Using Bilinear Pairings
Sort
View
IACR
2011
84views more  IACR 2011»
13 years 10 months ago
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
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...
Allison B. Lewko
PKC
2007
Springer
117views Cryptology» more  PKC 2007»
15 years 4 months ago
Identity-Based Traitor Tracing
We present the first identity-based traitor tracing scheme. The scheme is shown to be secure in the standard model, assuming the bilinear decision Diffie-Hellman (DBDH) is hard in...
Michel Abdalla, Alexander W. Dent, John Malone-Lee...
CCS
2008
ACM
15 years 18 days 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
EUROCRYPT
1995
Springer
15 years 2 months ago
Fair Blind Signatures
Abstract. A blind signature scheme is a protocol for obtaining a signature from a signer such that the signer's view of the protocol cannot be linked to the resulting message-...
Markus Stadler, Jean-Marc Piveteau, Jan Camenisch
ASIACRYPT
2005
Springer
15 years 4 months ago
Spreading Alerts Quietly and the Subgroup Escape Problem
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
James Aspnes, Zoë Diamadi, Kristian Gjø...