( en | de | ru )

 

Disambiguation of "Ben-Sasson, Eli"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution).

, , , , and . IACR Cryptology ePrint Archive, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sasson Sassonov

Eli Schachtel

Eli Kolundžija

Victoria Eli

Michael Eli

 

Other publications of authors with the same name

Limits on the rate of locally testable affine-invariant codes., and . Electron. Colloquium Comput. Complex., (2010)Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic., and . Electron. Colloquium Comput. Complex., (2011)Breaking local symmetries can dramatically reduce the length of propositional refutations., , and . Electron. Colloquium Comput. Complex., (2010)Subspace Polynomials and Cyclic Subspace Codes., , , and . CoRR, (2014)Short Proofs are Narrow - Resolution Made Simple., and . STOC, page 517-526. ACM, (1999)Size space tradeoffs for resolution.. STOC, page 457-464. ACM, (2002)Limits on the Rate of Locally Testable Affine-Invariant Codes., and . APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, page 412-423. Springer, (2011)Symmetric LDPC Codes are not Necessarily Locally Testable., , , and . CCC, page 55-65. IEEE Computer Society, (2011)Short Proofs Are Narrow - Resolution Made Simple (Abstract)., and . CCC, page 2. IEEE Computer Society, (1999)The Complexity of User Retention., and . ITCS, volume 124 of LIPIcs, page 12:1-12:30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)