Efficient Round-Optimal Blind Signatures in the Standard Model
From MaRDI portal
Publication:5854440
DOI10.1007/978-3-319-70972-7_26zbMath1460.94073OpenAlexW2731738616MaRDI QIDQ5854440
Publication date: 17 March 2021
Published in: Financial Cryptography and Data Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-70972-7_26
Related Items (max. 100)
Short pairing-free blind signatures with exponential security ⋮ Boosting the Security of Blind Signature Schemes ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Partially structure-preserving signatures: lower bounds, constructions and more ⋮ An efficient certificate-based signature scheme in the standard model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Security arguments for digital signatures and blind signatures
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Short Randomizable Signatures
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities
- On the Security of One-Witness Blind Signature Schemes
- Beyond the Limitation of Prime-Order Bilinear Groups, and Round Optimal Blind Signatures
- Security of Blind Signatures Revisited
- Compact Round-Optimal Partially-Blind Signatures
- Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
- Lattice-Based Blind Signatures
- Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
- Signatures on Randomizable Ciphertexts
- Strong Knowledge Extractors for Public-Key Encryption Schemes
- Practical Round-Optimal Blind Signatures in the Standard Model
- Concurrent Blind Signatures Without Random Oracles
- On the Impossibility of Three-Move Blind Signature Schemes
- Bounded-concurrent secure two-party computation without setup assumptions
- Structure-Preserving Signatures and Commitments to Group Elements
- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
- Security of Blind Signatures under Aborts
- A Framework for Universally Composable Non-committing Blind Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A practical secret voting scheme for large scale elections
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Efficient Noninteractive Proof Systems for Bilinear Groups
- Delegating a Pairing Can Be Both Secure and Efficient
- Round Optimal Blind Signatures
- Efficient Round Optimal Blind Signatures
- Pairing-Friendly Elliptic Curves of Prime Order
- Security in Communication Networks
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- A Short Paper on Blind Signatures from Knowledge Assumptions
- Topics in Cryptology – CT-RSA 2006
- Theory of Cryptography
This page was built for publication: Efficient Round-Optimal Blind Signatures in the Standard Model
