Sciweavers

117 search results - page 14 / 24
» Short Group Signature Without Random Oracles
Sort
View
ASIACRYPT
2010
Springer
15 years 1 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth
170
Voted
ASIACRYPT
2004
Springer
15 years 7 months ago
Efficient and Provably Secure Trapdoor-Free Group Signature Schemes from Bilinear Pairings
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...
Lan Nguyen, Reihaneh Safavi-Naini
ACISP
2005
Springer
15 years 9 months ago
Two Improved Partially Blind Signature Schemes from Bilinear Pairings
A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...
117
Voted
ASIACRYPT
2009
Springer
15 years 10 months ago
Group Encryption: Non-interactive Realization in the Standard Model
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
Julien Cathalo, Benoît Libert, Moti Yung
124
Voted
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 3 months ago
New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
Damien Vergnaud