Search for Author All Reviews
	Ben-Sasson, Eli     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       Scalable zero knowledge via cycles of elliptic curves Ben-Sasson E., Chiesa A., Tromer E., Virza M. Algorithmica 79(4): 1102-1160, 2017.  Type: Article The construction of zk-SNARKs, that is, zero-knowledge succinct non-interactive arguments of knowledge, is the subject of this paper. The reader should be aware that “succinct” is a relative term: the authors note t...... Dec 18 2017     Pseudorandom generators in propositional proof complexity Alekhnovich M., Ben-Sasson E., Razborov A., Wigderson A. SIAM Journal on Computing 34(1): 67-88, 2005.  Type: Article This paper studies the complexity of the inconsistent statement for a system of Boolean functions (S): g1(x1,...,xn)=...... Aug 4 2005     Short proofs are narrow--resolution made simple Ben-Sasson E., Wigderson A. Journal of the ACM 48(2): 149-169, 2001.  Type: Article The width of a resolution proof is defined as the maximum number of literals in any clause of the proof. The authors argue that width is an important attribute by which to study resolution proofs. In particular, this concept is related...... Jul 1 2001
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy