Sciweavers

62 search results - page 2 / 13
» Groth-Sahai Proofs Revisited
Sort
View
CANS
2009
Springer
105views Cryptology» more  CANS 2009»
13 years 11 months ago
Transferable Constant-Size Fair E-Cash
We propose an efficient blind certification protocol with interesting properties. It falls in the Groth-Sahai framework for witness-indistinguishable proofs, thus extended to a ce...
Georg Fuchsbauer, David Pointcheval, Damien Vergna...
CRYPTO
2009
Springer
109views Cryptology» more  CRYPTO 2009»
13 years 11 months ago
Randomizable Proofs and Delegatable Anonymous Credentials
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
Mira Belenkiy, Jan Camenisch, Melissa Chase, Marku...
EUROCRYPT
2012
Springer
11 years 7 months ago
Malleable Proof Systems and Applications
sion of an extended abstract published in Proceedings of Eurocrypt 2012, Springer-Verlag, 2012. Available from the IACR Cryptology ePrint Archive as Report 2012/012. Malleability ...
Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya...
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
12 years 7 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
TCC
2010
Springer
141views Cryptology» more  TCC 2010»
13 years 2 months ago
Composition of Zero-Knowledge Proofs with Efficient Provers
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
Eleanor Birrell, Salil P. Vadhan