From post

It Wasn't Me! - Repudiability and Claimability of Ring Signatures.

, и . CRYPTO (3), том 11694 из Lecture Notes in Computer Science, стр. 159-190. Springer, (2019)

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.

 

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

Cryptographically blinded games: leveraging players' limitations for equilibria and profit., и . EC, стр. 207-208. ACM, (2014)How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts., , , и . ITCS, том 124 из LIPIcs, стр. 42:1-42:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Fully Deniable Interactive Encryption., , и . CRYPTO (1), том 12170 из Lecture Notes in Computer Science, стр. 807-835. Springer, (2020)The Superlinearity Problem in Post-quantum Blockchains., и . FC (1), том 13950 из Lecture Notes in Computer Science, стр. 200-217. Springer, (2023)Cryptography, Trust and Privacy: It's Complicated., , и . CSLAW, стр. 167-179. ACM, (2022)Data structures meet cryptography: 3SUM with preprocessing., , , , и . STOC, стр. 294-307. ACM, (2020)SpaceMint: A Cryptocurrency Based on Proofs of Space., , , , , и . Financial Cryptography, том 10957 из Lecture Notes in Computer Science, стр. 480-499. Springer, (2018)It Wasn't Me! - Repudiability and Claimability of Ring Signatures., и . CRYPTO (3), том 11694 из Lecture Notes in Computer Science, стр. 159-190. Springer, (2019)Practical Accountability of Secret Processes., , , , и . USENIX Security Symposium, стр. 657-674. USENIX Association, (2018)Towards Optimally Efficient Secret-Key Authentication from PRG., и . IACR Cryptology ePrint Archive, (2014)