Moti Yung

Publications

• “A New Randomness Extraction Paradigm for Hybrid Encryption”, Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung, EUROCRYPT '09: Proceedings of the 28th Annual International Conference on Advances in Cryptology, 2009, pp. 590-609.
  [doi] [search]

• “A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks”, François-Xavier Standaert, Tal G. Malkin, Moti Yung, EUROCRYPT '09: Proceedings of the 28th Annual International Conference on Advances in Cryptology, 2009, pp. 443-461.
  [doi] [search]

• “Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs”, Debra L. Cook, Moti Yung, Angelos Keromytis, Information Security and Cryptology, 2009, pp. 157-180.
  [doi] [search]

• “Efficient Robust Private Set Intersection”, Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung, ACNS '09: Proceedings of the 7th International Conference on Applied Cryptography and Network Security, 2009, pp. 125-142.
  [doi] [search]

• “Efficient Traceable Signatures in the Standard Model”, Benoît Libert, Moti Yung, Pairing '09: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography, 2009, pp. 187-205.
  [doi] [search]

• “Efficient and secure authenticated key exchange using weak passwords”, Jonathan Katz, Rafail Ostrovsky, Moti Yung, J. ACM, vol. 57 (2009), pp. 1-39.
  [doi.acm.org] [search]

• “Elastic block ciphers: method, security and instantiations”, Debra L. Cook, Moti Yung, Angelos D. Keromytis, Int. J. Inf. Secur., vol. 8 (2009), pp. 211-231.
  [doi] [search]

• “Expecting the Unexpected: Towards Robust Credential Infrastructure”, Shouhuai Xu, Moti Yung, Financial Cryptography and Data Security, 2009, pp. 201-221.
  [doi] [search]

• “Key Evolution Systems in Untrusted Update Environments”, Benoît Libert, Jean-Jacques Quisquater, Moti Yung, Information Security and Cryptology, 2009, pp. 12-21.
  [doi] [search]

• “On the Portability of Generalized Schnorr Proofs”, Jan Camenisch, Aggelos Kiayias, Moti Yung, EUROCRYPT '09: Proceedings of the 28th Annual International Conference on Advances in Cryptology, 2009, pp. 425-442.
  [doi] [search]

• “Privacy-Preserving Information Markets for Computing Statistical Data”, Aggelos Kiayias, Bülent Yener, Moti Yung, Financial Cryptography and Data Security, 2009, pp. 32-50.
  [doi] [search]

• “Secure Function Collection with Sublinear Storage”, Maged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong-Sheng Zhou, ICALP '09: Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming, 2009, pp. 534-545.
  [doi] [search]

• “The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure”, Seung Geol Choi, Javier Herranz, Dennis Hofheinz, Jung Yeon Hwang, Eike Kiltz, Dong Hoon Lee, Moti Yung, Inf. Process. Lett., vol. 109 (2009), pp. 897-901.
  [doi] [search]

• “A block cipher based pseudo random number generator secure against side-channel key recovery”, Christophe Petit, François-Xavier Standaert, Olivier Pereira, Tal G. Malkin, Moti Yung, ASIACCS '08: Proceedings of the 2008 ACM symposium on Information, computer and communications security, pp. 56-65.
  [doi.acm.org] [search]

• “Does Physical Security of Cryptographic Devices Need a Formal Study? (Invited Talk)”, François-Xavier Standaert, Tal G. Malkin, Moti Yung, ICITS '08: Proceedings of the 3rd international conference on Information Theoretic Security, 2008, pp. 70-70.
  [doi] [search]

• “Fair Traceable Multi-Group Signatures”, Vicente Benjumea, Seung Geol Choi, Javier Lopez, Moti Yung, Financial Cryptography, 2008, pp. 231-246.
  [doi] [search]

• “Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers”, Debra L. Cook, Moti Yung, Angelos D. Keromytis, ACISP '08: Proceedings of the 13th Australasian conference on Information Security and Privacy, 2008, pp. 187-202.
  [doi] [search]

• “On the Evolution of User Authentication: Non-bilateral Factors”, Moti Yung, Information Security and Cryptology, Third SKLOIS Conference, Inscrypt 2007, 2008, pp. 5-10.
  [doi] [search]

• “Privacy Preserving Data Mining within Anonymous Credential Systems”, Aggelos Kiayias, Shouhuai Xu, Moti Yung, SCN '08: Proceedings of the 6th international conference on Security and Cryptography for Networks, 2008, pp. 57-76.
  [doi] [search]

• “Public-key traitor tracing from efficient decoding and unbounded enrollment: extended abstract”, Aggelos Kiayias, Moti Yung, DRM '08: Proceedings of the 8th ACM workshop on Digital rights management, 2008, pp. 9-18.
  [doi.acm.org] [search]

• “Real Electronic Cash Versus Academic Electronic Cash Versus Paper Cash (Panel Report)”, Jon Callas, Yvo Desmedt, Daniel Nagy, Akira Otsuka, Jean-Jacques Quisquater, Moti Yung, Financial Cryptography and Data Security, 2008, pp. 307-313.
  [doi] [search]

Prior Publications

• “Universal forgery of the identity-based sequential aggregate signature scheme”, Jung Yeon Hwang, Dong Hoon Lee, Moti Yung, ASIACCS '09: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, 2009, pp. 157-160.
  [doi.acm.org] [search]

