( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE.

, , , и . STOC, стр. 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.

Yael Hegerfeldt

Yaël Champclaux

Hristos Kalaitzis

Dimitrios Kalaitzis

Nikolaos Kalaitzis

 

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

Fully Homomorphic NIZK and NIWI Proofs., , , и . TCC (2), том 11892 из Lecture Notes in Computer Science, стр. 356-385. Springer, (2019)Delegating RAM Computations., и . TCC (B2), том 9986 из Lecture Notes in Computer Science, стр. 91-118. (2016)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)On the (In)security of the Fiat-Shamir Paradigm., и . FOCS, стр. 102-113. IEEE Computer Society, (2003)How to delegate computations publicly., , и . STOC, стр. 1115-1124. ACM, (2019)Leaky Pseudo-Entropy Functions., , и . ICS, стр. 353-366. Tsinghua University Press, (2011)Delegating Computation: Interactive Proofs for Muggles., , и . Electron. Colloquium Comput. Complex., (2017)SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption., , и . EUROCRYPT (2), том 14005 из Lecture Notes in Computer Science, стр. 470-498. Springer, (2023)