( en | de | ru )

 

Disambiguation of "Yung, Moti"

Author of the publication

copydeleteadd this publication to your clipboard
Secret Swarm UnitReactive k-Secret Sharing.

, , and . INDOCRYPT, volume 4859 of Lecture Notes in Computer Science, page 123-137. Springer, (2007)

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

Bandwidth-Optimal Kleptographic Attacks., and . CHES, volume 2162 of Lecture Notes in Computer Science, page 235-250. Springer, (2001)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)Lower Bounds for Pseudorandom Number Generators, , and . FOCS, page 242-247. IEEE Computer Society, (1989)A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract), , and . FOCS, page 360-371. IEEE Computer Society, (1985)Configuration and performance issues in the MetaNet design., , and . LCN, page 291-299. IEEE Computer Society, (1993)A Concise Bounded Anonymous Broadcast Yielding Combinatorial Trace-and-Revoke Schemes., , and . ACNS (2), volume 12147 of Lecture Notes in Computer Science, page 145-164. Springer, (2020)Correcting Subverted Random Oracles., , , and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 241-271. Springer, (2018)Resolving Message Complexity of Byzantine Agreement and beyond., , and . FOCS, page 724-733. IEEE Computer Society, (1995)Characterization of Security Notions for Probabilistic Private-Key Encryption., and . J. Cryptol., 19 (1): 67-95 (2006)