( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
From Obfuscation to the Security of Fiat-Shamir for Proofs.

, , и . CRYPTO (2), том 10402 из Lecture Notes in Computer Science, стр. 224-251. Springer, (2017)

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

 

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

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)On Obfuscation with Random Oracles., , и . TCC (2), том 9015 из Lecture Notes in Computer Science, стр. 456-467. Springer, (2015)Probabilistically Checkable Arguments., и . CRYPTO, том 5677 из Lecture Notes in Computer Science, стр. 143-159. Springer, (2009)Delegating RAM Computations., и . TCC (B2), том 9986 из Lecture Notes in Computer Science, стр. 91-118. (2016)Delegating computation: interactive proofs for muggles., , и . STOC, стр. 113-122. ACM, (2008)Black-Box Circular-Secure Encryption beyond Affine Functions., , и . TCC, том 6597 из Lecture Notes in Computer Science, стр. 201-218. Springer, (2011)Cryptographic Assumptions: A Position Paper., и . TCC (A1), том 9562 из Lecture Notes in Computer Science, стр. 505-522. Springer, (2016)Low Error Efficient Computational Extractors in the CRS Model., , и . EUROCRYPT (1), том 12105 из Lecture Notes in Computer Science, стр. 373-402. Springer, (2020)