Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
From MaRDI portal
Publication:5087262
DOI10.1007/978-3-030-97121-2_12zbMath1492.94098MaRDI QIDQ5087262
Muhammed F. Esgin, Ron Steinfeld, Raymond K. Zhao
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_12
lattice; zero-knowledge; accountable ring signature; auditable ringct; verifiable partially-decryptable commitment
94A60: Cryptography
Cites Work
- Unnamed Item
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- More efficient commitments from structured lattice assumptions
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- Auto-recoverable auto-certifiable cryptosystems
- Advances in Cryptology - CRYPTO 2003
- One-Shot Verifiable Encryption from Lattices
- On lattices, learning with errors, random linear codes, and cryptography