• “A Timing-Resistant Elliptic Curve Backdoor in RSA”, Adam L. Young, Moti Yung, Information Security and Cryptology, Third SKLOIS Conference, Inscrypt 2007, 2008, pp. 427-441.
  [doi] [search]

• “Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice”, Aggelos Kiayias, Moti Yung, Des. Codes Cryptography, vol. 43 (2007), pp. 61-78.
  [doi] [search]

• “Decoding interleaved Reed-Solomon codes over noisy channels”, Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung, Theor. Comput. Sci., vol. 379 (2007), pp. 348-360.
  [doi] [search]

• “Elastic block ciphers: the basic design”, Debra Cook, Angelos Keromytis, Moti Yung, ASIACCS '07: Proceedings of the 2nd ACM symposium on Information, computer and communications security, 2007, pp. 350-352.
  [doi.acm.org] [search]

• “Forward-secure signatures in untrusted update environments: efficient and generic constructions”, Benoît Libert, Jean-Jacques Quisquater, Moti Yung, CCS '07: Proceedings of the 14th ACM conference on Computer and communications security, 2007, pp. 266-275.
  [doi.acm.org] [search]

• “Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model”, Moti Yung, Yunlei Zhao, EUROCRYPT '07: Proceedings of the 26th annual international conference on Advances in Cryptology, 2007, pp. 129-147.
  [doi] [search]

• “Scalable Protocols for Authenticated Group Key Exchange”, Jonathan Katz, Moti Yung, J. Cryptol., vol. 20 (2007), pp. 85-113.
  [doi] [search]

• “The Security of Elastic Block Ciphers Against Key-Recovery Attacks”, Debra L. Cook, Moti Yung, Angelos D. Keromytis, ISC '07: Proceedings of the 10th international conference on Information Security, 2007, pp. 89-103.
  [doi] [search]

• Applied Cryptography and Network Security: 4th International Conference, ACNS 2006, Singapore, June 6-9, 2006, Proceedings (Lecture Notes in Computer Science), Jianying Zhou, Moti Yung, Feng Bao, 2006.
  [search]

• “Characterization of Security Notions for Probabilistic Private-Key Encryption”, Jonathan Katz, Moti Yung, J. Cryptol., vol. 19 (2006), pp. 67-95.
  [doi] [search]

• Digital Rights Management: Technologies, Issues, Challenges and Systems (Lecture Notes in Computer Science), Reihaneh Safavi-Naini, Moti Yung, 2006.
  [search]

• “Fourth-factor authentication: somebody you know”, John Brainard, Ari Juels, Ronald L. Rivest, Michael Szydlo, Moti Yung, CCS '06: Proceedings of the 13th ACM conference on Computer and communications security, 2006, pp. 168-178.
  [doi.acm.org] [search]

• Information Security and Cryptology: First SKLOIS Conference, CISC 2005, Beijing, China, December 15-17, 2005, Proceedings (Lecture Notes in Computer Science), Dengguo Feng, Dongdai Lin, Moti Yung, 2006.
  [search]

• Information Security and Cryptology: Second SKLOIS Conference, Inscrypt 2006Beijing, China, November 29 - December 1, 2006Proceedings (Lecture Notes in Computer Science), Helger Lipmaa, Moti Yung, Donghai Lin, 2006.
  [search]

• Public Key Cryptography - PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. ... (Lecture Notes in Computer Science), Moti Yung, Yevgeniy Dodis, Aggelos Kiayias, Tal Malkin, 2006.
  [search]

• “Secure scalable group signature with dynamic joins and separable authorities”, Aggelos Kiayias, Moti Yung, Int. J. Secur. Netw., vol. 1 (2006), pp. 24-45.
  [doi] [search]

• Security and Cryptography for Networks: 5th International Conference, SCN 2006, Maiori, Italy, September 6-8, 2006, Proceedings (Lecture Notes in Computer Science), Roberto De Prisco, Moti Yung, 2006.
  [search]

• Applied Cryptography and Network Security: Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005, Proceedings (Lecture Notes in Computer Science), John Ioannidis, Angelos Keromytis, Moti Yung, 2005.
  [search]

• Digital Signatures (Advances in Information Security), Moti Yung, Jonathan Katz, 2005.
  [search]

• “Scalable public-key tracing and revoking”, Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung, Distrib. Comput., vol. 17 (2005), pp. 323-347.
  [doi] [search]

• “Secure Hypergraphs: Privacy from Partial Broadcast”, Matthew Franklin, Moti Yung, SIAM J. Discret. Math., vol. 18 (2005), pp. 437-450.
  [doi] [search]

• “/k/-anonymous secret handshakes with reusable credentials”, Shouhuai Xu, Moti Yung, CCS '04: Proceedings of the 11th ACM conference on Computer and communications security, 2004, pp. 158-167.
  [doi.acm.org] [search]

• Applied Cryptography and Network Security: Second International Conference, ACNS 2004, Yellow Mountain, China, June 8-11, 2004. Proceedings (Lecture Notes in Computer Science), Markus Jakobsson, Moti Yung, Jianying Zhou, 2004.
  [search]

• Information Security Applications: 4th International Workshop, Wisa 2003, Jeju Island, Korea, August 2003: Revised Papers (Lecture Notes in Computer Science, 2908), Kijoon Chae, Moti Yung, 2004.
  [search]

