Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
From MaRDI portal
Publication:5087262
DOI10.1007/978-3-030-97121-2_12zbMATH Open1492.94098OpenAlexW4214722479MaRDI QIDQ5087262FDOQ5087262
Authors: 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
Recommendations
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Efficient certificateless encryption schemes from lattices
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Efficient multi-party concurrent signature from lattices
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- More efficient commitments from structured lattice assumptions
- One-shot verifiable encryption from lattices
latticezero-knowledgeaccountable ring signatureauditable ringctverifiable partially-decryptable commitment
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Lattice signatures without trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
- Title not available (Why is that?)
- Group Signatures
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Advances in Cryptology - CRYPTO 2003
- More efficient commitments from structured lattice assumptions
- One-out-of-many proofs: or how to leak a secret and spend a coin
- One-shot verifiable encryption from lattices
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- 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
- Auto-recoverable auto-certifiable cryptosystems
Cited In (2)
This page was built for publication: Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087262)
