A Signature Scheme with Efficient Proof of Validity
From MaRDI portal
Publication:3005577
DOI10.1007/978-3-642-20901-7_1zbMath1272.94073OpenAlexW2223751661MaRDI QIDQ3005577
Publication date: 8 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20901-7_1
Cites Work
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- Efficient signature generation by smart cards
- Security arguments for digital signatures and blind signatures
- Short signatures without random oracles and the SDH assumption in bilinear groups
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Structure-Preserving Signatures and Commitments to Group Elements
- Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Fully Anonymous Group Signatures Without Random Oracles
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- Efficient Non-interactive Proof Systems for Bilinear Groups