• Malicious Cryptography: Exposing Cryptovirology, Adam Young, Moti Yung, 2004.
  [search]

• “The dual receiver cryptosystem and its applications”, Theodore Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung, CCS '04: Proceedings of the 11th ACM conference on Computer and communications security, 2004, pp. 330-343.
  [doi.acm.org] [search]

• Applied Cryptography and Network Security: First International Conference, Acns 2003, Kunming, China, October 16-19, 2003: Proceedings (Lecture Notes in Computer Science, 2846), Jianying Zhou, Moti Yung, Yongfei Han, 2003.
  [search]

• “Scalable public-key tracing and revoking”, Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung, PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing, 2003, pp. 190-199.
  [doi.acm.org] [search]

• “Strong Key-Insulated Signature Schemes”, Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung, PKC '03: Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography, 2003, pp. 130-144.
  [search]

• “Adaptively secure distributed public-key systems”, Yair Frankel, Philip MacKenzie, Moti Yung, Theor. Comput. Sci., vol. 287 (2002), pp. 535-561.
  [doi] [search]

• “Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes”, Aggelos Kiayias, Moti Yung, ICALP '02: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, pp. 232-243.
  [search]

• “Exposure-Resilience for Free: The Hierarchical ID-based Encryption Case”, Yevgeniy Dodis, Moti Yung, SISW '02: Proceedings of the First International IEEE Security in Storage Workshop, 2002, pp. 45.
  [search]

• “Incremental Unforgeable Encryption”, Enrico Buonanno, Jonathan Katz, Moti Yung, FSE '01: Revised Papers from the 8th International Workshop on Fast Software Encryption, 2002, pp. 109-124.
  [search]

• “Key-Insulated Public Key Cryptosystems”, Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung, EUROCRYPT '02: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, 2002, pp. 65-82.
  [search]

• “Observability Analysis - Detecting When Improved Cryptosystems Fail”, Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, Moti Yung, CT-RSA '02: Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology, 2002, pp. 17-29.
  [search]

• “On Crafty Pirates and Foxy Tracers”, Aggelos Kiayias, Moti Yung, DRM '01: Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management, 2002, pp. 22-39.
  [search]

• “Privacy against Piracy: Protecting Two-Level Revocable P-K Traitor Tracing”, Hyun-Jeong Kim, Dong Hoon Lee, Moti Yung, ACISP '02: Proceedings of the 7th Australian Conference on Information Security and Privacy, 2002, pp. 482-496.
  [search]

• “Self-Stabilizing Symmetry Breaking in Constant Space”, Alain Mayer, Rafail Ostrovsky, Yoram Ofek, Moti Yung, SIAM J. Comput., vol. 31 (2002), pp. 1571-1595.
  [doi] [search]

• “Self-tallying Elections and Perfect Ballot Secrecy”, Aggelos Kiayias, Moti Yung, PKC '02: Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems, 2002, pp. 141-158.
  [search]

• “The Business of Electronic Voting”, Ed Gerck, C. Andrew Neff, Ronald L. Rivest, Aviel D. Rubin, Moti Yung, FC '01: Proceedings of the 5th International Conference on Financial Cryptography, 2002, pp. 243-268.
  [search]

• “Threshold Cryptosystems Based on Factoring”, Jonathan Katz, Moti Yung, ASIACRYPT '02: Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security, 2002, pp. 192-205.
  [search]

• “Traitor Tracing with Constant Transmission Rate”, Aggelos Kiayias, Moti Yung, EUROCRYPT '02: Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, 2002, pp. 450-465.
  [search]

• “Adaptive Security for the Additive-Sharing Based Proactive RSA”, Yair Frankel, Philip D. MacKenzie, Moti Yung, PKC '01: Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography, 2001, pp. 240-263.
  [search]

• “Bandwidth-Optimal Kleptographic Attacks”, Adam Young, Moti Yung, CHES '01: Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems, 2001, pp. 235-250.
  [search]

• “Blind, Auditable Membership Proofs”, Tomas Sander, Amnon Ta-Shma, Moti Yung, FC '00: Proceedings of the 4th International Conference on Financial Cryptography, 2001, pp. 53-71.
  [search]

• “DISSECT: DIStribution for SECurity Tool”, Enriquillo Valdez, Moti Yung, ISC '01: Proceedings of the 4th International Conference on Information Security, 2001, pp. 125-143.
  [search]

• “Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords”, Jonathan Katz, Rafail Ostrovsky, Moti Yung, EUROCRYPT '01: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, 2001, pp. 475-494.
  [search]

• “Friendly observers ease off-line e-cash”, Shouhuai Xu, Moti Yung, Gendu Zhang, Proceedings of the fourth working conference on smart card research and advanced applications on Smart card research and advanced applications, 2001, pp. 3-18.
  [search]

• “Hash to the Rescue: Space Minimization for PKI Directories”, Adam Young, Moti Yung, ICISC '00: Proceedings of the Third International Conference on Information Security and Cryptology, 2001, pp. 235-245.
  [search]

• “On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC”, Marc Joye, Jean-Jacques Quisquater, Moti Yung, CT-RSA 2001: Proceedings of the 2001 Conference on Topics in Cryptology, pp. 208-222.
  [search]

• “Polynomial Reconstruction Based Cryptography”, Aggelos Kiayias, Moti Yung, SAC '01: Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography, 2001, pp. 129-133.
  [search]

