Compact E-Cash and Simulatable VRFs Revisited
From MaRDI portal
Publication:3392907
DOI10.1007/978-3-642-03298-1_9zbMATH Open1248.94051OpenAlexW2155917298MaRDI QIDQ3392907FDOQ3392907
Authors: Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya 
Publication date: 18 August 2009
Published in: Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03298-1_9
Recommendations
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
- Simulatable verifiable random function from the LWE assumption
- The electronic cash system based on non-interactive zero-knowledge proofs
- Fine-Tuning Groth-Sahai Proofs
Cites Work
- Theory of Cryptography
- A taxonomy of pairing-friendly elliptic curves
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Efficient concurrent zero-knowledge in the auxiliary string model
- Efficient Two-Party Secure Computation on Committed Inputs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Security in Communication Networks
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- Randomizable Proofs and Delegatable Anonymous Credentials
- Compact E-Cash
- Efficient Protocols for Set Membership and Range Proofs
- Title not available (Why is that?)
- Public Key Cryptography - PKC 2006
- Efficient proofs that a committed number lies in an interval
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Public Key Cryptography - PKC 2005
- Title not available (Why is that?)
- A Universally Composable Scheme for Electronic Cash
Cited In (13)
- The price of verifiability: lower bounds for verifiable random functions
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Skipping the \(q\) in group signatures
- Classical and quantum security of elliptic curve VRF, via relative indifferentiability
- Lattice-based e-cash, revisited
- Verifiable random functions from standard assumptions
- Concurrently secure blind Schnorr signatures
- Transferable e-cash: a cleaner model and the first practical instantiation
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- On the impossibility of structure-preserving deterministic primitives
- Simulatable verifiable random function from the LWE assumption
- Universally Composable Adaptive Priced Oblivious Transfer
- QA-NIZK Arguments of Same Opening for Bilateral Commitments
This page was built for publication: Compact E-Cash and Simulatable VRFs Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392907)
