Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
type: Item
instance of: scholarly article
title: Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
zbMATH Open document ID: 1332.94066
author: N. E. Zubov
published in: Journal of Cryptology
publication date: 2016-01-11T00:00:00Z
full work available at URL: https://discovery.ucl.ac.uk/id/eprint/1474844/
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 6528671
zbMATH Keywords: non-interactive zero-knowledge proofs
zbMATH Keywords: fully homomorphic encryption
zbMATH Keywords: hybrid encryption
zbMATH Keywords: secure function evaluation
zbMATH Keywords: minimizing communication
Wikidata QID: Q122928188
MaRDI profile type: Publication
OpenAlex ID: W2046763185
cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: Packed Ciphertexts in LWE-Based Homomorphic Encryption
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Compact Group Signatures Without Random Oracles
cites work: Ring Signatures of Sub-linear Size Without Random Oracles
cites work: Q4279688
cites work: Q4783745
cites work: Q4440437
cites work: Nonmalleable Cryptography
cites work: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
cites work: Fully homomorphic encryption using ideal lattices
cites work: i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
cites work: On the complexity of interactive proofs with bounded communication
cites work: On the Composition of Zero-Knowledge Proof Systems
cites work: Definitions and properties of zero-knowledge proof systems
cites work: On interactive proofs with a laconic prover
cites work: Q3549691
cites work: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
cites work: Short Non-interactive Zero-Knowledge Proofs
cites work: Cryptography in the Multi-string Model
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: A Pseudorandom Generator from any One-way Function
cites work: Zero-Knowledge Proofs from Secure Multiparty Computation
cites work: Interactive PCP
cites work: An efficient noninteractive zero-knowledge proof system for NP with general assumptions
cites work: Communication preserving protocols for secure function evaluation
cites work: Faster Fully Homomorphic Encryption
cites work: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
cites work: Fully Homomorphic Encryption over the Integers
DOI: 10.1007/S00145-014-9184-Y
description: scientific article; zbMATH DE number 6528671