Compact E-Cash and Simulatable VRFs Revisited
From MaRDI portal
Publication:3392907
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
- scientific article; zbMATH DE number 1676644 (Why is no real title available?)
- scientific article; zbMATH DE number 4191103 (Why is no real title available?)
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 503353 (Why is no real title available?)
- scientific article; zbMATH DE number 708808 (Why is no real title available?)
- scientific article; zbMATH DE number 1088232 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- scientific article; zbMATH DE number 1759334 (Why is no real title available?)
- scientific article; zbMATH DE number 1418317 (Why is no real title available?)
- A Universally Composable Scheme for Electronic Cash
- A taxonomy of pairing-friendly elliptic curves
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Compact E-Cash
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Protocols for Set Membership and Range Proofs
- Efficient Two-Party Secure Computation on Committed Inputs
- Efficient concurrent zero-knowledge in the auxiliary string model
- Efficient proofs that a committed number lies in an interval
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- P-signatures and Noninteractive Anonymous Credentials
- Public Key Cryptography - PKC 2005
- Public Key Cryptography - PKC 2006
- Randomizable Proofs and Delegatable Anonymous Credentials
- Security in Communication Networks
- Simulatable VRFs with Applications to Multi-theorem NIZK
- Theory of Cryptography
Cited in
(13)- Transferable e-cash: a cleaner model and the first practical instantiation
- Universally Composable Adaptive Priced Oblivious Transfer
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- On the impossibility of structure-preserving deterministic primitives
- Lattice-based e-cash, revisited
- The price of verifiability: lower bounds for verifiable random functions
- QA-NIZK arguments of same opening for bilateral commitments
- Skipping the \(q\) in group signatures
- Verifiable random functions from standard assumptions
- Concurrently secure blind Schnorr signatures
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Simulatable verifiable random function from the LWE assumption
- Classical and quantum security of elliptic curve VRF, via relative indifferentiability
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)
