( en | de | ru )

 

Disambiguation of "Yung, Moti"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary.

, , and . ESA, volume 979 of Lecture Notes in Computer Science, page 523-537. Springer, (1995)

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

Efficient Traceable Signatures in the Standard Model., and . Pairing, volume 5671 of Lecture Notes in Computer Science, page 187-205. Springer, (2009)Towards Signature-Only Signature Schemes., and . ASIACRYPT, volume 1976 of Lecture Notes in Computer Science, page 97-115. Springer, (2000)Group Encryption., , and . ASIACRYPT, volume 4833 of Lecture Notes in Computer Science, page 181-199. Springer, (2007)On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications., , , , , , , , and . IACR Cryptology ePrint Archive, (2019)Kleptography from Standard Assumptions and Applications., and . SCN, volume 6280 of Lecture Notes in Computer Science, page 271-290. Springer, (2010)Secure and Efficient Off-Line Digital Money (Extended Abstract)., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 265-276. Springer, (1993)Agent Rendezvous: A Dynamic Symmetry-Breaking Problem., and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 610-621. Springer, (1996)A Subliminal Channel in Secret Block Ciphers., and . Selected Areas in Cryptography, volume 3357 of Lecture Notes in Computer Science, page 198-211. Springer, (2004)Zero-knowledge proofs of decision power: new protocols and optimal round-complexity., , and . ICICS, volume 1334 of Lecture Notes in Computer Science, page 17-27. Springer, (1997)Incremental Unforgeable Encryption., , and . FSE, volume 2355 of Lecture Notes in Computer Science, page 109-124. Springer, (2001)