• “Secure Games with Polynomial Expressions”, Aggelos Kiayias, Moti Yung, ICALP '01: Proceedings of the 28th International Colloquium on Automata, Languages and Programming,, 2001, pp. 939-950.
  [search]

• “Self Protecting Pirates and Black-Box Traitor Tracing”, Aggelos Kiayias, Moti Yung, CRYPTO '01: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, 2001, pp. 63-79.
  [search]

• “Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation”, Jonathan Katz, Moti Yung, FSE '00: Proceedings of the 7th International Workshop on Fast Software Encryption, 2001, pp. 284-299.
  [search]

• “"Psyeudorandom Intermixing": A Tool for Shared Cryptography”, Yair Frankel, Philip D. MacKenzie, Moti Yung, PKC '00: Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography, 2000, pp. 306-325.
  [search]

• “Combined asynchronous/synchronous packet switching architecture: QoS guarantees for integrated parallel computing and real-time traffic”, Yoram Ofek, Moti Yung, J. Parallel Distrib. Comput., vol. 60 (2000), pp. 275-295.
  [doi] [search]

• “Complete characterization of security notions for probabilistic private-key encryption”, Jonathan Katz, Moti Yung, STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000, pp. 245-254.
  [doi.acm.org] [search]

• “Design Validations for Discrete Logarithm Based Signature Schemes”, Ernest F. Brickell, David Pointcheval, Serge Vaudenay, Moti Yung, PKC '00: Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography, 2000, pp. 276-292.
  [search]

• “Eavesdropping games: a graph-theoretic approach to privacy in distributed systems”, Matthew Franklin, Zvi Galil, Moti Yung, J. ACM, vol. 47 (2000), pp. 225-243.
  [doi.acm.org] [search]

• “Funkspiel schemes: an alternative to conventional tamper resistance”, Johan Håstad, Jakob Jonsson, Ari Juels, Moti Yung, CCS '00: Proceedings of the 7th ACM conference on Computer and communications security, 2000, pp. 125-133.
  [doi.acm.org] [search]

• “How to Say \"YES\" with Smart Cards”, Yair Frankel, Moti Yung, CARDIS '98: Proceedings of the The International Conference on Smart Card Research and Applications, 2000, pp. 203-212.
  [search]

• “Local and congestion-driven fairness algorithm in arbitrary topology networks”, Alain Mayer, Yoram Ofek, Moti Yung, IEEE/ACM Trans. Netw., vol. 8 (2000), pp. 362-372.
  [doi] [search]

• “On Threshold RSA-Signing with no Dealer”, Shingo Miyazaki, Kouichi Sakurai, Moti Yung, ICISC '99: Proceedings of the Second International Conference on Information Security and Cryptology, 2000, pp. 197-207.
  [search]

• “On zero-knowledge proofs (extended abstract): ``from membership to decision''”, Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung, STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000, pp. 255-264.
  [doi.acm.org] [search]

• “RSA-Based Auto-recoverable Cryptosystems”, Adam Young, Moti Yung, PKC '00: Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography, 2000, pp. 326-341.
  [search]

• “Self-Escrowed Public-Key Infrastructures”, Pascal Paillier, Moti Yung, ICISC '99: Proceedings of the Second International Conference on Information Security and Cryptology, 2000, pp. 257-268.
  [search]

• “Software DisEngineering: Program Hiding Architecture and Experiments”, Enriquillo Valdez, Moti Yung, IH '99: Proceedings of the Third International Workshop on Information Hiding, 2000, pp. 379-394.
  [search]

• “Towards Signature-Only Signature Schemes”, Adam Young, Moti Yung, ASIACRYPT '00: Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security, 2000, pp. 97-115.
  [search]

• “Adaptively-Secure Distributed Public-Key Systems”, Yair Frankel, Philip D. MacKenzie, Moti Yung, ESA '99: Proceedings of the 7th Annual European Symposium on Algorithms, 1999, pp. 4-27.
  [search]

• “Adaptively-Secure Optimal-Resilience Proactive RSA”, Yair Frankel, Philip D. MacKenzie, Moti Yung, ASIACRYPT '99: Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security, 1999, pp. 180-194.
  [search]

• “Auto-Recoverable Cryptosystems with Faster Initialization and the Escrow Hierarchy”, Adam Young, Moti Yung, PKC '99: Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography, 1999, pp. 306-314.
  [search]

• “Auto-recoverable Auto-certifiable Cryptosystems (A Survey)”, Adam Young, Moti Yung, Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99, 1999, pp. 204-218.
  [search]

• “Cryptosystems Robust against "Dynamic Faults" Meet Enterprise Needs for Organizational "Change Control"”, Yair Frankel, Moti Yung, FC '99: Proceedings of the Third International Conference on Financial Cryptography, 1999, pp. 241-252.
  [search]

• “Decision Oracles are Equivalent to Matching Oracles”, Helena Handschuh, Yiannis Tsiounis, Moti Yung, PKC '99: Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography, 1999, pp. 276-289.
  [search]

• “Electronic Payments: Where Do We Go from Here?”, Markus Jakobsson, David M'Raïhi, Yiannis Tsiounis, Moti Yung, Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99, 1999, pp. 43-63.
  [search]

• “Money Conservation via Atomicity in Fair Off-Line E-Cash”, Shouhuai Xu, Moti Yung, Gendu Zhang, Hong Zhu, ISW '99: Proceedings of the Second International Workshop on Information Security, 1999, pp. 14-31.
  [search]

