Verifiable Decryption for Fully Homomorphic Encryption

DOI10.1007/978-3-319-99136-8_19MaRDI QIDQ6108847zbMATH OpenOpenAlexFDO

Authors Fucai Luo, Kun Peng Wang

Publication date 30 June 2023

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99136-8_19

zbMATH Keywords

zero-knowledge proofsFHEverifiable decryptioncryptographically verifiable electionsecure medical computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Short discrete log proofs for FHE and ring-LWE ciphertexts
• Verifiable computation on outsourced encrypted data
• Fully homomorphic encryption using ideal lattices
• Cryptanalysis of Tran-Pang-Deng verifiable homomorphic encryption
• One-shot verifiable encryption from lattices

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• A new paradigm for public key identification
• Advances in Cryptology - CRYPTO 2003
• Amortization with fewer equations for proving knowledge of small secrets
• Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
• Bootstrapping for HElib
• Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
• Efficent receipt-free voting based on homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• FHEW: bootstrapping homomorphic encryption in less than a second
• Faster Bootstrapping with Polynomial Error
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with relatively small key and ciphertext sizes
• Generalized Compact Knapsacks Are Collision Resistant
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to prove knowledge of small secrets
• Lattice signatures without trapdoors
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• On ideal lattices and learning with errors over rings
• On ideal lattices and learning with errors over rings
• On the Amortized Complexity of Zero-Knowledge Protocols
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• One-shot verifiable encryption from lattices
• Predicting Lattice Reduction
• Progress in Cryptology - INDOCRYPT 2004
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash

Cited in

(12)

• Information Security and Cryptology - ICISC 2005
• scientific article; zbMATH DE number 6874618 (Why is no real title available?)
• Cryptanalysis of Tran-Pang-Deng verifiable homomorphic encryption
• Fully homomorphic encryption from the finite field isomorphism problem
• Unification modulo homomorphic encryption
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption
• Short discrete log proofs for FHE and ring-LWE ciphertexts
• Decentralized Evaluation of Quadratic Polynomials on Encrypted Data
• Fully homomorphic encryption in real world applications
• Homomorphic Encryption and Signatures from Vector Decomposition
• Verifiable decryption in the head

This page was built for publication: Verifiable Decryption for Fully Homomorphic Encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108847)