Bicameral and auditably private signatures
From MaRDI portal
Publication:6562571
Recommendations
Cites work
- A framework for practical anonymous credentials from lattices
- A new paradigm for public key identification
- Adaptive oblivious transfer with access control from lattice assumptions
- Advances in Cryptology - EUROCRYPT 2004
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Attribute-based signatures
- Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Constant-size group signatures from lattices
- Conversions among several classes of predicate encryption and applications to ABE with various compactness tradeoffs
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Functional encryption: definitions and challenges
- Functional signatures and pseudorandom functions
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Group Signatures
- Group signatures with message-dependent opening
- Group signatures without NIZK: from lattices in the standard model
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 2009983 (Why is no real title available?)
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- Improved short lattice signatures in the standard model
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Lattice signature with efficient protocols, application to anonymous credentials
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Multimodal private signatures
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On Signatures of Knowledge
- On the Non-malleability of the Fiat-Shamir Transform
- Perfect Non-interactive Zero Knowledge for NP
- Policy-based signature scheme from lattices
- Policy-Based Signatures
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Ring signatures: Stronger definitions, and constructions without random oracles
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- The Knowledge Complexity of Interactive Proof Systems
- Traceable Ring Signature
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Zero-knowledge proofs for committed symmetric Boolean functions
Cited in
(3)
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)