We show that the space-bounded Statistical Zero Knowledge classes SZK_L and NISZK_L are surprisingly robust, in that the power of the verifier and simulator can be strengthened or weakened without affecting the resulting class. Coupled with other recent characterizations of these classes [Eric Allender et al., 2023], this can be viewed as lending support to the conjecture that these classes may coincide with the non-space-bounded classes SZK and NISZK, respectively
AbstractResults on random oracles typically involve showing that a class {ifX:P(X)} has Lebesgue mea...
We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, w...
Concurrent non-malleable zero-knowledge (CNMZK) protocols are zero-knowledge protocols that provides...
We extend the study of non-interactive statistical zero-knowledge proofs. Our main focus is to compa...
We extend the study of non-interactive statistical zero-knowledge proofs. Our main focus is to compa...
We investigate the complexity of problems that admit perfect zero-knowledge interactive protocols an...
Zero knowledge proof systems have been widely studied in cryptography. In the statistical setting, t...
We present an unconditional transformation from any honest-verifier statistical zero-knowledge (HVSZ...
We continue the study of statistical zero-knowledge (SZK) proofs, both interactive and noninteractiv...
We present an unconditional transformation from any honest-verifier statistical zero-knowledge (HVSZ...
A Zero-Knowledge PCP (ZK-PCP) is a randomized PCP such that the view of any (perhaps cheating) effic...
A version of time-bounded Kolmogorov complexity, denoted KT, has received attention in the past seve...
In this paper we propose a definition for honest verifier quantum statistical zero-knowledge interac...
AbstractThis paper solves several fundamental open problems about statistical zero-knowledge interac...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
AbstractResults on random oracles typically involve showing that a class {ifX:P(X)} has Lebesgue mea...
We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, w...
Concurrent non-malleable zero-knowledge (CNMZK) protocols are zero-knowledge protocols that provides...
We extend the study of non-interactive statistical zero-knowledge proofs. Our main focus is to compa...
We extend the study of non-interactive statistical zero-knowledge proofs. Our main focus is to compa...
We investigate the complexity of problems that admit perfect zero-knowledge interactive protocols an...
Zero knowledge proof systems have been widely studied in cryptography. In the statistical setting, t...
We present an unconditional transformation from any honest-verifier statistical zero-knowledge (HVSZ...
We continue the study of statistical zero-knowledge (SZK) proofs, both interactive and noninteractiv...
We present an unconditional transformation from any honest-verifier statistical zero-knowledge (HVSZ...
A Zero-Knowledge PCP (ZK-PCP) is a randomized PCP such that the view of any (perhaps cheating) effic...
A version of time-bounded Kolmogorov complexity, denoted KT, has received attention in the past seve...
In this paper we propose a definition for honest verifier quantum statistical zero-knowledge interac...
AbstractThis paper solves several fundamental open problems about statistical zero-knowledge interac...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
AbstractResults on random oracles typically involve showing that a class {ifX:P(X)} has Lebesgue mea...
We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, w...
Concurrent non-malleable zero-knowledge (CNMZK) protocols are zero-knowledge protocols that provides...