# From Laconic Zero-Knowledge to Public-Key Cryptography

@article{Berman2017FromLZ,
title={From Laconic Zero-Knowledge to Public-Key Cryptography},
author={Itay Berman and Akshay Degwekar and Ron D. Rothblum and Prashant Nalini Vasudevan},
journal={Electron. Colloquium Comput. Complex.},
year={2017},
volume={24},
pages={172}
}
• Published 19 August 2018
• Computer Science, Mathematics
• Electron. Colloquium Comput. Complex.
Since its inception, public-key encryption ($$\mathsf {PKE}$$) has been one of the main cornerstones of cryptography. A central goal in cryptographic research is to understand the foundations of public-key encryption and in particular, base its existence on a natural and generic complexity-theoretic assumption. An intriguing candidate for such an assumption is the existence of a cryptographically hard language Open image in new window .
10 Citations
Minicrypt Primitives with Algebraic Structure and Applications
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2019
Algebraic structure lies at the heart of Cryptomania as we know it. An interesting question is the following: instead of building (Cryptomania) primitives from concrete assumptions, can we build them
Symmetric Primitives with Structured Secrets
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2019
This paper focuses on a special class of primitives that allow an untrusted party to transform a ciphertext encrypted under one key to a Ciphertext under another key, using some auxiliary information that does not leak the underlying data.
On Succinct Arguments and Witness Encryption from Groups
• Mathematics, Computer Science
CRYPTO
• 2020
The state-of-the-art in succinctness is due to Groth (Eurocrypt 2016) who constructed a SNARG from bilinear maps where the proof consists of just 3 group elements.
Towards Malicious Security of Private Coin Honest Verifier Zero Knowledge for NP via Witness Encryption
• Jingyue Yu
• Computer Science, Mathematics
Inscrypt
• 2018
A three-round zero knowledge protocol with super-polynomial simulation (or zero knowledge in $$\mathcal {F}_{OT}$$-hybrid model) for NP, assuming the existence of Yao’s garble circuit and two-message oblivious transfer protocol (or ideal oblivious transfer).
Cryptography from Information Loss
• Computer Science, Mathematics
ITCS
• 2020
This work defines a non-standard one-sided notion of average-case hardness, which is the notion of hardness used in the second result above, that may be of independent interest.
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers
• Computer Science, Mathematics
Electron. Colloquium Comput. Complex.
• 2021
This work constructs a public-coin maliciousverifier SZK protocol for batch verification of NISZK, and the communication complexity of this protocol is ( k + poly(m) ) · polylog(k,m).
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
• Computer Science
IACR Cryptol. ePrint Arch.
• 2018
In this paper, the CDS complexity of a predicate f is related to its communication complexity under various communication games and it is shown that allowing for imperfect correctness can significantly reduce communication – a seemingly new phenomenon in the context of information-theoretic cryptography.
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs
• Mathematics, Computer Science
IACR Cryptol. ePrint Arch.
• 2018
This work focuses on simultaneously minimizing the proof size and the prover complexity of SNARGs, and defines a SNARG as quasi-optimally succinct if its proof length is $$\widetilde{O}(\lambda )$$, and that it is quasi-optimal if moreover, its provers complexity is only polylogarithmically greater than the running time of the classical $$\mathsf {NP}$$ prover.
Batch Verification for Statistical Zero Knowledge Proofs
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2020
It is shown that, for every problem Π, there exists an honest-verifier SZK protocol for batch verification of k instances, with communication complexity poly(n)+k ·poly(log n, log k), where poly refers to a fixed polynomial that depends only on Π (and not on k).
Succinct Interactive Oracle Proofs: Applications and Limitations
• Computer Science, Mathematics
IACR Cryptol. ePrint Arch.
• 2022
This work studies succinct IOPs, which are IOP s in which the communication complexity is polynomial (or even linear) in the original witness, and shows both new applications, and limitations, for succinct IO s.

## References

SHOWING 1-10 OF 54 REFERENCES
Limits of Provable Security for Homomorphic Encryption
• Mathematics, Computer Science
CRYPTO
• 2012
We show that public-key bit encryption schemes which support weak (i.e., compact) homomorphic evaluation of any sufficiently “sensitive” collection of functions cannot be proved message
Public-key cryptography from different assumptions
• Computer Science, Mathematics
STOC '10
• 2010
This paper constructs new public-key encryption schemes based on new hardness-on-average assumptions for natural combinatorial NP-hard optimization problems, and gets the first noisy-equations type public key scheme in which the noise rate is higher than one over the square root of the number of equations.
Probabilistic encryption & how to play mental poker keeping secret all partial information
• Computer Science, Mathematics
STOC '82
• 1982
This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the
Structure vs. Hardness Through the Obfuscation Lens
• Computer Science, Mathematics
CRYPTO
• 2016
Much of modern cryptography, starting from public-key encryption and going beyond, is based on the hardness of structured problems like factoring, discrete log or finding short lattice vectors that are in low complexity classes such as NP or statistical zero-knowledge (SZK).
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
• Computer Science, Mathematics
EUROCRYPT
• 2002
A general framework that allows one to construct secure encryption schemes in a generic fashion from language membership problems that satisfy certain technical requirements is introduced, as does the Cramer-Shoup scheme based on the Decision Diffie-Hellman assumption.
Probabilistic Encryption
• Computer Science, Mathematics
J. Comput. Syst. Sci.
• 1984
Homomorphic Encryption: from Private-Key to Public-Key
• R. Rothblum
• Mathematics, Computer Science
Electron. Colloquium Comput. Complex.
• 2010
We show how to transform any additively homomorphic private-key encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that the length of a homomorphically
Cryptography from Learning Parity with Noise
This talk will be a gentle introduction to provable security using simple LPN based schemes as examples, starting from pseudorandom generators and symmetric key encryption, over secret-key authentication protocols, and, if time admits, touching on recent constructions of public-key identification, commitments and zero-knowledge proofs.
Oblivious-transfer amplification
An optimal proof for the standard protocol to realize unconditionally secure OT from a weak variant of OT called universal OT is given, for which a malicious receiver can virtually obtain any possible information he wants, as long as he does not get all the information.
New directions in cryptography
• Computer Science, Mathematics
IEEE Trans. Inf. Theory
• 1976
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.