( en | de | ru )

 

Disambiguation of "Yung, Moti"

Author of the publication

copydeleteadd this publication to your clipboard
Image Density is Complete for Non-Interactive-SZK (Extended Abstract).

, , , and . ICALP, volume 1443 of Lecture Notes in Computer Science, page 784-795. Springer, (1998)

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

The TrustedFlow (TM) Protocol-Idiosyncratic Signatures for Authenticated Execution., , and . IAW, page 288-291. IEEE, (2003)Friendly Observers Ease Off-Line E-Cash., , and . CARDIS, volume 180 of IFIP Conference Proceedings, page 3-18. Kluwer, (2000)Cryptography and decoding Reed-Solomon codes as a hard problem., and . ICITS, page 48. IEEE, (2005)Cryptography as an Attack Technology: Proving the RSA/Factoring Kleptographic Attack., and . The New Codebreakers, volume 9100 of Lecture Notes in Computer Science, page 243-255. Springer, (2016)Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions., , and . ICALP, volume 55 of LIPIcs, page 30:1-30:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Special Issue on Advanced Persistent Threat., , , and . Future Gener. Comput. Syst., (2018)Access regulation mechanism for switch-based LAN., and . Comput. Networks, 31 (5): 505-518 (1999)Approximating Max-Min Fair Rates via Distributed Local Scheduling with Partial Information., , and . INFOCOM, page 928-936. IEEE Computer Society, (1996)Cryptographic Hardness based on the Decoding of Reed-Solomon Codes., and . IACR Cryptology ePrint Archive, (2007)"Metaproofs" (and their Cryptographic Applications)., and . IACR Cryptology ePrint Archive, (2012)