( en | de | ru )

 

Disambiguation of "Yung, Moti"

Author of the publication

copydeleteadd this publication to your clipboard
Kleptography from Standard Assumptions and Applications.

, and . SCN, volume 6280 of Lecture Notes in Computer Science, page 271-290. Springer, (2010)

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. You can also use the button next to the name to display some publications already assigned to the person.

René Motika

Lew Motiloff

Boris Motik

Mahesh Motiramani

Lothar Motitschke

 

Other publications of authors with the same name

General Group Authentication Codes and Their Relation to Ünconditionally-Secure Signatures"., , and . Public Key Cryptography, volume 2947 of Lecture Notes in Computer Science, page 231-247. Springer, (2004)Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies., , and . Public Key Cryptography, volume 7778 of Lecture Notes in Computer Science, page 423-442. Springer, (2013)Adaptive Security for the Additive-Sharing Based Proactive RSA., , and . Public Key Cryptography, volume 1992 of Lecture Notes in Computer Science, page 240-263. Springer, (2001)Self-tallying Elections and Perfect Ballot Secrecy., and . Public Key Cryptography, volume 2274 of Lecture Notes in Computer Science, page 141-158. Springer, (2002)From Mental Poker to Core Business: Why and How to Deploy Secure Computation Protocols?. ACM Conference on Computer and Communications Security, page 1-2. ACM, (2015)Breaking and Repairing Asymmetric Public-Key Traitor Tracing., and . Digital Rights Management Workshop, volume 2696 of Lecture Notes in Computer Science, page 32-50. Springer, (2002)Forward-secure signatures in untrusted update environments: efficient and generic constructions., , and . ACM Conference on Computer and Communications Security, page 266-275. ACM, (2007)Secure Computation Protocol: A Technology for Our Time.. ICETE (1), page 19. ScitePress, (2020)Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract)., , and . EUROCRYPT, volume 434 of Lecture Notes in Computer Science, page 192-195. Springer, (1989)Characterization of Security Notions for Probabilistic Private-Key Encryption., and . J. Cryptol., 19 (1): 67-95 (2006)