Maliciously Circuit-Private FHE

DOI10.1007/978-3-662-44371-2_30zbMath1343.94075OpenAlexW342125610MaRDI QIDQ2874525

Beni Paskin-Cherniavsky, Rafail Ostrovsky, Anat Paskin-Cherniavsky

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_30

zbMATH Keywords

privacyfully homomorphic encryptioncomputing on encrypted datamalicious setting

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (24)

Compact ring signatures from learning with errors ⋮ Multi-theorem designated-verifier NIZK for QMA ⋮ Two-message statistically sender-private OT from LWE ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Privacy-preserving blueprints ⋮ Algebraic restriction codes and their applications ⋮ Credibility in private set membership ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Statistical security in two-party computation revisited ⋮ Statistically sender-private OT from LPN and derandomization ⋮ A new framework for quantum oblivious transfer ⋮ A framework for statistically sender private OT with optimal rate ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ The round complexity of quantum zero-knowledge ⋮ Rate-1 quantum fully homomorphic encryption ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Circuit-Private Multi-key FHE ⋮ Round-optimal secure multi-party computation ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ FHE Circuit Privacy Almost for Free ⋮ Spooky Encryption and Its Applications ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Homomorphic Encryption

This page was built for publication: Maliciously Circuit-Private FHE