• “Non-Interactive CryptoComputing For NC1”, Tomas Sander, Adam Young, Moti Yung, FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 554.
  [search]

• “Scramble All, Encrypt Small”, Markus Jakobsson, Julien P. Stern, Moti Yung, FSE '99: Proceedings of the 6th International Workshop on Fast Software Encryption, 1999, pp. 95-111.
  [search]

• “Secure protocol transformation via ``expansion'': from two-party to groups”, Alain Mayer, Moti Yung, CCS '99: Proceedings of the 6th ACM conference on Computer and communications security, 1999, pp. 83-92.
  [doi.acm.org] [search]

• “Self-Testing/Correcting Protocols (Extended Abstract)”, Matthew K. Franklin, Juan A. Garay, Moti Yung, Proceedings of the 13th International Symposium on Distributed Computing, 1999, pp. 269-283.
  [search]

• “Beyond Identity: Warranty-Based Digital Signature Transactions”, Yair Frankel, David W. Kravitz, Charles T. Montgomery, Moti Yung, FC '98: Proceedings of the Second International Conference on Financial Cryptography, 1998, pp. 241-253.
  [search]

• “Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it”, Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung, ISAAC '98: Proceedings of the 9th International Symposium on Algorithms and Computation, 1998, pp. 59-68.
  [search]

• “Distributed Public Key Cryptosystems”, Yair Frankel, Moti Yung, PKC '98: Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography, 1998, pp. 1-13.
  [search]

• “Fair Off-Line e-cash Made Easy”, Yair Frankel, Yiannis Tsiounis, Moti Yung, ASIACRYPT '98: Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security, 1998, pp. 257-270.
  [search]

• “Finding Length-3 Positive Cunningham Chains”, Adam Young, Moti Yung, ANTS-III: Proceedings of the Third International Symposium on Algorithmic Number Theory, 1998, pp. 289-298.
  [search]

• “Image Density is Complete for Non-Interactive-SZK (Extended Abstract)”, Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung, ICALP '98: Proceedings of the 25th International Colloquium on Automata, Languages and Programming, 1998, pp. 784-795.
  [search]

• “Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs”, Adam Young, Moti Yung, FSE '98: Proceedings of the 5th International Workshop on Fast Software Encryption, 1998, pp. 122-133.
  [search]

• “On Assurance Structures for WWW Commerce”, Markus Jakobsson, Moti Yung, FC '98: Proceedings of the Second International Conference on Financial Cryptography, 1998, pp. 141-157.
  [search]

• “On the Security of ElGamal Based Encryption”, Yiannis Tsiounis, Moti Yung, PKC '98: Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography, 1998, pp. 117-134.
  [search]

• “Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols”, Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung, STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, 1998, pp. 511-521.
  [search]

• “Robust efficient distributed RSA-key generation”, Yair Frankel, Philip D. MacKenzie, Moti Yung, PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, 1998, pp. 320.
  [doi.acm.org] [search]

• “Robust efficient distributed RSA-key generation”, Yair Frankel, Philip D. MacKenzie, Moti Yung, STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, 1998, pp. 663-672.
  [doi.acm.org] [search]

• “VarietyCash: a multi-purpose electronic payment system”, M. Bellare, J. Garay, C. Jutla, M. Yung, WOEC'98: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce, 1998, pp. 2-2.
  [search]

• “``Dynamic-fault-prone BSP'': a paradigm for robust computations in changing environments”, Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung, SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, 1998, pp. 37-46.
  [doi.acm.org] [search]

• “Anonymity Control in E-Cash Systems”, George I. Davida, Yair Frankel, Yiannis Tsiounis, Moti Yung, FC '97: Proceedings of the First International Conference on Financial Cryptography, 1997, pp. 1-16.
  [search]

• “Applying Anti-Trust Policies to Increase Trust in a Versatile E-Money System”, Markus Jakobsson, Moti Yung, FC '97: Proceedings of the First International Conference on Financial Cryptography, 1997, pp. 217-238.
  [search]

• “Combinatorial design of congestion-free networks”, Bülent Yener, Yoram Ofek, Moti Yung, IEEE/ACM Trans. Netw., vol. 5 (1997), pp. 989-1000.
  [doi] [search]

• “Concurrent Asynchronous Broadcast on the MetaNet”, Yoram Ofek, Bülent Yener, Moti Yung, IEEE Trans. Comput., vol. 46 (1997), pp. 737-748.
  [doi] [search]

• “Deniable password snatching: on the possibility of evasive electronic espionage”, A. Young, Moti Yung, SP '97: Proceedings of the 1997 IEEE Symposium on Security and Privacy, pp. 224.
  [search]

• “Efficient on-line call control algorithms”, Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung, J. Algorithms, vol. 23 (1997), pp. 180-194.
  [doi] [search]

• “Fault-tolerant convergence routing”, Bülent Yener, Inderpal Bhandari, Yoram Ofek, Moti Yung, J. Parallel Distrib. Comput., vol. 42 (1997), pp. 173-183.
  [doi] [search]

• “Keeping the SZK-Verifier Honest Unconditionally”, Giovanni Di Crescenzo, Tatsuaki Okamoto, Moti Yung, CRYPTO '97: Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, 1997, pp. 31-45.
  [search]

