A generic construction of an anonymous reputation system and instantiations from lattices
From MaRDI portal
Publication:6562575
DOI10.1007/978-981-99-8724-5_13zbMATH Open1543.94707MaRDI QIDQ6562575
Laurens Porzenheim, Jan Bobolz, Johannes Blömer
Publication date: 26 June 2024
encryption schemesdigital signaturesnon-interactive zero-knowledge proofslinking indistinguishable tags
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- Constant-size group signatures from lattices
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Issuer-hiding attribute-based credentials
- Online-extractability in the quantum random-oracle model
- Practical, anonymous, and publicly linkable universally-composable reputation systems
- Aurora: transparent succinct arguments for R1CS
- Efficient Fully Structure-Preserving Signatures for Large Messages
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- On the (In)Security of SNARKs in the Presence of Oracles
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- Signatures of Reputation
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A Toolkit for Ring-LWE Cryptography
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- On Signatures of Knowledge
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- Lattice signature with efficient protocols, application to anonymous credentials
- A framework for practical anonymous credentials from lattices
- Fiat-Shamir transformation of multi-round interactive proofs
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model)
Related Items (1)
This page was built for publication: A generic construction of an anonymous reputation system and instantiations from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562575)
