( en | de | ru )

 

Disambiguation of "Yung, Moti"

Author of the publication

copydeleteadd this publication to your clipboard
Adaptively-Secure Optimal-Resilience Proactive RSA.

, , and . ASIACRYPT, volume 1716 of Lecture Notes in Computer Science, page 180-194. Springer, (1999)

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

Linearly homomorphic structure-preserving signatures and their applications., , , and . Des. Codes Cryptogr., 77 (2-3): 441-477 (2015)Constant-Round Concurrently-Secure rZK in the (Real) Bare Public-Key Model, and . Electron. Colloquium Comput. Complex., (2005)On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications., , , and . SSS, volume 13046 of Lecture Notes in Computer Science, page 350-364. Springer, (2021)Elastic block ciphers: the basic design., , and . AsiaCCS, page 350-352. ACM, (2007)Fourth-factor authentication: somebody you know., , , , and . CCS, page 168-178. ACM, (2006)End-to-Same-End Encryption: Modularly Augmenting an App with an Efficient, Portable, and Blind Cloud Storage., , , and . USENIX Security Symposium, page 2353-2370. USENIX Association, (2022)Subvert KEM to Break DEM: Practical Algorithm-Substitution Attacks on Public-Key Encryption., , and . ASIACRYPT (2), volume 12492 of Lecture Notes in Computer Science, page 98-128. Springer, (2020)Threshold Cryptosystems Based on Factoring., and . ASIACRYPT, volume 2501 of Lecture Notes in Computer Science, page 192-205. Springer, (2002)Anonymity 2.0 - X.509 Extensions Supporting Privacy-Friendly Authentication., , , and . Cryptology and Network Security, volume 4856 of Lecture Notes in Computer Science, page 265-281. Springer, (2007)Fast Algorithms for Edge-Coloring Planar Graphs., and . J. Algorithms, 10 (1): 35-51 (1989)