Efficient Fully Structure-Preserving Signatures and Shrinking Commitments
- 8 August 2018
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 32 (3) , 973-1025
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Efficient Noninteractive Proof Systems for Bilinear GroupsSIAM Journal on Computing, 2012
- A framework for universally composable non-committing blind signaturesInternational Journal of Applied Cryptography, 2012
- Randomizable Proofs and Delegatable Anonymous Credentials2009
- Pairings for cryptographersDiscrete Applied Mathematics, 2008
- Ring Signatures: Stronger Definitions, and Constructions without Random OraclesJournal of Cryptology, 2007
- Short Signatures Without Random Oracles and the SDH Assumption in Bilinear GroupsJournal of Cryptology, 2007
- On computable isomorphisms in efficient asymmetric pairing-based systemsDiscrete Applied Mathematics, 2006
- The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols2004
- On-line/off-line digital signaturesJournal of Cryptology, 1996
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988