Bicameral and auditably private signatures
From MaRDI portal
Publication:6562571
DOI10.1007/978-981-99-8724-5_10zbMATH Open1543.94787MaRDI QIDQ6562571
Willy Susilo, Khoa Nguyen, Yanhong Xu, Partha Sarathi Roy
Publication date: 26 June 2024
Could not fetch data.
Cryptography (94A60) Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Policy-based signature scheme from lattices
- Ring signatures: Stronger definitions, and constructions without random oracles
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Constant-size group signatures from lattices
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- Zero-knowledge proofs for committed symmetric Boolean functions
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Group signatures without NIZK: from lattices in the standard model
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Conversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs
- Improved Short Lattice Signatures in the Standard Model
- On the Non-malleability of the Fiat-Shamir Transform
- Functional Encryption: Definitions and Challenges
- Attribute-Based Signatures
- A new paradigm for public key identification
- Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
- Perfect Non-interactive Zero Knowledge for NP
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Group Signatures
- Group Signatures with Message-Dependent Opening
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Advances in Cryptology - EUROCRYPT 2004
- Functional Signatures and Pseudorandom Functions
- Policy-Based Signatures
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Traceable Ring Signature
- On Signatures of Knowledge
- Adaptive oblivious transfer with access control from lattice assumptions
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Multimodal private signatures
- Lattice signature with efficient protocols, application to anonymous credentials
- A framework for practical anonymous credentials from lattices
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
Related Items (1)
This page was built for publication: Bicameral and auditably private signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562571)
