Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications

DOI10.1007/978-3-030-97121-2_12MaRDI QIDQ5087262zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

latticezero-knowledgeaccountable ring signatureauditable ringctverifiable partially-decryptable commitment

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Auto-recoverable auto-certifiable cryptosystems
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Group Signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Lattice signatures without trapdoors
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• More efficient commitments from structured lattice assumptions
• On lattices, learning with errors, random linear codes, and cryptography
• One-out-of-many proofs: or how to leak a secret and spend a coin
• One-shot verifiable encryption from lattices
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Short lattice-based one-out-of-many proofs and applications to ring signatures
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(2)

• More efficient commitments from structured lattice assumptions
• A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing

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)