27 search results - page 2 / 6 » Efficient Non-interactive Proof Systems for Bilinear Groups |
ASIACRYPT
2004
Springer
13 years 8 months ago
2004
Springer
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
PKC
2007
Springer
13 years 11 months ago
2007
Springer
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the...
IJNSEC
2006
13 years 4 months ago
2006
Secure multicast represents the core component of many web and multimedia applications such as pay-TV, teleconferencing, real-time distribution of stock market price and etc. The ...
ACNS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...