PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Ben-Sasson, Eli"

Author of the publication

copydeleteadd this publication to your clipboard
Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture.

, , , and . USENIX Security Symposium, page 781-796. USENIX Association, (2014)

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.

Maximilian Benn University of Stuttgart

Asset information requirement templates for the building information modelling-based provision of facility services in corporate real estate management. Universität Stuttgart, Stuttgart, Dissertation, (2024)

Prof. Dr. -Ing. Rudolf Eligehausen University of Stuttgart

Achim Benz University of Stuttgart

Tobias Bens University of Stuttgart

Sara Bender University of Stuttgart

 

Other publications of authors with the same name

Towards lower bounds on locally testable codes via density arguments., and . Computational Complexity, 21 (2): 267-309 (2012)Affine Dispersers from Subspace Polynomials., and . SIAM J. Comput., 41 (4): 880-914 (2012)Lower bounds for bounded depth Frege proofs via Pudlák-Buss games., and . ACM Trans. Comput. Log., 11 (3): 19:1-19:17 (2010)Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic., and . Electronic Colloquium on Computational Complexity (ECCC), (2011)Improved concrete efficiency and security analysis of Reed-Solomon PCPPs., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2016)Breaking local symmetries can dramatically reduce the length of propositional refutations., , and . Electronic Colloquium on Computational Complexity (ECCC), (2010)3CNF Properties are Hard to Test, , and . Electronic Colloquium on Computational Complexity (ECCC), (2003)A security analysis of Probabilistically Checkable Proofs., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2016)Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games, and . Electronic Colloquium on Computational Complexity (ECCC), (2003)Limits on the rate of locally testable affine-invariant codes., and . Electronic Colloquium on Computational Complexity (ECCC), (2010)