Compact E-Cash and Simulatable VRFs Revisited

DOI10.1007/978-3-642-03298-1_9zbMath1248.94051OpenAlexW2155917298MaRDI QIDQ3392907

Markulf Kohlweiss, Melissa Chase, Mira Belenkiy, 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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

QA-NIZK Arguments of Same Opening for Bilateral Commitments ⋮ Skipping the \(q\) in group signatures ⋮ Classical and quantum security of elliptic curve VRF, via relative indifferentiability ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Lattice-based e-cash, revisited ⋮ Simulatable verifiable random function from the LWE assumption ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Universally Composable Adaptive Priced Oblivious Transfer ⋮ Transferable e-cash: a cleaner model and the first practical instantiation ⋮ Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A taxonomy of pairing-friendly elliptic curves
• Randomizable Proofs and Delegatable Anonymous Credentials
• Efficient Protocols for Set Membership and Range Proofs
• Simulatable VRFs with Applications to Multi-theorem NIZK
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Compact E-Cash
• Efficient Two-Party Secure Computation on Committed Inputs
• P-signatures and Noninteractive Anonymous Credentials
• A Universally Composable Scheme for Electronic Cash
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Security in Communication Networks
• Public Key Cryptography - PKC 2005
• Theory of Cryptography
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Public Key Cryptography - PKC 2006

This page was built for publication: Compact E-Cash and Simulatable VRFs Revisited