( en | de | ru )

 

Disambiguation of "Kalai, Yael Tauman"

Author of the publication

copydeleteadd this publication to your clipboard
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE.

, , , and . STOC, page 708-721. ACM, (2021)

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.

Yael Hegerfeldt

Yaël Champclaux

Hristos Kalaitzis

Dimitrios Kalaitzis

Nikolaos Kalaitzis

 

Other publications of authors with the same name

Delegation with Updatable Unambiguous Proofs and PPAD-Hardness., , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 652-673. Springer, (2020)Delegating RAM Computations., and . TCC (B2), volume 9986 of Lecture Notes in Computer Science, page 91-118. (2016)On Obfuscation with Random Oracles., , and . TCC (2), volume 9015 of Lecture Notes in Computer Science, page 456-467. Springer, (2015)Probabilistically Checkable Arguments., and . CRYPTO, volume 5677 of Lecture Notes in Computer Science, page 143-159. Springer, (2009)Fully Homomorphic NIZK and NIWI Proofs., , , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 356-385. Springer, (2019)On the (In)security of the Fiat-Shamir Paradigm., and . FOCS, page 102-113. IEEE Computer Society, (2003)Fast Interactive Coding against Adversarial Noise., , and . J. ACM, 61 (6): 35:1-35:30 (2014)A Parallel Repetition Theorem for Leakage Resilience., and . TCC, volume 7194 of Lecture Notes in Computer Science, page 248-265. Springer, (2012)Securing Circuits and Protocols against 1/poly(k) Tampering Rate., and . TCC, volume 8349 of Lecture Notes in Computer Science, page 540-565. Springer, (2014)Leakage-Resilient Coin Tossing., , and . DISC, volume 6950 of Lecture Notes in Computer Science, page 181-196. Springer, (2011)