Hadas Zeilberger - Google Scholar

Get my own profile

Cited by

	All	Since 2019
Citations	18	18
h-index	1	1
i10-index	1	1

Public access

1 article

1 article

available

not available

Based on funding mandates

Co-authors

Binyi ChenStanford UniversityVerified email at stanford.edu
Claudia DiazKU LeuvenVerified email at esat.kuleuven.be
Ron RothblumTechnionVerified email at cs.technion.ac.il
iness ben guiratKU LeuvenVerified email at esat.kuleuven.be
Nicolas ReschAssistant Professor, University of AmsterdamVerified email at uva.nl

Hadas Zeilberger

Hadas Zeilberger

Yale University

Verified email at yale.edu

Cryptography Zero-knowledge Proofs Coding Theory Privacy


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes H Zeilberger, B Chen, B Fisch Annual International Cryptology Conference, 138-169, 2024	16	2024
Blaze: Fast SNARKs from Interleaved RAA Codes M Brehm, B Chen, B Fisch, N Resch, RD Rothblum, H Zeilberger Cryptology ePrint Archive, 2024	1	2024
Traffic Analysis by Adversaries with Partial Visibility IB Guirat, C Diaz, K Eldefrawy, H Zeilberger European Symposium on Research in Computer Security, 338-358, 2023	1	2023
Khatam: Reducing the Communication Complexity of Code-Based SNARKs H Zeilberger Cryptology ePrint Archive, 2024		2024

The system can't perform the operation now. Try again later.

Articles 1–4