( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
One-Time Programs.

, , и . CRYPTO, том 5157 из Lecture Notes in Computer Science, стр. 39-56. Springer, (2008)

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.

Yael Hegerfeldt

Yaël Champclaux

Hristos Kalaitzis

Dimitrios Kalaitzis

Nikolaos Kalaitzis

 

Другие публикации лиц с тем же именем

Probabilistically Checkable Arguments., и . CRYPTO, том 5677 из Lecture Notes in Computer Science, стр. 143-159. Springer, (2009)On Obfuscation with Random Oracles., , и . TCC (2), том 9015 из Lecture Notes in Computer Science, стр. 456-467. Springer, (2015)Delegation with Updatable Unambiguous Proofs and PPAD-Hardness., , и . CRYPTO (3), том 12172 из Lecture Notes in Computer Science, стр. 652-673. Springer, (2020)Fully Homomorphic NIZK and NIWI Proofs., , , и . TCC (2), том 11892 из Lecture Notes in Computer Science, стр. 356-385. Springer, (2019)On the (In)security of the Fiat-Shamir Paradigm., и . FOCS, стр. 102-113. IEEE Computer Society, (2003)Delegating RAM Computations., и . TCC (B2), том 9986 из Lecture Notes in Computer Science, стр. 91-118. (2016)Non-signaling proofs with o(√ log n) provers are in PSPACE., и . STOC, стр. 1024-1037. ACM, (2020)On the Impossibility of Obfuscation with Auxiliary Input., и . FOCS, стр. 553-562. IEEE Computer Society, (2005)Formulas Resilient to Short-Circuit Errors., , и . FOCS, стр. 490-499. IEEE Computer Society, (2012)Delegating Computation: Interactive Proofs for Muggles., , и . Electron. Colloquium Comput. Complex., (2017)