Verifiable decryption in the head
From MaRDI portal
Publication:6108795
DOI10.1007/978-3-031-22301-3_18zbMath1527.94041OpenAlexW3173798724MaRDI QIDQ6108795
No author found.
Publication date: 26 July 2023
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://hal-cnrs.archives-ouvertes.fr/hal-03913553
implementationzero-knowledge prooflattice-based cryptoMPC-in-the-headverifiable decryptiondistributed decryption
Cites Work
- Unnamed Item
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- On the concrete hardness of learning with errors
- Overdrive: making SPDZ great again
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- More efficient commitments from structured lattice assumptions
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical product proofs for lattice commitments
- Aurora: transparent succinct arguments for R1CS
- Homomorphic secret sharing from lattices without FHE
- NFLlib: NTT-Based Fast Lattice Library
- (Leveled) fully homomorphic encryption without bootstrapping
- Spooky Encryption and Its Applications
- Lattice Signatures without Trapdoors
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Survey of Fast Exponentiation Methods
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- A Toolkit for Ring-LWE Cryptography
- Improved Lattice-Based Threshold Ring Signature Scheme
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Verifiable Decryption for Fully Homomorphic Encryption
This page was built for publication: Verifiable decryption in the head
