( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Standard Model Time-Lock Puzzles: Defining Security and Constructing via Composition.

, , , и . IACR Cryptol. ePrint Arch., (2023)

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.

René Motika

Lew Motiloff

Boris Motik

Mahesh Motiramani

Lothar Motitschke

 

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

Key Evolution Systems in Untrusted Update Environments., , и . ACM Trans. Inf. Syst. Secur., 13 (4): 37:1-37:34 (2010)Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract)., и . PODC, стр. 52-62. ACM, (1986)Coins, Weights and Contention in Balancing Networks., , и . PODC, стр. 193-205. ACM, (1994)Witness-Based Cryptographic Program Checking and Applications (an Announcement)., , и . PODC, стр. 211. ACM, (1996)Witness-Based Cryptographic Program Checking and Robust Function Sharing., , и . STOC, стр. 499-508. ACM, (1996)Revokable and Versatile Electronic Money (extended abstract)., и . ACM Conference on Computer and Communications Security, стр. 76-87. ACM, (1996)Cryptography and decoding Reed-Solomon codes as a hard problem., и . ICITS, стр. 48. IEEE, (2005)Cryptography as an Attack Technology: Proving the RSA/Factoring Kleptographic Attack., и . The New Codebreakers, том 9100 из Lecture Notes in Computer Science, стр. 243-255. Springer, (2016)Approximating Max-Min Fair Rates via Distributed Local Scheduling with Partial Information., , и . INFOCOM, стр. 928-936. IEEE Computer Society, (1996)Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions., , и . ICALP, том 55 из LIPIcs, стр. 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)