• “On Characterization of Escrow Encryption Schemes”, Yair Frankel, Moti Yung, ICALP '97: Proceedings of the 24th International Colloquium on Automata, Languages and Programming, 1997, pp. 705-715.
  [search]

• “Optimal-resilience proactive public-key cryptosystems”, Y. Frankel, P. Gemmell, P. D. MacKenzie, Moti Yung, FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997, pp. 384.
  [search]

• “Proactive RSA”, Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung, CRYPTO '97: Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, 1997, pp. 440-454.
  [search]

• “Proactive public key and signature systems”, Amir Herzberg, Markus Jakobsson, Stanisl\law Jarecki, Hugo Krawczyk, Moti Yung, CCS '97: Proceedings of the 4th ACM conference on Computer and communications security, 1997, pp. 100-110.
  [doi.acm.org] [search]

• “Scheduling task-trees with additive scales on parallel/distributed machines”, Xiangdong Yu, Moti Yung, Theor. Comput. Sci., vol. 181 (1997), pp. 357-378.
  [doi] [search]

• “Sliding Encryption: A Cryptographic Tool for Mobile Agents”, Adam Young, Moti Yung, FSE '97: Proceedings of the 4th International Workshop on Fast Software Encryption, 1997, pp. 230-241.
  [search]

• “The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems”, Adam Young, Moti Yung, CRYPTO '97: Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, 1997, pp. 264-276.
  [search]

• “The local detection paradigm and its applications to self-stabilization”, Yehuda Afek, Shay Kutten, Moti Yung, Theor. Comput. Sci., vol. 186 (1997), pp. 199-229.
  [doi] [search]

• “Zero-knowledge proofs of decision power: new protocols and optimal round-complexity”, Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung, ICICS '97: Proceedings of the First International Conference on Information and Communication Security, 1997, pp. 17-27.
  [search]

• “"Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash”, Yair Frankel, Yiannis Tsiounis, Moti Yung, ASIACRYPT '96: Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security, 1996, pp. 286-300.
  [search]

• “A Progress Report on Subliminal-Free Channels”, Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya, Moti Yung, Proceedings of the First International Workshop on Information Hiding, 1996, pp. 157-168.
  [search]

• “Agent Rendezvous: A Dynamic Symmetry-Breaking Problem”, Xiangdong Yu, Moti Yung, ICALP '96: Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, 1996, pp. 610-621.
  [search]

• “Cryptovirology: Extortion-Based Security Threats and Countermeasures”, Adam Young, Moti Yung, SP '96: Proceedings of the 1996 IEEE Symposium on Security and Privacy, pp. 129.
  [search]

• “Distributed Computing in Asynchronous Networks with Byzantine Edges”, Vasant Shanbhogue, Moti Yung, COCOON '96: Proceedings of the Second Annual International Conference on Computing and Combinatorics, 1996, pp. 352-360.
  [search]

• “Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers”, Markus Jakobsson, Moti Yung, CRYPTO '96: Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, 1996, pp. 186-200.
  [search]

• “Revokable and versatile electronic money (extended abstract)”, Markus Jakobsson, Moti Yung, CCS '96: Proceedings of the 3rd ACM conference on Computer and communications security, 1996, pp. 76-87.
  [doi.acm.org] [search]

• “Self-stabilizing algorithms for synchronous unidirectional rings”, Alain Mayer, Rafail Ostrovsky, Moti Yung, SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, 1996, pp. 564-573.
  [search]

• “The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone?”, Adam Young, Moti Yung, CRYPTO '96: Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology, 1996, pp. 89-103.
  [search]

• “Witness-based cryptographic program checking and applications (an announcement)”, Yair Frankel, Peter Gemmell, Moti Yung, PODC '96: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, 1996, pp. 211.
  [doi.acm.org] [search]

• “Witness-based cryptographic program checking and robust function sharing”, Yair Frankel, Peter Gemmell, Moti Yung, STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, 1996, pp. 499-508.
  [doi.acm.org] [search]

• “Cryptoanalysis of the Immunized LL Public Key Systems”, Yair Frankel, Moti Yung, CRYPTO '95: Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, 1995, pp. 287-296.
  [search]

• “Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary”, Noga Alon, Zvi Galil, Moti Yung, ESA '95: Proceedings of the Third Annual European Symposium on Algorithms, 1995, pp. 523-537.
  [search]

• “Escrow Encryption Systems Visited: Attacks, Analysis and Designs”, Yair Frankel, Moti Yung, CRYPTO '95: Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, 1995, pp. 222-235.
  [search]

• “Local fairness in general-topology networks with convergence routing”, A. Mayer, Y. Ofek, M. Yung, INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume, 1995, pp. 891.
  [search]

• “METANET: principles of an arbitrary topology LAN”, Yoram Ofek, Moti Yung, IEEE/ACM Trans. Netw., vol. 3 (1995), pp. 169-180.
  [doi] [search]

• “Multi-authority secret-ballot elections with linear work”, Ronald J.F. Cramer, Matthew Franklin, L. A.M. Schoenmakers, Moti Yung, 1995.
  [search]

• “Proactive Secret Sharing Or: How to Cope With Perpetual Leakage”, Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung, CRYPTO '95: Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology, 1995, pp. 339-352.
  [search]

• “Resolving message complexity of Byzantine Agreement and beyond”, Z. Galil, A. Mayer, Moti Yung, FOCS '95: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 724.
  [search]

