( en | de | ru )

 

Disambiguation of "Kalai, Yael Tauman"

Author of the publication

copydeleteadd this publication to your clipboard
Classical Commitments to Quantum States.

, , , and . IACR Cryptol. ePrint Arch., (2024)

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

Probabilistically Checkable Arguments., and . CRYPTO, volume 5677 of Lecture Notes in Computer Science, page 143-159. Springer, (2009)On Obfuscation with Random Oracles., , and . TCC (2), volume 9015 of Lecture Notes in Computer Science, page 456-467. Springer, (2015)Fully Homomorphic NIZK and NIWI Proofs., , , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 356-385. Springer, (2019)Delegation with Updatable Unambiguous Proofs and PPAD-Hardness., , and . CRYPTO (3), volume 12172 of Lecture Notes in Computer Science, page 652-673. Springer, (2020)On the (In)security of the Fiat-Shamir Paradigm., and . FOCS, page 102-113. IEEE Computer Society, (2003)Delegating RAM Computations., and . TCC (B2), volume 9986 of Lecture Notes in Computer Science, page 91-118. (2016)Delegating computation: interactive proofs for muggles., , and . STOC, page 113-122. ACM, (2008)Constructive Post-Quantum Reductions., , and . CRYPTO (3), volume 13509 of Lecture Notes in Computer Science, page 654-683. Springer, (2022)Attacks on the Fiat-Shamir paradigm and program obfuscation.. Massachusetts Institute of Technology, Cambridge, MA, USA, (2006)ndltd.org (oai:dspace.mit.edu:1721.1/34026).Non-interactive delegation and batch NP verification from standard computational assumptions., , and . STOC, page 474-482. ACM, (2017)