Mordechai M. Yung
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| 328 |      | Benoît Libert, Moti Yung: Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs. TCC 2010: 499-517 |
| 2009 | ||
| 327 | | Kyo-Il Chung, Kiwook Sohn, Moti Yung: Information Security Applications, 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers Springer 2009 |
| 326 | | Moti Yung, Peng Liu, Dongdai Lin: Information Security and Cryptology, 4th International Conference, Inscrypt 2008, Beijing, China, December 14-17, 2008, Revised Selected Papers Springer 2009 |
| 325 | | Pierangela Samarati, Moti Yung, Fabio Martinelli, Claudio Agostino Ardagna: Information Security, 12th International Conference, ISC 2009, Pisa, Italy, September 7-9, 2009. Proceedings Springer 2009 |
| 324 | | Heung Youl Youm, Moti Yung: Information Security Applications, 10th International Workshop, WISA 2009, Busan, Korea, August 25-27, 2009, Revised Selected Papers Springer 2009 |
| 323 | | Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung: Efficient Robust Private Set Intersection. ACNS 2009: 125-142 |
| 322 | | Jung Yeon Hwang, Dong Hoon Lee, Moti Yung: Universal forgery of the identity-based sequential aggregate signature scheme. ASIACCS 2009: 157-160 |
| 321 | | Julien Cathalo, Benoît Libert, Moti Yung: Group Encryption: Non-interactive Realization in the Standard Model. ASIACRYPT 2009: 179-196 |
| 320 | | Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yung: Secure Multi-party Computation Minimizing Online Rounds. ASIACRYPT 2009: 268-286 |
| 319 | | Jan Camenisch, Aggelos Kiayias, Moti Yung: On the Portability of Generalized Schnorr Proofs. EUROCRYPT 2009: 425-442 |
| 318 | | François-Xavier Standaert, Tal Malkin, Moti Yung: A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks. EUROCRYPT 2009: 443-461 |
| 317 | | Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung: A New Randomness Extraction Paradigm for Hybrid Encryption. EUROCRYPT 2009: 590-609 |
| 316 | | Moti Yung: How to Guard the Guards Themselves. FCT 2009: 1-2 |
| 315 | | Shouhuai Xu, Moti Yung: Expecting the Unexpected: Towards Robust Credential Infrastructure. Financial Cryptography 2009: 201-221 |
| 314 | | Aggelos Kiayias, Bülent Yener, Moti Yung: Privacy-Preserving Information Markets for Computing Statistical Data. Financial Cryptography 2009: 32-50 |
| 313 | | Maged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong-Sheng Zhou: Secure Function Collection with Sublinear Storage. ICALP (2) 2009: 534-545 |
| 312 | | Benoît Libert, Moti Yung: Efficient Traceable Signatures in the Standard Model. Pairing 2009: 187-205 |
| 311 | | Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao: Concurrent Knowledge-Extraction in the Public-Key Model CoRR abs/0908.2476: (2009) |
| 310 | | Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao: Adaptive Concurrent Non-Malleability with Bare Public-Keys CoRR abs/0910.3282: (2009) |
| 309 | | Seung Geol Choi, Javier Herranz, Dennis Hofheinz, Jung Yeon Hwang, Eike Kiltz, Dong Hoon Lee, Moti Yung: The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure. Inf. Process. Lett. 109(16): 897-901 (2009) |
| 308 | | Debra L. Cook, Moti Yung, Angelos D. Keromytis: Elastic block ciphers: method, security and instantiations. Int. J. Inf. Sec. 8(3): 211-231 (2009) |
| 307 | | Jonathan Katz, Rafail Ostrovsky, Moti Yung: Efficient and secure authenticated key exchange using weak passwords. J. ACM 57(1): (2009) |
| 2008 | ||
| 306 |  | Steven M. Bellovin, Rosario Gennaro, Angelos D. Keromytis, Moti Yung: Applied Cryptography and Network Security, 6th International Conference, ACNS 2008, New York, NY, USA, June 3-6, 2008. Proceedings ACNS 2008 |
| 305 | | Sehun Kim, Moti Yung, Hyung-Woo Lee: Information Security Applications, 8th International Workshop, WISA 2007, Jeju Island, Korea, August 27-29, 2007, Revised Selected Papers Springer 2008 |
| 304 | | Dingyi Pei, Moti Yung, Dongdai Lin, Chuankun Wu: Information Security and Cryptology, Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers Springer 2008 |
| 303 | | Debra L. Cook, Moti Yung, Angelos D. Keromytis: Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers. ACISP 2008: 187-202 |
| 302 | | Christophe Petit, François-Xavier Standaert, Olivier Pereira, Tal Malkin, Moti Yung: A block cipher based pseudo random number generator secure against side-channel key recovery. ASIACCS 2008: 56-65 |
| 301 | | Aggelos Kiayias, Moti Yung: Public-key traitor tracing from efficient decoding and unbounded enrollment: extended abstract. Digital Rights Management Workshop 2008: 9-18 |
| 300 | | Vicente Benjumea, Seung Geol Choi, Javier Lopez, Moti Yung: Fair Traceable Multi-Group Signatures. Financial Cryptography 2008: 231-246 |
| 299 | | Jon Callas, Yvo Desmedt, Daniel Nagy, Akira Otsuka, Jean-Jacques Quisquater, Moti Yung: Real Electronic Cash Versus Academic Electronic Cash Versus Paper Cash (Panel Report). Financial Cryptography 2008: 307-313 |
| 298 | | François-Xavier Standaert, Tal Malkin, Moti Yung: Does Physical Security of Cryptographic Devices Need a Formal Study? (Invited Talk). ICITS 2008: 70 |
| 297 | | Benoît Libert, Jean-Jacques Quisquater, Moti Yung: Key Evolution Systems in Untrusted Update Environments. Inscrypt 2008: 12-21 |
| 296 | | Debra L. Cook, Moti Yung, Angelos D. Keromytis: Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs. Inscrypt 2008: 157-180 |
| 295 | | Yongjin Yeom, Yongkuk Cho, Moti Yung: High-Speed Implementations of Block Cipher ARIA Using Graphics Processing Units. MUE 2008: 271-275 |
| 294 | | Petros Mol, Moti Yung: Recovering NTRU Secret Key from Inversion Oracles. Public Key Cryptography 2008: 18-36 |
| 293 | | Aggelos Kiayias, Shouhuai Xu, Moti Yung: Privacy Preserving Data Mining within Anonymous Credential Systems. SCN 2008: 57-76 |
| 292 | | Aggelos Kiayias, Moti Yung: Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. IEEE Transactions on Information Theory 54(6): 2752-2769 (2008) |
| 291 | | Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung: On Monotone Formula Composition of Perfect Zero-Knowledge Languages. SIAM J. Comput. 38(4): 1300-1329 (2008) |
| 2007 | ||
| 290 | | Peng Ning, Vijay Atluri, Shouhuai Xu, Moti Yung: Proceedings of the 2nd ACM Workshop on Scalable Trusted Computing, STC 2007, Alexandria, VA, USA, November 2, 2007 ACM 2007 |
| 289 | | Moti Yung, Aggelos Kiayias, Ahmad-Reza Sadeghi: Proceedings of the Seventh ACM Workshop on Digital Rights Management, Alexandria, VA, USA, October 29, 2007 ACM 2007 |
| 288 | | Jae-Kwang Lee, Okyeon Yi, Moti Yung: Information Security Applications, 7th International Workshop, WISA 2006, Jeju Island, Korea, August 28-30, 2006, Revised Selected Papers Springer 2007 |
| 287 | | Jonathan Katz, Moti Yung: Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, Proceedings Springer 2007 |
| 286 | | K. Srinathan, C. Pandu Rangan, Moti Yung: Progress in Cryptology - INDOCRYPT 2007, 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings Springer 2007 |
| 285 | | Donghoon Chang, Moti Yung, Jaechul Sung, Seokhie Hong, Sangjin Lee: Preimage Attack on the Parallel FFT-Hashing Function. ACISP 2007: 59-67 |
| 284 | | Benoît Libert, Jean-Jacques Quisquater, Moti Yung: Forward-secure signatures in untrusted update environments: efficient and generic constructions. ACM Conference on Computer and Communications Security 2007: 266-275 |
| 283 | | Debra L. Cook, Angelos D. Keromytis, Moti Yung: Elastic block ciphers: the basic design. ASIACCS 2007: 350-352 |
| 282 | | Aggelos Kiayias, Yiannis Tsiounis, Moti Yung: Group Encryption. ASIACRYPT 2007: 181-199 |
| 281 | | Seung Geol Choi, Ariel Elbaz, Ari Juels, Tal Malkin, Moti Yung: Two-Party Computing with Encrypted Data. ASIACRYPT 2007: 298-314 |
| 280 | | Vicente Benjumea, Seung Geol Choi, Javier Lopez, Moti Yung: Anonymity 2.0 - X.509 Extensions Supporting Privacy-Friendly Authentication. CANS 2007: 265-281 |
| 279 | | Moti Yung, Yunlei Zhao: Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model. EUROCRYPT 2007: 129-147 |
| 278 | | Shouhuai Xu, Moti Yung: K-Anonymous Multi-party Secret Handshakes. Financial Cryptography 2007: 72-87 |
| 277 | | Shlomi Dolev, Limor Lahiani, Moti Yung: Secret Swarm UnitReactive k-Secret Sharing. INDOCRYPT 2007: 123-137 |
| 276 | | Debra L. Cook, Moti Yung, Angelos D. Keromytis: The Security of Elastic Block Ciphers Against Key-Recovery Attacks. ISC 2007: 89-103 |
| 275 | | Adam Young, Moti Yung: Space-Efficient Kleptography Without Random Oracles. Information Hiding 2007: 112-129 |
| 274 | | Adam L. Young, Moti Yung: A Timing-Resistant Elliptic Curve Backdoor in RSA. Inscrypt 2007: 427-441 |
| 273 | | Moti Yung: On the Evolution of User Authentication: Non-bilateral Factors. Inscrypt 2007: 5-10 |
| 272 | | Benoît Libert, Jean-Jacques Quisquater, Moti Yung: Parallel Key-Insulated Public Key Encryption Without Random Oracles. Public Key Cryptography 2007: 298-314 |
| 271 | | Aggelos Kiayias, Moti Yung: Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice. Des. Codes Cryptography 43(2-3): 61-78 (2007) |
| 270 | | Moti Yung, Yunlei Zhao: Concurrent Knowledge-Extraction in the Public-Key Model. Electronic Colloquium on Computational Complexity (ECCC) 14(002): (2007) |
| 269 | | Jonathan Katz, Moti Yung: Scalable Protocols for Authenticated Group Key Exchange. J. Cryptology 20(1): 85-113 (2007) |
| 268 | | Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung: Decoding interleaved Reed-Solomon codes over noisy channels. Theor. Comput. Sci. 379(3): 348-360 (2007) |
| 2006 | ||
| 267 | | Ari Juels, Gene Tsudik, Shouhuai Xu, Moti Yung: Proceedings of the 1st ACM Workshop on Scalable Trusted Computing, STC 2006, Alexandria, VA, USA, November 3, 2006 ACM 2006 |
| 266 | | Moti Yung, Kaoru Kurosawa, Reihaneh Safavi-Naini: Proceedings of the Sixth ACM Workshop on Digital Rights Management, Alexandria, VA, USA, October 30, 2006 ACM 2006 |
| 265 | | Jianying Zhou, Moti Yung, Feng Bao: Applied Cryptography and Network Security, 4th International Conference, ACNS 2006, Singapore, June 6-9, 2006, Proceedings ACNS 2006 |
| 264 | | JooSeok Song, Taekyoung Kwon, Moti Yung: Information Security Applications, 6th International Workshop, WISA 2005, Jeju Island, Korea, August 22-24, 2005, Revised Selected Papers Springer 2006 |
| 263 | | Reihaneh Safavi-Naini, Moti Yung: Digital Rights Management: Technologies, Issues, Challenges and Systems, First International Conference, DRMTICS 2005, Sydney, Australia, October 31 - November 2, 2005, Revised Selected Papers Springer 2006 |
| 262 | | Moti Yung, Yevgeniy Dodis, Aggelos Kiayias, Tal Malkin: Public Key Cryptography - PKC 2006, 9th International Conference on Theory and Practice of Public-Key Cryptography, New York, NY, USA, April 24-26, 2006, Proceedings Springer 2006 |
| 261 | | Roberto De Prisco, Moti Yung: Security and Cryptography for Networks, 5th International Conference, SCN 2006, Maiori, Italy, September 6-8, 2006, Proceedings Springer 2006 |
| 260 | | Helger Lipmaa, Moti Yung, Dongdai Lin: Information Security and Cryptology, Second SKLOIS Conference, Inscrypt 2006, Beijing, China, November 29 - December 1, 2006, Proceedings Springer 2006 |
| 259 | | John G. Brainard, Ari Juels, Ronald L. Rivest, Michael Szydlo, Moti Yung: Fourth-factor authentication: somebody you know. ACM Conference on Computer and Communications Security 2006: 168-178 |
| 258 | | Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yung: Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding. ASIACRYPT 2006: 283-298 |
| 257 | | Tal Malkin, François-Xavier Standaert, Moti Yung: A Comparative Cost/Security Analysis of Fault Attack Countermeasures. FDTC 2006: 159-172 |
| 256 | | Aggelos Kiayias, Moti Yung: Efficient Cryptographic Protocols Realizing E-Markets with Price Discrimination. Financial Cryptography 2006: 311-325 |
| 255 | | Seung Geol Choi, Kunsoo Park, Moti Yung: Short Traceable Signatures Based on Bilinear Pairings. IWSEC 2006: 88-103 |
| 254 | | Adam Young, Moti Yung: Hiding Information Hiding. Information Hiding 2006: 161-171 |
| 253 | | Adam Young, Moti Yung: An Elliptic Curve Backdoor Algorithm for RSASSA. Information Hiding 2006: 355-374 |
| 252 | | Benoît Libert, Jean-Jacques Quisquater, Moti Yung: Efficient Intrusion-Resilient Signatures Without Random Oracles. Inscrypt 2006: 27-41 |
| 251 | | Moti Yung, Yunlei Zhao: Interactive Zero-Knowledge with Restricted Random Oracles. TCC 2006: 21-40 |
| 250 | | Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung: Threshold and Proactive Pseudo-Random Permutations. TCC 2006: 542-560 |
| 249 | | Adam L. Young, Moti Yung: On Fundamental Limitations of Proving Data Theft. IEEE Transactions on Information Forensics and Security 1(4): 524-531 (2006) |
| 248 | | Aggelos Kiayias, Moti Yung: Secure scalable group signature with dynamic joins and separable authorities. IJSN 1(1/2): 24-45 (2006) |
| 247 | | Jonathan Katz, Moti Yung: Characterization of Security Notions for Probabilistic Private-Key Encryption. J. Cryptology 19(1): 67-95 (2006) |
| 2005 | ||
| 246 | | Reihaneh Safavi-Naini, Moti Yung: Proceedings of the Fifth ACM Workshop on Digital Rights Management, Alexandria, VA, USA, November 7, 2005 ACM 2005 |
| 245 | | John Ioannidis, Angelos D. Keromytis, Moti Yung: Applied Cryptography and Network Security, Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005, Proceedings ACNS 2005 |
| 244 | | Andrew S. Patrick, Moti Yung: Financial Cryptography and Data Security, 9th International Conference, FC 2005, Roseau, The Commonwealth of Dominica, February 28 - March 3, 2005, Revised Papers Springer 2005 |
| 243 | | Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, Moti Yung: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings Springer 2005 |
| 242 | | Dengguo Feng, Dongdai Lin, Moti Yung: Information Security and Cryptology, First SKLOIS Conference, CISC 2005, Beijing, China, December 15-17, 2005, Proceedings Springer 2005 |
| 241 | | Cheol-Min Park, Myung-Hwan Kim, Moti Yung: A Remark on Implementing the Weil Pairing. CISC 2005: 313-323 |
| 240 | | Adam Young, Moti Yung: Malicious Cryptography: Kleptographic Aspects. CT-RSA 2005: 7-18 |
| 239 | | Aggelos Kiayias, Moti Yung: Group Signatures with Efficient Concurrent Join. EUROCRYPT 2005: 198-214 |
| 238 | | Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung: "Trust Engineering: " From Requirements to System Design and Maintenance - A Working National Lottery System Experience. ISC 2005: 44-58 |
| 237 | | Aggelos Kiayias, Moti Yung: Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers. Mycrypt 2005: 151-170 |
| 236 | | Adam Young, Moti Yung: Questionable Encryption and Its Applications. Mycrypt 2005: 210-221 |
| 235 | | Adam Young, Moti Yung: A Space Efficient Backdoor in RSA and Its Applications. Selected Areas in Cryptography 2005: 128-143 |
| 234 | | Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung: Scalable public-key tracing and revoking. Distributed Computing 17(4): 323-347 (2005) |
| 233 | | Moti Yung, Yunlei Zhao: Constant-Round Concurrently-Secure rZK in the (Real) Bare Public-Key Model Electronic Colloquium on Computational Complexity (ECCC)(048): (2005) |
| 2004 | ||
| 232 | | Aggelos Kiayias, Moti Yung: Proceedings of the 2004 ACM Workshop on Digital Rights Management 2004, Washington, DC, USA, October 25, 2004 ACM 2004 |
| 231 | | Kijoon Chae, Moti Yung: Information Security Applications, 4th International Workshop, WISA 2003, Jeju Island, Korea, August 25-27, 2003, Revised Papers Springer 2004 |
| 230 | | Markus Jakobsson, Moti Yung, Jianying Zhou: Applied Cryptography and Network Security, Second International Conference, ACNS 2004, Yellow Mountain, China, June 8-11, 2004, Proceedings Springer 2004 |
| 229 | | Chae Hoon Lim, Moti Yung: Information Security Applications, 5th International Workshop, WISA 2004, Jeju Island, Korea, August 23-25, 2004, Revised Selected Papers Springer 2004 |
| 228 | | Luke McAven, Reihaneh Safavi-Naini, Moti Yung: Unconditionally Secure Encryption Under Strong Attacks. ACISP 2004: 427-439 |
| 227 | | Shouhuai Xu, Moti Yung: k-anonymous secret handshakes with reusable credentials. ACM Conference on Computer and Communications Security 2004: 158-167 |
| 226 | | Theodore Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung: The dual receiver cryptosystem and its applications. ACM Conference on Computer and Communications Security 2004: 330-343 |
| 225 | | Aggelos Kiayias, Moti Yung: Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice. ASIACRYPT 2004: 401-416 |
| 224 | | Shouhuai Xu, Moti Yung: Accountable Ring Signatures: A Smart Card Approach. CARDIS 2004: 271-286 |
| 223 | | Adam Young, Moti Yung: A Key Recovery System as Secure as Factoring. CT-RSA 2004: 129-142 |
| 222 | | Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung: A Generic Construction for Intrusion-Resilient Public-Key Encryption. CT-RSA 2004: 81-98 |
| 221 | | Tal Malkin, Satoshi Obana, Moti Yung: The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures. EUROCRYPT 2004: 306-322 |
| 220 | | Aggelos Kiayias, Yiannis Tsiounis, Moti Yung: Traceable Signatures. EUROCRYPT 2004: 571-589 |
| 219 | | Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung: Electronic National Lotteries. Financial Cryptography 2004: 147-163 |
| 218 | | Aggelos Kiayias, Moti Yung: The Vector-Ballot e-Voting Approach. Financial Cryptography 2004: 72-89 |
| 217 | | Luke McAven, Reihaneh Safavi-Naini, Moti Yung: Symmetric Authentication Codes with Secrecy and Unconditionally Secure Authenticated Encryption. INDOCRYPT 2004: 148-161 |
| 216 | | Reihaneh Safavi-Naini, Luke McAven, Moti Yung: General Group Authentication Codes and Their Relation to "Unconditionally-Secure Signatures". Public Key Cryptography 2004: 231-247 |
| 215 | | Adam Young, Moti Yung: Relationships Between Diffie-Hellman and "Index Oracles". SCN 2004: 16-32 |
| 214 | | Adam Young, Moti Yung: A Subliminal Channel in Secret Block Ciphers. Selected Areas in Cryptography 2004: 198-211 |
| 213 | | Poorvi L. Vora, Ben Adida, Ren Bucholz, David Chaum, David L. Dill, David R. Jefferson, Douglas W. Jones, William Lattin, Aviel D. Rubin, Michael I. Shamos, Moti Yung: Evaluation of voting systems. Commun. ACM 47(11): 144 (2004) |
| 212 | | Matthew K. Franklin, Moti Yung: Secure Hypergraphs: Privacy from Partial Broadcast. SIAM J. Discrete Math. 18(3): 437-450 (2004) |
| 2003 | ||
| 211 | | Moti Yung: Proceedings of the 2003 ACM workshop on Digital rights management 2003, Washington, DC, USA, October 27, 2003 ACM 2003 |
| 210 | | Jianying Zhou, Moti Yung, Yongfei Han: Applied Cryptography and Network Security, First International Conference, ACNS 2003. Kunming, China, October 16-19, 2003, Proceedings Springer 2003 |
| 209 | | Adam Young, Moti Yung: Backdoor Attacks on Black-Box Ciphers Exploiting Low-Entropy Plaintexts. ACISP 2003: 297-311 |
| 208 | | Jonathan Katz, Moti Yung: Scalable Protocols for Authenticated Group Key Exchange. CRYPTO 2003: 110-125 |
| 207 | | Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung: Intrusion-Resilient Public-Key Encryption. CT-RSA 2003: 19-32 |
| 206 | | Mario Baldi, Yoram Ofek, Moti Yung: Idiosyncratic Signatures for Authenticated Execution of Management Code. DSOM 2003: 204-206 |
| 205 | | Aggelos Kiayias, Moti Yung: Extracting Group Signatures from Traitor Tracing Schemes. EUROCRYPT 2003: 630-648 |
| 204 | | Moti Yung: Trusted Computing Platforms: The Good, the Bad, and the Ugly. Financial Cryptography 2003: 250-254 |
| 203 | | Aggelos Kiayias, Moti Yung: Non-interactive Zero-Sharing with Applications to Private Distributed Decision Making. Financial Cryptography 2003: 303-320 |
| 202 | | Shouhuai Xu, Moti Yung: Retrofitting Fairness on the Original RSA-Based E-cash. Financial Cryptography 2003: 51-68 |
| 201 | | Mario Baldi, Yoram Ofek, Moti Yung: The TrustedFlow (TM) Protocol-Idiosyncratic Signatures for Authenticated Execution. IAW 2003: 288-291 |
| 200 | | Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung: Decoding of Interleaved Reed Solomon Codes over Noisy Data. ICALP 2003: 97-108 |
| 199 | | Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung: Scalable public-key tracing and revoking. PODC 2003: 190-199 |
| 198 | | Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung: Strong Key-Insulated Signature Schemes. Public Key Cryptography 2003: 130-144 |
| 2002 | ||
| 197 | | Moti Yung: Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings Springer 2002 |
| 196 | | Hyun-Jeong Kim, Dong Hoon Lee, Moti Yung: Privacy against Piracy: Protecting Two-Level Revocable P-K Traitor Tracing. ACISP 2002: 482-496 |
| 195 | | Jonathan Katz, Moti Yung: Threshold Cryptosystems Based on Factoring. ASIACRYPT 2002: 192-205 |
| 194 | | Moti Yung: Crypto-integrity. ASIACRYPT 2002: 567-573 |
| 193 | | Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, Moti Yung: Observability Analysis - Detecting When Improved Cryptosystems Fail. CT-RSA 2002: 17-29 |
| 192 | | Aggelos Kiayias, Moti Yung: Breaking and Repairing Asymmetric Public-Key Traitor Tracing. Digital Rights Management Workshop 2002: 32-50 |
| 191 | | Aggelos Kiayias, Moti Yung: Traitor Tracing with Constant Transmission Rate. EUROCRYPT 2002: 450-465 |
| 190 | | Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung: Key-Insulated Public Key Cryptosystems. EUROCRYPT 2002: 65-82 |
| 189 | | Shouhuai Xu, Moti Yung: The Dark Side of Threshold Cryptography. Financial Cryptography 2002: 198-219 |
| 188 | | Daniel E. Geer Jr., Moti Yung: Split-and-Delegate: Threshold Cryptography for the Masses. Financial Cryptography 2002: 220-237 |
| 187 | | Aggelos Kiayias, Moti Yung: Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. ICALP 2002: 232-243 |
| 186 | | Yevgeniy Dodis, Moti Yung: Exposure-Resilience for Free: The Hierarchical ID-based Encryption Case. IEEE Security in Storage Workshop 2002: 45-52 |
| 185 | | Aggelos Kiayias, Moti Yung: Self-tallying Elections and Perfect Ballot Secrecy. Public Key Cryptography 2002: 141-158 |
| 184 | | Jonathan Katz, Rafail Ostrovsky, Moti Yung: Forward Secrecy in Password-Only Key Exchange Protocols. SCN 2002: 29-44 |
| 183 | | Aggelos Kiayias, Moti Yung: Cryptographic Hardness based on the Decoding of Reed-Solomon Codes with Applications Electronic Colloquium on Computational Complexity (ECCC)(017): (2002) |
| 182 | | Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti Yung: Self-Stabilizing Symmetry Breaking in Constant Space. SIAM J. Comput. 31(5): 1571-1595 (2002) |
| 181 | | Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptively secure distributed public-key systems. Theor. Comput. Sci. 287(2): 535-561 (2002) |
| 2001 | ||
| 180 | | Adam Young, Moti Yung: Bandwidth-Optimal Kleptographic Attacks. CHES 2001: 235-250 |
| 179 | | Aggelos Kiayias, Moti Yung: Self Protecting Pirates and Black-Box Traitor Tracing. CRYPTO 2001: 63-79 |
| 178 | | Marc Joye, Jean-Jacques Quisquater, Moti Yung: On the Power of Misbehaving Adversaries and Security Analysis of the Original EPOC. CT-RSA 2001: 208-222 |
| 177 | | Aggelos Kiayias, Moti Yung: On Crafty Pirates and Foxy Tracers. Digital Rights Management Workshop 2001: 22-39 |
| 176 | | Jonathan Katz, Rafail Ostrovsky, Moti Yung: Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. EUROCRYPT 2001: 475-494 |
| 175 | | Enrico Buonanno, Jonathan Katz, Moti Yung: Incremental Unforgeable Encryption. FSE 2001: 109-124 |
| 174 | | Ed Gerck, C. Andrew Neff, Ronald L. Rivest, Aviel D. Rubin, Moti Yung: The Business of Electronic Voting. Financial Cryptography 2001: 234-259 |
| 173 | | Aggelos Kiayias, Moti Yung: Secure Games with Polynomial Expressions. ICALP 2001: 939-950 |
| 172 | | Enriquillo Valdez, Moti Yung: DISSECT: DIStribution for SECurity Tool. ISC 2001: 125-143 |
| 171 | | Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptive Security for the Additive-Sharing Based Proactive RSA. Public Key Cryptography 2001: 240-263 |
| 170 | | Adam Young, Moti Yung: A PVSS as Hard as Discrete Log and Shareholder Separability. Public Key Cryptography 2001: 287-299 |
| 169 | | Aggelos Kiayias, Moti Yung: Polynomial Reconstruction Based Cryptography. Selected Areas in Cryptography 2001: 129-133 |
| 168 | | David M'Raïhi, Moti Yung: E-commerce applications of smart cards. Computer Networks 36(4): 453-472 (2001) |
| 2000 | ||
| 167 | | Johan Håstad, Jakob Jonsson, Ari Juels, Moti Yung: Funkspiel schemes: an alternative to conventional tamper resistance. ACM Conference on Computer and Communications Security 2000: 125-133 |
| 166 | | Adam Young, Moti Yung: Towards Signature-Only Signature Schemes. ASIACRYPT 2000: 97-115 |
| 165 | | Shouhuai Xu, Moti Yung, Gendu Zhang: Friendly Observers Ease Off-Line E-Cash. CARDIS 2000: 3-18 |
| 164 | | Jonathan Katz, Moti Yung: Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation. FSE 2000: 284-299 |
| 163 | | Moti Yung: Payment Systems: The Next Generation. Financial Cryptography 2000: 136-139 |
| 162 | | Tomas Sander, Amnon Ta-Shma, Moti Yung: Blind, Auditable Membership Proofs. Financial Cryptography 2000: 53-71 |
| 161 | | Adam Young, Moti Yung: Hash to the Rescue: Space Minimization for PKI Directories. ICISC 2000: 235-245 |
| 160 | | Ernest F. Brickell, David Pointcheval, Serge Vaudenay, Moti Yung: Design Validations for Discrete Logarithm Based Signature Schemes. Public Key Cryptography 2000: 276-292 |
| 159 | | Yair Frankel, Philip D. MacKenzie, Moti Yung: "Psyeudorandom Intermixing": A Tool for Shared Cryptography. Public Key Cryptography 2000: 306-325 |
| 158 | | Adam Young, Moti Yung: RSA-Based Auto-recoverable Cryptosystems. Public Key Cryptography 2000: 326-341 |
| 157 | | Jonathan Katz, Moti Yung: Complete characterization of security notions for probabilistic private-key encryption. STOC 2000: 245-254 |
| 156 | | Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung: On zero-knowledge proofs (extended abstract): ``from membership to decision''. STOC 2000: 255-264 |
| 155 | | Alain J. Mayer, Yoram Ofek, Moti Yung: Local and congestion-driven fairness algorithm in arbitrary topology networks. IEEE/ACM Trans. Netw. 8(3): 362-372 (2000) |
| 154 | | Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung: Connectivity Properties in Random Regular Graphs with Edge Faults. Int. J. Found. Comput. Sci. 11(2): 247-262 (2000) |
| 153 | | Matthew K. Franklin, Zvi Galil, Moti Yung: Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. J. ACM 47(2): 225-243 (2000) |
| 152 | | Yoram Ofek, Moti Yung: Combined Asynchronous/Synchronous Packet Switching Architecture: QoS Guarantees for Integrated Parallel Computing and Real-Time Traffic. J. Parallel Distrib. Comput. 60(3): 275-295 (2000) |
| 151 | | Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung: Robust Parallel Computations through Randomization. Theory Comput. Syst. 33(5/6): 427-464 (2000) |
| 1999 | ||
| 150 | | Alain J. Mayer, Moti Yung: Secure Protocol Transformation via "Expansion": From Two-Party to Groups. ACM Conference on Computer and Communications Security 1999: 83-92 |
| 149 | | Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptively-Secure Optimal-Resilience Proactive RSA. ASIACRYPT 1999: 180-194 |
| 148 | | Adam Young, Moti Yung: Auto-recoverable Auto-certifiable Cryptosystems (A Survey). CQRE 1999: 204-218 |
| 147 | | Markus Jakobsson, David M'Raïhi, Yiannis Tsiounis, Moti Yung: Electronic Payments: Where Do We Go from Here?. CQRE 1999: 43-63 |
| 146 | | Matthew K. Franklin, Juan A. Garay, Moti Yung: Self-Testing/Correcting Protocols (Extended Abstract). DISC 1999: 269-283 |
| 145 | | Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptively-Secure Distributed Public-Key Systems. ESA 1999: 4-27 |
| 144 | | Tomas Sander, Adam Young, Moti Yung: Non-Interactive CryptoComputing For NC1. FOCS 1999: 554-567 |
| 143 | | Markus Jakobsson, Julien P. Stern, Moti Yung: Scramble All, Encrypt Small. FSE 1999: 95-111 |
| 142 | | Yair Frankel, Moti Yung: Cryptosystems Robust against "Dynamic Faults" Meet Enterprise Needs for Organizational "Change Control". Financial Cryptography 1999: 241-252 |
| 141 | | Shingo Miyazaki, Kouichi Sakurai, Moti Yung: On Threshold RSA-Signing with no Dealer. ICISC 1999: 197-207 |
| 140 | | Pascal Paillier, Moti Yung: Self-Escrowed Public-Key Infrastructures. ICISC 1999: 257-268 |
| 139 | | Shouhuai Xu, Moti Yung, Gendu Zhang, Hong Zhu: Money Conservation via Atomicity in Fair Off-Line E-Cash. ISW 1999: 14-31 |
| 138 | | Enriquillo Valdez, Moti Yung: Software DisEngineering: Program Hiding Architecture and Experiments. Information Hiding 1999: 379-394 |
| 137 | | Helena Handschuh, Yiannis Tsiounis, Moti Yung: Decision Oracles are Equivalent to Matching Oracles. Public Key Cryptography 1999: 276-289 |
| 136 | | Adam Young, Moti Yung: Auto-Recoverable Cryptosystems with Faster Initialization and the Escrow Hierarchy. Public Key Cryptography 1999: 306-314 |
| 135 | | Bülent Yener, Yoram Ofek, Moti Yung: Convergence routing on disjoint spanning trees. Computer Networks 31(5): 429-443 (1999) |
| 134 | | Yoram Ofek, Moti Yung: Access regulation mechanism for switch-based LAN. Computer Networks 31(5): 505-518 (1999) |
| 1998 | ||
| 133 | | Adam Young, Moti Yung: Finding Length-3 Positive Cunningham Chains. ANTS 1998: 289-298 |
| 132 | | Yair Frankel, Yiannis Tsiounis, Moti Yung: Fair Off-Line e-cash Made Easy. ASIACRYPT 1998: 257-270 |
| 131 | | Yair Frankel, Moti Yung: How to Say "YES" with Smart Cards. CARDIS 1998: 203-212 |
| 130 | | Adam Young, Moti Yung: Auto-Recoverable Auto-Certifiable Cryptosystems. EUROCRYPT 1998: 17-31 |
| 129 | | Adam Young, Moti Yung: Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs. FSE 1998: 122-133 |
| 128 | | Markus Jakobsson, Moti Yung: On Assurance Structures for WWW Commerce. Financial Cryptography 1998: 141-157 |
| 127 | | Yair Frankel, David W. Kravitz, Charles T. Montgomery, Moti Yung: Beyond Identity: Warranty-Based Digital Signature Transactions. Financial Cryptography 1998: 241-253 |
| 126 | | Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung: Image Density is Complete for Non-Interactive-SZK (Extended Abstract). ICALP 1998: 784-795 |
| 125 | | Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung: Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it. ISAAC 1998: 59-68 |
| 124 | | Yair Frankel, Philip D. MacKenzie, Moti Yung: Robust Efficient Distributed RSA-Key Generation. PODC 1998: 320 |
| 123 | | Yair Frankel, Moti Yung: Distributed Public Key Cryptosystems. Public Key Cryptography 1998: 1-13 |
| 122 | | Yiannis Tsiounis, Moti Yung: On the Security of ElGamal Based Encryption. Public Key Cryptography 1998: 117-134 |
| 121 | | Tatsuaki Okamoto, Moti Yung: Lower Bounds on Term-Based Divisible Cash Systems. Public Key Cryptography 1998: 72-82 |
| 120 | | Spyros C. Kontogiannis, Grammati E. Pantziou, Paul G. Spirakis, Moti Yung: ``Dynamic-Fault-Prone BSP'': A Paradigm for Robust Computations in Changing Environments. SPAA 1998: 37-46 |
| 119 | | Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung: Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols. STACS 1998: 511-521 |
| 118 | | Yair Frankel, Philip D. MacKenzie, Moti Yung: Robust Efficient Distributed RSA-Key Generation. STOC 1998: 663-672 |
| 117 | | Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung: Perfectly Secure Key Distribution for Dynamic Conferences. Inf. Comput. 146(1): 1-23 (1998) |
| 116 | | Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. J. Cryptology 11(2): 87-108 (1998) |
| 1997 | ||
| 115 | | Amir Herzberg, Markus Jakobsson, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung: Proactive Public Key and Signature Systems. ACM Conference on Computer and Communications Security 1997: 100-110 |
| 114 | | Adam Young, Moti Yung: The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. CRYPTO 1997: 264-276 |
| 113 | | Giovanni Di Crescenzo, Tatsuaki Okamoto, Moti Yung: Keeping the SZK-Verifier Honest Unconditionally. CRYPTO 1997: 31-45 |
| 112 | | Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung: Proactive RSA. CRYPTO 1997: 440-454 |
| 111 | | Mihir Bellare, Markus Jakobsson, Moti Yung: Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function. EUROCRYPT 1997: 280-305 |
| 110 | | Markus Jakobsson, Moti Yung: Distributed "Magic Ink" Signatures. EUROCRYPT 1997: 450-464 |
| 109 | | Adam Young, Moti Yung: Kleptography: Using Cryptography Against Cryptography. EUROCRYPT 1997: 62-74 |
| 108 | | Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung: Optimal Resilience Proactive Public-Key Cryptosystems. FOCS 1997: 384-393 |
| 107 | | Adam Young, Moti Yung: Sliding Encryption: A Cryptographic Tool for Mobile Agents. FSE 1997: 230-241 |
| 106 | | George I. Davida, Yair Frankel, Yiannis Tsiounis, Moti Yung: Anonymity Control in E-Cash Systems. Financial Cryptography 1997: 1-16 |
| 105 | | Markus Jakobsson, Moti Yung: Applying Anti-Trust Policies to Increase Trust in a Versatile E-Money System. Financial Cryptography 1997: 217-238 |
| 104 | | Yair Frankel, Moti Yung: On Characterization of Escrow Encryption Schemes. ICALP 1997: 705-715 |
| 103 | | Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung: Zero-knowledge proofs of decision power: new protocols and optimal round-complexity. ICICS 1997: 17-27 |
| 102 | | Adam Young, Moti Yung: Deniable Password Snatching: On the Possibility of Evasive Electronic Espionage. IEEE Symposium on Security and Privacy 1997: 224-235 |
| 101 | | Philippe A. Janson, Gene Tsudik, Moti Yung: Scalability and Flexibility in Authentication Services: The KryptoKnight Approach. INFOCOM 1997: 725-736 |
| 100 | | Yoram Ofek, Bülent Yener, Moti Yung: Concurrent Asynchronous Broadcast on the MetaNet. IEEE Trans. Computers 46(7): 737-748 (1997) |
| 99 | | Bülent Yener, Yoram Ofek, Moti Yung: Combinatorial design of congestion-free networks. IEEE/ACM Trans. Netw. 5(6): 989-1000 (1997) |
| 98 | | Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung: Efficient On-Line Call Control Algorithms. J. Algorithms 23(1): 180-194 (1997) |
| 97 | | Bülent Yener, Inderpal S. Bhandari, Yoram Ofek, Moti Yung: Fault-Tolerant Convergence Routing. J. Parallel Distrib. Comput. 42(2): 173-183 (1997) |
| 96 | | Xiangdong Yu, Moti Yung: Scheduling Task-Trees with Additive Scales on Parallel/Distributed Machines. Theor. Comput. Sci. 181(2): 357-378 (1997) |
| 95 | | Yehuda Afek, Shay Kutten, Moti Yung: The Local Detection Paradigm and Its Application to Self-Stabilization. Theor. Comput. Sci. 186(1-2): 199-229 (1997) |
| 1996 | ||
| 94 | | Markus Jakobsson, Moti Yung: Revokable and Versatile Electronic Money (extended abstract). ACM Conference on Computer and Communications Security 1996: 76-87 |
| 93 | | Yair Frankel, Yiannis Tsiounis, Moti Yung: "Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash. ASIACRYPT 1996: 286-300 |
| 92 | | Vasant Shanbhogue, Moti Yung: Distributed Computing in Asynchronous Networks with Byzantine Edges. COCOON 1996: 352-360 |
| 91 | | Markus Jakobsson, Moti Yung: Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers. CRYPTO 1996: 186-200 |
| 90 | | Adam Young, Moti Yung: The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone? CRYPTO 1996: 89-103 |
| 89 | | Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, Moti Yung: Multi-Autority Secret-Ballot Elections with Linear Work. EUROCRYPT 1996: 72-83 |
| 88 | | Xiangdong Yu, Moti Yung: Agent Rendezvous: A Dynamic Symmetry-Breaking Problem. ICALP 1996: 610-621 |
| 87 | | Adam Young, Moti Yung: Cryptovirology: Extortion-Based Security Threats and Countermeasures. IEEE Symposium on Security and Privacy 1996: 129-140 |
| 86 | | Chung-Sheng Li, Yoram Ofek, Moti Yung: "Time-Driven Priority" Flow Control for Real-Time Heterogeneous Internetworking. INFOCOM 1996: 189-197 |
| 85 | | Alain J. Mayer, Yoram Ofek, Moti Yung: Approximating Max-Min Fair Rates via Distributed Local Scheduling with Partial Information. INFOCOM 1996: 928-936 |
| 84 | | Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya, Moti Yung: A Progress Report on Subliminal-Free Channels. Information Hiding 1996: 157-168 |
| 83 | | Yair Frankel, Peter Gemmell, Moti Yung: Witness-Based Cryptographic Program Checking and Applications (an Announcement). PODC 1996: 211 |
| 82 | | Alain J. Mayer, Rafail Ostrovsky, Moti Yung: Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. SODA 1996: 564-573 |
| 81 | | Yair Frankel, Peter Gemmell, Moti Yung: Witness-Based Cryptographic Program Checking and Robust Function Sharing. STOC 1996: 499-508 |
| 80 | | Mihir Bellare, Moti Yung: Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation. J. Cryptology 9(3): 149-166 (1996) |
| 1995 | ||
| 79 | | Xiangdong Yu, Moti Yung: Scheduling Task-Tree with Additive Scales on Parallel / Distributed Machines. COCOON 1995: 607-616 |
| 78 | | Yair Frankel, Moti Yung: Escrow Encryption Systems Visited: Attacks, Analysis and Designs. CRYPTO 1995: 222-235 |
| 77 | | Yair Frankel, Moti Yung: Cryptoanalysis of the Immunized LL Public Key Systems. CRYPTO 1995: 287-296 |
| 76 | | Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung: Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. CRYPTO 1995: 339-352 |
| 75 | | Noga Alon, Zvi Galil, Moti Yung: Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. ESA 1995: 523-537 |
| 74 | | Zvi Galil, Alain J. Mayer, Moti Yung: Resolving Message Complexity of Byzantine Agreement and beyond. FOCS 1995: 724-733 |
| 73 | | Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung: Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. ICALP 1995: 159-170 |
| 72 | | Bülent Yener, Yoram Ofek, Moti Yung: Topological Design of Loss-Free Switch-Based LANs. INFOCOM 1995: 88-96 |
| 71 | | Alain J. Mayer, Yoram Ofek, Moti Yung: Local Fairness in General-Topology Networks with Convergence Routing. INFOCOM 1995: 891-899 |
| 70 | | Matthew K. Franklin, Moti Yung: Secure hypergraphs: privacy from partial broadcast (Extended Abstract). STOC 1995: 36-44 |
| 69 | | Ray Bird, Inder S. Gopal, Amir Herzberg, Philippe A. Janson, Shay Kutten, Refik Molva, Moti Yung: The KryptoKnight family of light-weight protocols for authentication and key distribution. IEEE/ACM Trans. Netw. 3(1): 31-41 (1995) |
| 68 | | Yoram Ofek, Moti Yung: METANET principles of an arbitrary topology LAN. IEEE/ACM Trans. Netw. 3(2): 169-180 (1995) |
| 1994 | ||
| 67 | | Giuseppe Parlati, Moti Yung: Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking. ESA 1994: 183-201 |
| 66 | | Matthew K. Franklin, Moti Yung: The Blinding of Weak Signatures (Extended Abstract). EUROCRYPT 1994: 67-76 |
| 65 | | Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung: On Monotone Formula Closure of SZK FOCS 1994: 454-465 |
| 64 | | Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung: Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing. ICALP 1994: 508-519 |
| 63 | | Yoram Ofek, Moti Yung: The Integrated MetaNet Architecture: A Switch-Based Multimedia LAN for Parallel Computing and Real-Time Traffic. INFOCOM 1994: 802-811 |
| 62 | | Roberto De Prisco, Alain J. Mayer, Moti Yung: Time-Optimal Message-Efficient Work Performance in the Presence of Faults (Extended Summary). PODC 1994: 161-172 |
| 61 | | William Aiello, Ramarathnam Venkatesan, Moti Yung: Coins, Weights and Contention in Balancing Networks. PODC 1994: 193-205 |
| 60 | | Alfredo De Santis, Yvo Desmedt, Yair Frankel, Moti Yung: How to share a function securely. STOC 1994: 522-533 |
| 59 | | Xiangdong Yu, Moti Yung: Space Lower-Bounds for Pseudorandom-Generators. Structure in Complexity Theory Conference 1994: 186-197 |
| 58 | | Moti Yung: Secure Distributed Computing: Theory and Practice. WDAG 1994: 53-73 |
| 57 | | Yoram Ofek, Moti Yung: Routing and Flow Control on the MetaNet: An Overview. Computer Networks and ISDN Systems 26(6-8): 859-872 (1994) |
| 1993 | ||
| 56 | | Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Interactive Hashing Simplifies Zero-Knowledge Protocol Design. EUROCRYPT 1993: 267-273 |
| 55 | | Matthew K. Franklin, Zvi Galil, Moti Yung: Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems FOCS 1993: 670-679 |
| 54 | | Matthew K. Franklin, Moti Yung: Secure and Efficient Off-Line Digital Money (Extended Abstract). ICALP 1993: 265-276 |
| 53 | | Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung: Efficient On-Line Call Control Algorithms. ISTCS 1993: 285-293 |
| 52 | | Ray Bird, Inder S. Gopal, Amir Herzberg, Philippe A. Janson, Shay Kutten, Refik Molva, Moti Yung: Systematic Design of a Family of Attack-Resistant Authentication Protocols. IEEE Journal on Selected Areas in Communications 11(5): 679-693 (1993) |
| 51 | | Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung: Perfectly Secure Message Transmission. J. ACM 40(1): 17-47 (1993) |
| 50 | | David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993) |
| 1992 | ||
| 49 | | Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract). CRYPTO 1992: 196-214 |
| 48 | | Mihir Bellare, Moti Yung: Certifying Cryptographic Tools: The Case of Trapdoor Permutations. CRYPTO 1992: 442-460 |
| 47 | | Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung: Perfectly-Secure Key Distribution for Dynamic Conferences. CRYPTO 1992: 471-486 |
| 46 | | Alfredo De Santis, Giuseppe Persiano, Moti Yung: One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier. ICALP 1992: 28-40 |
| 45 | | Yvo Desmedt, Yair Frankel, Moti Yung: Multi-Receiver/Multi-Sender Network Security: Efficient Authenticated Multicast/Feedback. INFOCOM 1992: 2045-2054 |
| 44 | | Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung: Secure Commitment Against A Powerful Adversary. STACS 1992: 439-448 |
| 43 | | Alain J. Mayer, Yoram Ofek, Rafail Ostrovsky, Moti Yung: Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract) STOC 1992: 667-678 |
| 42 | | Matthew K. Franklin, Moti Yung: Communication Complexity of Secure Computation (Extended Abstract) STOC 1992: 699-710 |
| 41 | | Othar Hansson, Andrew Mayer, Moti Yung: Criticizing solutions to relaxed models yields powerful admissible heuristics. Inf. Sci. 63(3): 207-227 (1992) |
| 40 | | David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992) |
| 1991 | ||
| 39 | | Ray Bird, Inder S. Gopal, Amir Herzberg, Philippe A. Janson, Shay Kutten, Refik Molva, Moti Yung: Systematic Design of Two-Party Authentication Protocols. CRYPTO 1991: 44-61 |
| 38 | | Yvo Desmedt, Moti Yung: Weakness of Undeniable Signature Schemes (Extended Abstract). EUROCRYPT 1991: 205-220 |
| 37 | | Yoram Ofek, Moti Yung: Lossless Asynchronous Broadcast-with-Feedback on the MetaNet Architecture. INFOCOM 1991: 1050-1063 |
| 36 | | Rafail Ostrovsky, Moti Yung: How to Withstand Mobile Virus Attacks (Extended Abstract). PODC 1991: 51-59 |
| 35 | | Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung: Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. SODA 1991: 158-167 |
| 34 | | Gilles Brassard, Claude Crépeau, Moti Yung: Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. Theor. Comput. Sci. 84(1): 23-52 (1991) |
| 1990 | ||
| 33 | | Yvo Desmedt, Moti Yung: Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract). CRYPTO 1990: 177-188 |
| 32 | | Alfredo De Santis, Moti Yung: Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems. CRYPTO 1990: 366-377 |
| 31 | | Gilles Brassard, Moti Yung: One-Way Group Actions. CRYPTO 1990: 94-107 |
| 30 | | Alfredo De Santis, Moti Yung: On the Design of Provably Secure Cryptographic Hash Functions. EUROCRYPT 1990: 412-431 |
| 29 | | Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung: Perfectly Secure Message Transmission FOCS 1990: 36-45 |
| 28 | | Yoram Ofek, Moti Yung: Principle for High Speed Network Control: Congestion- and Deadlock-Freeness, Self-Routing, and a Single Buffer per Link. PODC 1990: 161-175 |
| 27 | | David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA 1990: 1-11 |
| 26 | | Moni Naor, Moti Yung: Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks STOC 1990: 427-437 |
| 25 | | Yehuda Afek, Shay Kutten, Moti Yung: Memory-Efficient Self Stabilizing Protocols for General Networks. WDAG 1990: 15-28 |
| 24 | | Yoram Ofek, Moti Yung: Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed Networks. WDAG 1990: 192-212 |
| 23 | | Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung: The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks Inf. Comput. 84(1): 97-118 (1990) |
| 1989 | ||
| 22 | | Gilles Brassard, Claude Crépeau, Moti Yung: Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract). EUROCRYPT 1989: 192-195 |
| 21 | | Moti Yung: Zero-Knowledge Proofs of Computational Power (Extended Summary). EUROCRYPT 1989: 196-207 |
| 20 | | Zvi Galil, Stuart Haber, Moti Yung: A Secure Public-key Authentication Scheme. EUROCRYPT 1989: 3-15 |
| 19 | | Michael Kharitonov, Andrew V. Goldberg, Moti Yung: Lower Bounds for Pseudorandom Number Generators FOCS 1989: 242-247 |
| 18 | | Gilles Brassard, Claude Crépeau, Moti Yung: Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds. ICALP 1989: 123-136 |
| 17 | | Moni Naor, Moti Yung: Universal One-Way Hash Functions and their Cryptographic Applications STOC 1989: 33-43 |
| 16 | | Marek Chrobak, Moti Yung: Fast Algorithms for Edge-Coloring Planar Graphs. J. Algorithms 10(1): 35-51 (1989) |
| 15 | | Bruce Abramson, Moti Yung: Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem. J. Parallel Distrib. Comput. 6(3): 649-662 (1989) |
| 14 | | Zvi Galil, Stuart Haber, Moti Yung: Minimum-Knowledge Interactive Proofs for Decision Problems. SIAM J. Comput. 18(4): 711-739 (1989) |
| 1988 | ||
| 13 | | Marek Chrobak, Moti Yung: Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs. AWOC 1988: 11-23 |
| 12 | | Yehuda Afek, Gad M. Landau, Baruch Schieber, Moti Yung: The Power of Multimedia: Combining Point-to Point and Multi-Access Networks. PODC 1988: 90-104 |
| 1987 | ||
| 11 | | Zvi Galil, Stuart Haber, Moti Yung: Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model. CRYPTO 1987: 135-155 |
| 10 | | Russell Impagliazzo, Moti Yung: Direct Minimum-Knowledge Computations. CRYPTO 1987: 40-51 |
| 9 | | Zvi Galil, Moti Yung: Partitioned Encryption and Achieving Simultaneity by Partitioning. Inf. Process. Lett. 26(2): 81-88 (1987) |
| 8 | | Zvi Galil, Gad M. Landau, Mordechai M. Yung: Distributed Algorithms in Synchronous Broadcasting Networks. Theor. Comput. Sci. 49: 171-184 (1987) |
| 1986 | ||
| 7 | | Bruce Abramson, Moti Yung: Construction Through Decomposition: A Divide-and-Conquer Algoithm for the N-Queens Problem. FJCC 1986: 620-628 |
| 6 | | Josh Cohen Benaloh, Moti Yung: Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract). PODC 1986: 52-62 |
| 1985 | ||
| 5 | | Zvi Galil, Stuart Haber, Moti Yung: Symmetric Public-Key Encryption. CRYPTO 1985: 128-137 |
| 4 | | Zvi Galil, Stuart Haber, Moti Yung: A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems (Extended Abstract) FOCS 1985: 360-371 |
| 3 | | Gad M. Landau, Mordechai M. Yung, Zvi Galil: Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract). ICALP 1985: 363-372 |
| 2 | | Mordechai M. Yung: A Secure and Useful `Keyless Cryptosystem'. Inf. Process. Lett. 21(1): 35-38 (1985) |
| 1984 | ||
| 1 | | Moti Yung: Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game (Extended Abstract). CRYPTO 1984: 439-453 |
| 1 | Bruce Abramson | [7] [15] |
| 2 | Ben Adida | [213] |
| 3 | Yehuda Afek | [12] [23] [25] [95] |
| 4 | William Aiello | [61] |
| 5 | Noga Alon | [75] |
| 6 | Claudio Agostino Ardagna | [325] |
| 7 | Vijayalakshmi Atluri (Vijay Atluri) | [290] |
| 8 | Mario Baldi | [201] [206] |
| 9 | Feng Bao | [265] |
| 10 | Mihir Bellare | [48] [80] [111] |
| 11 | Steven M. Bellovin | [306] |
| 12 | Josh Cohen Benaloh | [6] |
| 13 | Vicente Benjumea | [280] [300] |
| 14 | Inderpal S. Bhandari | [97] |
| 15 | Ray Bird | [39] [52] [69] |
| 16 | Daniel Bleichenbacher | [200] [268] |
| 17 | Carlo Blundo | [47] [117] |
| 18 | John G. Brainard | [259] |
| 19 | Gilles Brassard | [18] [22] [31] [34] |
| 20 | Ernest F. Brickell | [160] |
| 21 | Ren Bucholz | [ |