• “Scheduling Task-Tree with Additive Scales on Parallel / Distributed Machines”, Xiangdong Yu, Moti Yung, COCOON '95: Proceedings of the First Annual International Conference on Computing and Combinatorics, 1995, pp. 607-616.
  [search]

• “Secure hypergraphs: privacy from partial broadcast”, Matthew Franklin, Moti Yung, STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, 1995, pp. 36-44.
  [doi.acm.org] [search]

• “Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time”, Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung, ICALP '95: Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, 1995, pp. 159-170.
  [search]

• “The KryptoKnight family of light-weight protocols for authentication and key distribution”, Ray Bird, Inder Gopal, Amir Herzberg, Phil Janson, Shay Kutten, Refik Molva, Moti Yung, IEEE/ACM Trans. Netw., vol. 3 (1995), pp. 31-41.
  [doi] [search]

• “Topological design of loss-free switch-based LANs”, B. Yener, Y. Ofek, M. Yung, INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume, 1995, pp. 88.
  [search]

• “Coins, weights and contention in balancing networks”, William Aiello, Ramarathnam Venkatesan, Moti Yung, PODC '94: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, 1994, pp. 193-205.
  [doi.acm.org] [search]

• “How to share a function securely”, Alfredo De Santis, Yvo Desmedt, Yair Frankel, Moti Yung, STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, 1994, pp. 522-533.
  [doi.acm.org] [search]

• “Interactive hashing simplifies zero-knowledge protocol design”, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung, EUROCRYPT '93: Workshop on the theory and application of cryptographic techniques on Advances in cryptology, 1994, pp. 267-273.
  [search]

• “Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking”, Giuseppe Parlati, Moti Yung, ESA '94: Proceedings of the Second Annual European Symposium on Algorithms, 1994, pp. 183-201.
  [search]

• “Privacy from partial broadcast”, Matthew Franklin, Moti Yung, 1994.
  [search]

• “Routing and flow control on the MetaNet: an overview”, Yoram Ofek, Moti Yung, Comput. Netw. ISDN Syst., vol. 26 (1994), pp. 859-872.
  [doi] [search]

• “Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing”, Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung, ICALP '94: Proceedings of the 21st International Colloquium on Automata, Languages and Programming, 1994, pp. 508-519.
  [search]

• “Time-optimal message-efficient work performance in the presence of faults”, Roberto De Prisco, Alain Mayer, Moti Yung, PODC '94: Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, 1994, pp. 161-172.
  [doi.acm.org] [search]

• “Certifying Cryptographic Tools: The Case of Trapdoor Permutations”, Mihir Bellare, Moti Yung, CRYPTO '92: Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, 1993, pp. 442-460.
  [search]

• “Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)”, Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung, CRYPTO '92: Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, 1993, pp. 196-214.
  [search]

• “Perfectly secure message transmission”, Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung, J. ACM, vol. 40 (1993), pp. 17-47.
  [doi.acm.org] [search]

• “Perfectly-Secure Key Distribution for Dynamic Conferences”, Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung, CRYPTO '92: Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, 1993, pp. 471-486.
  [search]

• “Secure and Efficient Off-Line Digital Money (Extended Abstract)”, Matthew K. Franklin, Moti Yung, ICALP '93: Proceedings of the 20th International Colloquium on Automata, Languages and Programming, 1993, pp. 265-276.
  [search]

• “Communication complexity of secure computation (extended abstract)”, Matthew Franklin, Moti Yung, STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, 1992, pp. 699-710.
  [doi.acm.org] [search]

• “Criticizing solutions to relaxed models yields powerful admissible heuristics”, Othar Hansson, Andrew Mayer, Moti Yung, Inf. Sci., vol. 63 (1992), pp. 207-227.
  [doi] [search]

• “Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback”, Yvo Desmedt, Yair Frankel, Moti Yung, IEEE INFOCOM '92: Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3), 1992, pp. 2045-2054.
  [search]

• “One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier”, Alfredo De Santis, Giuseppe Persiano, Moti Yung, ICALP '92: Proceedings of the 19th International Colloquium on Automata, Languages and Programming, 1992, pp. 28-40.
  [search]

• “Secure Commitment Against A Powerful Adversary”, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung, STACS '92: Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science, 1992, pp. 439-448.
  [search]

• “Self-stabilizing symmetry breaking in constant-space (extended abstract)”, Alain Mayer, Yoram Ofek, Rafail Ostrovsky, Moti Yung, STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, 1992, pp. 667-678.
  [doi.acm.org] [search]

• “Systematic Design of Two-Party Authentication Protocols”, Ray Bird, Inder S. Gopal, Amir Herzberg, Philippe A. Janson, Shay Kutten, Refik Molva, Moti Yung, CRYPTO '91: Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology, 1992, pp. 44-61.
  [search]

• “Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract)”, Yvo Desmedt, Moti Yung, CRYPTO '90: Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, 1991, pp. 177-188.
  [search]

• “Constant-round perfect zero-knowledge computationally convincing protocols”, Gilles Brassard, Claude Crépeau, Moti Yung, Theor. Comput. Sci., vol. 84 (1991), pp. 23-52.
  [doi] [search]

• “Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems”, Alfredo De Santis, Moti Yung, CRYPTO '90: Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, 1991, pp. 366-377.
  [search]

• “Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed Networks”, Yoram Ofek, Moti Yung, WDAG '90: Proceedings of the 4th International Workshop on Distributed Algorithms, 1991, pp. 192-212.
  [search]

• “Efficient mechanism for fairness and deadlock-avoidance in high-speed networks”, Yoram Ofek, Moti Yung, Proceedings of the 4th international workshop on Distributed algorithms, 1991, pp. 192-212.
  [search]

• “Efficient sequential and parallel algorithms for computing recovery points in trees and paths”, Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung, SODA '91: Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, 1991, pp. 158-167.
  [search]

• “How to withstand mobile virus attacks (extended abstract)”, Rafail Ostrovsky, Moti Yung, PODC '91: Proceedings of the tenth annual ACM symposium on Principles of distributed computing, 1991, pp. 51-59.
  [doi.acm.org] [search]

• “Memory-Efficient Self Stabilizing Protocols for General Networks”, Yehuda Afek, Shay Kutten, Moti Yung, WDAG '90: Proceedings of the 4th International Workshop on Distributed Algorithms, 1991, pp. 15-28.
  [search]

• “Memory-efficient self stabilizing protocols for general networks”, Yehuda Afek, Shay Kutten, Moti Yung, Proceedings of the 4th international workshop on Distributed algorithms, 1991, pp. 15-28.
  [search]

• “On the design of provably-secure cryptographic hash functions”, Alfredo De Santis, Moti Yung, EUROCRYPT '90: Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, 1991, pp. 412-431.
  [search]

• “One-Way Group Actions”, Gilles Brassard, Moti Yung, CRYPTO '90: Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, 1991, pp. 94-107.
  [search]

• “Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract)”, Gilles Brassard, Claude Crépeau, Moti Yung, EUROCRYPT '89: Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, 1990, pp. 192-195.
  [search]

• “Principle for high speed network control: congestion-and deadlock-freeness, self-routing, and a single buffer per link”, Yoram Ofek, Moti Yung, PODC '90: Proceedings of the ninth annual ACM symposium on Principles of distributed computing, 1990, pp. 161-175.
  [doi.acm.org] [search]

• “Public-key cryptosystems provably secure against chosen ciphertext attacks”, M. Naor, M. Yung, STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of computing, 1990, pp. 427-437.
  [doi.acm.org] [search]

• “The power of multimedia: combining point-to-point and multiaccess networks”, Y. Afek, M. Landau, B. Schieber, M. Yung, Inf. Comput., vol. 84 (1990), pp. 97-118.
  [doi] [search]

• “Zero-knowledge proofs of computational power (extended summary)”, Moti Yung, EUROCRYPT '89: Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology, 1990, pp. 196-207.
  [search]

• “Divide and conquer under global constraints: a solution to the /N/-queens problem”, Bruce Abramson, Moti Yung, J. Parallel Distrib. Comput., vol. 6 (1989), pp. 649-662.
  [doi] [search]

• “Fast algorithms for edge-coloring planar graphs”, Marek Chrobak, Moti Yung, J. Algorithms, vol. 10 (1989), pp. 35-51.
  [doi] [search]

• “Minimum-knowledge interactive proofs for decision problems”, Zvi Galil, Stuart Haber, Moti Yung, SIAM J. Comput., vol. 18 (1989), pp. 711-739.
  [doi] [search]

• “Universal one-way hash functions and their cryptographic applications”, M. Naor, M. Yung, STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computing, 1989, pp. 33-43.
  [doi.acm.org] [search]

• “Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model”, Zvi Galil, Stuart Haber, Moti Yung, CRYPTO '87: A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, 1988, pp. 135-155.
  [search]

• “Direct Minimum-Knowledge Computations”, Russell Impagliazzo, Moti Yung, CRYPTO '87: A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, 1988, pp. 40-51.
  [search]

• “Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs”, Marek Chrobak, Moti Yung, AWOC '88: Proceedings of the 3rd Aegean Workshop on Computing, 1988, pp. 11-23.
  [search]

• “Fast parallel and sequential algorithms for edge-coloring planar graphs (extended abstract)”, M. Chrobak, M. Yung, VLSI Algorithms and Architectures, 1988, pp. 11-23.
  [search]

• “The power of multimedia: combining point-to point and multi-access networks”, Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung, PODC '88: Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, 1988, pp. 90-104.
  [doi.acm.org] [search]

• “Distributed algorithms in synchronous broadcasting networks”, Z. Galil, G. M. Landau, M. M. Yung, Theor. Comput. Sci., vol. 49 (1987), pp. 178-184.
  [search]

• “Partitioned encryption and achieving simultaneity by partitioning”, Zvi Galil, Moti Yung, Inf. Process. Lett., vol. 26 (1987), pp. 81-88.
  [doi] [search]

• “Distributing the power of a government to enhance the privacy of voters”, Josh C Benaloh, Moti Yung, PODC '86: Proceedings of the fifth annual ACM symposium on Principles of distributed computing, 1986, pp. 52-62.
  [doi.acm.org] [search]

• “Symmetric Public-Key Encryption”, Zvi Galil, Stuart Haber, Moti Yung, CRYPTO '85: Advances in Cryptology, 1986, pp. 128-137.
  [search]

• “Symmetric public-key encryption”, Zvi Galil, Stuart Haber, Moti Yung, Lecture notes in computer sciences; 218 on Advances in cryptology--CRYPTO 85, 1986, pp. 128-137.
  [search]