default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoti Yung
Mordechai M. Yung
Person information
- affiliation: Google Inc., New York, NY, USA
- affiliation: Columbia University, New York City, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j80]Ghous Amjad, Kevin Yeo, Moti Yung:
RSA Blind Signatures with Public Metadata. Proc. Priv. Enhancing Technol. 2025(1): 37-57 (2025)- [j79]Liron David, Avinatan Hassidim, Yossi David, Moti Yung:
The Battery Insertion Attack: Is Periodic Pseudo-randomization Sufficient for Beacon Privacy? Proc. Priv. Enhancing Technol. 2025(1): 707-719 (2025) - [e79]Xiaofeng Chen, Xinyi Huang, Moti Yung:
Data Security and Privacy Protection - Second International Conference, DSPP 2024, Xi'an, China, October 25-28, 2024, Proceedings, Part I. Lecture Notes in Computer Science 15215, Springer 2025, ISBN 978-981-97-8539-1 [contents] - [e78]Xiaofeng Chen, Xinyi Huang, Moti Yung:
Data Security and Privacy Protection - Second International Conference, DSPP 2024, Xi'an, China, October 25-28, 2024, Proceedings, Part II. Lecture Notes in Computer Science 15216, Springer 2025, ISBN 978-981-97-8545-2 [contents] - 2024
- [c364]Pawel Lorek, Moti Yung, Filip Zagórski:
Mirrored Commitment: Fixing "Randomized Partial Checking" and Applications. ACNS (3) 2024: 3-27 - [c363]Aleksandr Dolgavin
, Mark Yampolskiy, Moti Yung:
Stop Stealing My Data: Sanitizing Stego Channels in 3D Printing Design Files. CODASPY 2024: 211-220 - [c362]Giuseppe Persiano, Duong Hieu Phan, Moti Yung:
Public-Key Anamorphism in (CCA-Secure) Public-Key Encryption and Beyond. CRYPTO (2) 2024: 422-455 - [c361]Patrick Tser Jern Kon, Sina Kamali, Jinyu Pei, Diogo Barradas, Ang Chen, Micah Sherr, Moti Yung:
SpotProxy: Rediscovering the Cloud for Censorship Circumvention. USENIX Security Symposium 2024 - [e77]Chunpeng Ge, Moti Yung:
Information Security and Cryptology - 19th International Conference, Inscrypt 2023, Hangzhou, China, December 9-10, 2023, Revised Selected Papers, Part I. Lecture Notes in Computer Science 14526, Springer 2024, ISBN 978-981-97-0941-0 [contents] - [e76]Chunpeng Ge, Moti Yung:
Information Security and Cryptology - 19th International Conference, Inscrypt 2023, Hangzhou, China, December 9-10, 2023, Revised Selected Papers, Part II. Lecture Notes in Computer Science 14527, Springer 2024, ISBN 978-981-97-0944-1 [contents] - [i98]Aleksandr Dolgavin, Mark Yampolskiy, Moti Yung:
Stop Stealing My Data: Sanitizing Stego Channels in 3D Printing Design Files. CoRR abs/2404.05106 (2024) - [i97]Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou, Jiadong Zhu:
Correcting Subverted Random Oracles. CoRR abs/2404.09442 (2024) - [i96]Deniz Koyuncu, Alex Gittens, Bülent Yener, Moti Yung:
Exploiting the Data Gap: Utilizing Non-ignorable Missingness to Manipulate Model Learning. CoRR abs/2409.04407 (2024) - [i95]Pawel Lorek, Moti Yung, Filip Zagórski:
Mirrored Commitment: Fixing "Randomized Partial Checking" and Applications. IACR Cryptol. ePrint Arch. 2024: 285 (2024) - [i94]Karim Eldefrawy, Benjamin Terner, Moti Yung:
Composing Timed Cryptographic Protocols: Foundations and Applications. IACR Cryptol. ePrint Arch. 2024: 676 (2024) - [i93]Liron David, Omer Berkman, Avinatan Hassidim, David Lazarov, Yossi Matias, Moti Yung:
Cryptiny: Compacting Cryptography for Space-Restricted Channels and its Use-case for IoT-E2EE. IACR Cryptol. ePrint Arch. 2024: 1128 (2024) - [i92]Giuseppe Persiano, Duong Hieu Phan, Moti Yung:
Public-Key Anamorphism in (CCA-secure) Public-Key Encryption and Beyond. IACR Cryptol. ePrint Arch. 2024: 1327 (2024) - [i91]Karim Eldefrawy, Benjamin Terner, Moti Yung:
Challenges in Timed Cryptography: A Position Paper. IACR Cryptol. ePrint Arch. 2024: 1529 (2024) - [i90]Liron David, Avinatan Hassidim, Yossi Matias, Moti Yung:
Is Periodic Pseudo-randomization Sufficient for Beacon Privacy? IACR Cryptol. ePrint Arch. 2024: 1782 (2024) - 2023
- [j78]Ghous Amjad, Sarvar Patel, Giuseppe Persiano, Kevin Yeo, Moti Yung:
Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption. Proc. Priv. Enhancing Technol. 2023(1): 417-436 (2023) - [j77]Miroslaw Kutylowski, Giuseppe Persiano, Duong Hieu Phan, Moti Yung, Marcin Zawada:
The Self-Anti-Censorship Nature of Encryption: On the Prevalence of Anamorphic Cryptography. Proc. Priv. Enhancing Technol. 2023(4): 170-183 (2023) - [c360]Yi Wang, Rongmao Chen, Xinyi Huang, Moti Yung:
Sender-Anamorphic Encryption Reformulated: Achieving Robust and Generic Constructions. ASIACRYPT (6) 2023: 135-167 - [c359]Miroslaw Kutylowski, Giuseppe Persiano, Duong Hieu Phan, Moti Yung, Marcin Zawada:
Anamorphic Signatures: Secrecy from a Dictator Who Only Permits Authentication! CRYPTO (2) 2023: 759-790 - [c358]Shlomi Dolev, Avraam Yagudaev, Moti Yung:
HBSS: (Simple) Hash-Based Stateless Signatures - Hash All the Way to the Rescue! - (Preliminary Version). CSCML 2023: 389-397 - [c357]Donghoon Chang, Moti Yung:
Midgame Attacks and Defense Against Them. CSCML 2023: 471-492 - [c356]Deniz Koyuncu, Alex Gittens, Bülent Yener, Moti Yung:
Deception by Omission: Using Adversarial Missingness to Poison Causal Structure Learning. KDD 2023: 1164-1175 - [e75]Yi Deng, Moti Yung:
Information Security and Cryptology - 18th International Conference, Inscrypt 2022, Beijing, China, December 11-13, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13837, Springer 2023, ISBN 978-3-031-26552-5 [contents] - [e74]Ding Wang, Moti Yung, Zheli Liu, Xiaofeng Chen:
Information and Communications Security - 25th International Conference, ICICS 2023, Tianjin, China, November 18-20, 2023, Proceedings. Lecture Notes in Computer Science 14252, Springer 2023, ISBN 978-981-99-7355-2 [contents] - [e73]Moti Yung, Chao Chen, Weizhi Meng:
Science of Cyber Security - 5th International Conference, SciSec 2023, Melbourne, VIC, Australia, July 11-14, 2023, Proceedings. Lecture Notes in Computer Science 14299, Springer 2023, ISBN 978-3-031-45932-0 [contents] - [i89]Deniz Koyuncu, Alex Gittens, Bülent Yener, Moti Yung:
Deception by Omission: Using Adversarial Missingness to Poison Causal Structure Learning. CoRR abs/2305.20043 (2023) - [i88]Mirek Kutylowski, Giuseppe Persiano, Duong Hieu Phan, Moti Yung, Marcin Zawada:
Anamorphic Signatures: Secrecy From a Dictator Who Only Permits Authentication! IACR Cryptol. ePrint Arch. 2023: 356 (2023) - [i87]Mirek Kutylowski, Giuseppe Persiano, Duong Hieu Phan, Moti Yung, Marcin Zawada:
The Self-Anti-Censorship Nature of Encryption: On the Prevalence of Anamorphic Cryptography. IACR Cryptol. ePrint Arch. 2023: 434 (2023) - [i86]Karim Eldefrawy, Sashidhar Jakkamsetti, Ben Terner, Moti Yung:
Standard Model Time-Lock Puzzles: Defining Security and Constructing via Composition. IACR Cryptol. ePrint Arch. 2023: 439 (2023) - [i85]Ghous Amjad, Kevin Yeo, Moti Yung:
RSA Blind Signatures with Public Metadata. IACR Cryptol. ePrint Arch. 2023: 1199 (2023) - [i84]Yi Wang, Rongmao Chen, Xinyi Huang, Moti Yung:
Sender-Anamorphic Encryption Reformulated: Achieving Robust and Generic Constructions. IACR Cryptol. ePrint Arch. 2023: 1828 (2023) - 2022
- [j76]Alex Gittens, Bülent Yener, Moti Yung:
An Adversarial Perspective on Accuracy, Robustness, Fairness, and Privacy: Multilateral-Tradeoffs in Trustworthy ML. IEEE Access 10: 120850-120865 (2022) - [j75]Salman Ahmed, Ya Xiao, Taejoong Chung, Carol J. Fung, Moti Yung, Danfeng Daphne Yao:
Privacy Guarantees of Bluetooth Low Energy Contact Tracing: A Case Study on COVIDWISE. Computer 55(2): 54-62 (2022) - [j74]Liron David, Avinatan Hassidim, Yossi Matias, Moti Yung, Alon Ziv:
Eddystone-EID: Secure and Private Infrastructural Protocol for BLE Beacons. IEEE Trans. Inf. Forensics Secur. 17: 3877-3889 (2022) - [c355]Salman Ahmed, Ya Xiao, Taejoong (Tijay) Chung, Carol J. Fung, Moti Yung, Danfeng (Daphne) Yao:
Privacy Guarantees of BLE Contact Tracing for COVID-19 and Beyond: A Case Study on COVIDWISE. AsiaCCS 2022: 1210-1212 - [c354]Mark Yampolskiy, Moti Yung:
AMSec'22: ACM CCS Workshop on Additive Manufacturing (3D Printing) Security. CCS 2022: 3557-3558 - [c353]Vasyl Pihur, Aleksandra Korolova, Frederick Liu, Subhash Sankuratripati, Moti Yung, Dachuan Huang, Ruogu Zeng:
Differentially-Private "Draw and Discard" Machine Learning: Training Distributed Model from Enormous Crowds. CSCML 2022: 468-486 - [c352]Liron David, Avinatan Hassidim, Yossi Matias, Moti Yung:
Scaling up GAEN Pseudorandom Processes: Preparing for a More Extensive Pandemic. ESORICS (1) 2022: 237-255 - [c351]Giuseppe Persiano, Duong Hieu Phan, Moti Yung:
Anamorphic Encryption: Private Communication Against a Dictator. EUROCRYPT (2) 2022: 34-63 - [c350]Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
One-Shot Fiat-Shamir-Based NIZK Arguments of Composite Residuosity and Logarithmic-Size Ring Signatures in the Standard Model. EUROCRYPT (2) 2022: 488-519 - [c349]Mark Yampolskiy, Lynne Graves, Jacob Gatlin, Jeffrey Todd McDonald, Moti Yung:
Crypto-Steganographic Validity for Additive Manufacturing (3D Printing) Design Files. ISC 2022: 40-52 - [c348]Long Chen, Ya-Nan Li, Qiang Tang, Moti Yung:
End-to-Same-End Encryption: Modularly Augmenting an App with an Efficient, Portable, and Blind Cloud Storage. USENIX Security Symposium 2022: 2353-2370 - [e72]Mark Yampolskiy, Moti Yung:
Proceedings of the 2022 ACM CCS Workshop on Additive Manufacturing (3D Printing) Security, Los Angeles, CA, USA, 11 November 2022. ACM 2022, ISBN 978-1-4503-9883-1 [contents] - [i83]Karim Eldefrawy, Nicholas Genise, Rutuja Kshirsagar, Moti Yung:
On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications. IACR Cryptol. ePrint Arch. 2022: 96 (2022) - [i82]Giuseppe Persiano, Duong Hieu Phan, Moti Yung:
Anamorphic Encryption: Private Communication against a Dictator. IACR Cryptol. ePrint Arch. 2022: 639 (2022) - 2021
- [j73]Shouhuai Xu, Moti Yung, Jingguo Wang:
Seeking Foundations for the Science of Cyber Security. Inf. Syst. Frontiers 23(2): 263-267 (2021) - [c347]Yi Wang, Rongmao Chen, Xinyi Huang, Jianting Ning, Baosheng Wang, Moti Yung:
Identity-Based Encryption for Fair Anonymity Applications: Defining, Implementing, and Applying Rerandomizable RCCA-Secure IBE. ASIACRYPT (2) 2021: 427-455 - [c346]Mark Yampolskiy, Jacob Gatlin, Moti Yung:
Myths and Misconceptions in Additive Manufacturing Security: Deficiencies of the CIA Triad. AMSec@CCS 2021: 3-9 - [c345]Yi Wang, Rongmao Chen, Guomin Yang, Xinyi Huang, Baosheng Wang, Moti Yung:
Receiver-Anonymity in Rerandomizable RCCA-Secure Cryptosystems Resolved. CRYPTO (4) 2021: 270-300 - [c344]Akif Patel, Moti Yung:
Fully Dynamic Password Protected Secret Sharing: Simplifying PPSS Operation and Maintenance. CSCML 2021: 379-396 - [c343]Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
Bifurcated Signatures: Folding the Accountability vs. Anonymity Dilemma into a Single Private Signing Scheme. EUROCRYPT (3) 2021: 521-552 - [c342]Julien Devevey, Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
Non-interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings. Public Key Cryptography (1) 2021: 659-690 - [c341]Mark Yampolskiy, Lynne Graves, Jacob Gatlin, Anthony Skjellum, Moti Yung:
What Did You Add to My Additive Manufacturing Data?: Steganographic Attacks on 3D Printing Files. RAID 2021: 266-281 - [c340]Karim Eldefrawy, Nicholas Genise, Rutuja Kshirsagar, Moti Yung:
On Regenerating Codes and Proactive Secret Sharing: Relationships and Implications. SSS 2021: 350-364 - [p4]Miroslaw Kutylowski, Piotr Syga, Moti Yung:
Emerging Security Challenges for Ubiquitous Devices. Security of Ubiquitous Computing Systems 2021: 3-18 - [e71]Jiannong Cao, Man Ho Au, Zhiqiang Lin, Moti Yung:
ASIA CCS '21: ACM Asia Conference on Computer and Communications Security, Virtual Event, Hong Kong, June 7-11, 2021. ACM 2021, ISBN 978-1-4503-8287-8 [contents] - [e70]Mark Yampolskiy, Yuval Elovici, Moti Yung:
AMSec '21: Proceedings of the 2021 Workshop on Additive Manufacturing (3D Printing) Security, Virtual Event, Republic of Korea, 19 November 2021. ACM 2021, ISBN 978-1-4503-8480-3 [contents] - [e69]Yongdong Wu, Moti Yung:
Information Security and Cryptology - 16th International Conference, Inscrypt 2020, Guangzhou, China, December 11-14, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12612, Springer 2021, ISBN 978-3-030-71851-0 [contents] - [e68]Yu Yu, Moti Yung:
Information Security and Cryptology - 17th International Conference, Inscrypt 2021, Virtual Event, August 12-14, 2021, Revised Selected Papers. Lecture Notes in Computer Science 13007, Springer 2021, ISBN 978-3-030-88322-5 [contents] - [e67]Wenlian Lu, Kun Sun, Moti Yung, Feng Liu:
Science of Cyber Security - Third International Conference, SciSec 2021, Virtual Event, August 13-15, 2021, Revised Selected Papers. Lecture Notes in Computer Science 13005, Springer 2021, ISBN 978-3-030-89136-7 [contents] - [e66]Joaquín García-Alfaro, Shujun Li, Radha Poovendran, Hervé Debar, Moti Yung:
Security and Privacy in Communication Networks - 17th EAI International Conference, SecureComm 2021, Virtual Event, September 6-9, 2021, Proceedings, Part I. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 398, Springer 2021, ISBN 978-3-030-90018-2 [contents] - [e65]Joaquín García-Alfaro, Shujun Li, Radha Poovendran, Hervé Debar, Moti Yung:
Security and Privacy in Communication Networks - 17th EAI International Conference, SecureComm 2021, Virtual Event, September 6-9, 2021, Proceedings, Part II. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 399, Springer 2021, ISBN 978-3-030-90021-2 [contents] - [i81]Salman Ahmed, Ya Xiao, Taejoong Chung, Carol J. Fung, Moti Yung, Danfeng Yao:
Privacy Guarantees of BLE Contact Tracing: A Case Study on COVIDWISE. CoRR abs/2111.08842 (2021) - [i80]Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou, Jiadong Zhu:
Correcting Subverted Random Oracles. IACR Cryptol. ePrint Arch. 2021: 42 (2021) - [i79]Julien Devevey, Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
Non-Interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings. IACR Cryptol. ePrint Arch. 2021: 630 (2021) - [i78]Ghous Amjad, Sarvar Patel, Giuseppe Persiano, Kevin Yeo, Moti Yung:
Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption. IACR Cryptol. ePrint Arch. 2021: 765 (2021) - [i77]Yi Wang, Rongmao Chen, Guomin Yang, Xinyi Huang, Baosheng Wang, Moti Yung:
Receiver-Anonymity in Rerandomizable RCCA-Secure Cryptosystems Resolved. IACR Cryptol. ePrint Arch. 2021: 862 (2021) - [i76]Yi Wang, Rongmao Chen, Xinyi Huang, Jianting Ning, Baosheng Wang, Moti Yung:
Identity-Based Encryption for Fair Anonymity Applications: Defining, Implementing, and Applying Rerandomizable RCCA-secure IBE. IACR Cryptol. ePrint Arch. 2021: 1261 (2021) - 2020
- [j72]Kuo-Hui Yeh, Chunhua Su, Robert H. Deng, Moti Yung, Miroslaw Kutylowski:
Special issue on security and privacy of blockchain technologies. Int. J. Inf. Sec. 19(3): 243-244 (2020) - [j71]Benoît Libert, Moti Yung:
Adaptively Secure Non-interactive CCA-Secure Threshold Cryptosystems: Generic Framework and Constructions. J. Cryptol. 33(4): 1405-1441 (2020) - [j70]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
The combinatorics of hidden diversity. Theor. Comput. Sci. 812: 80-95 (2020) - [c339]Xuan Thanh Do, Duong Hieu Phan, Moti Yung:
A Concise Bounded Anonymous Broadcast Yielding Combinatorial Trace-and-Revoke Schemes. ACNS (2) 2020: 145-164 - [c338]Rongmao Chen, Xinyi Huang, Moti Yung:
Subvert KEM to Break DEM: Practical Algorithm-Substitution Attacks on Public-Key Encryption. ASIACRYPT (2) 2020: 98-128 - [c337]Peihan Miao, Sarvar Patel, Mariana Raykova, Karn Seth, Moti Yung:
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality. CRYPTO (3) 2020: 3-33 - [c336]Moti Yung, Cem Paya, Daniel James:
Zero-Knowledge to the Rescue: Consistent Redundant Backup of Keys Generated for Critical Financial Services. CSCML 2020: 18-28 - [c335]Miroslaw Kutylowski, Anna Lauks-Dutka, Moti Yung:
GDPR - Challenges for Reconciling Legal Rules with Technical Reality. ESORICS (1) 2020: 736-755 - [c334]Mihaela Ion, Ben Kreuter, Ahmet Erhan Nergiz, Sarvar Patel, Shobhit Saxena, Karn Seth, Mariana Raykova, David Shanahan, Moti Yung:
On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality. EuroS&P 2020: 370-389 - [c333]Moti Yung:
Secure Computation Protocol: A Technology for Our Time. ICETE (1) 2020: 19 - [c332]Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky, Moti Yung:
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups. SCN 2020: 108-129 - [e64]Zhe Liu, Moti Yung:
Information Security and Cryptology - 15th International Conference, Inscrypt 2019, Nanjing, China, December 6-8, 2019, Revised Selected Papers. Lecture Notes in Computer Science 12020, Springer 2020, ISBN 978-3-030-42920-1 [contents] - [i75]Peihan Miao, Sarvar Patel, Mariana Raykova, Karn Seth, Moti Yung:
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality. IACR Cryptol. ePrint Arch. 2020: 385 (2020) - [i74]Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky, Moti Yung:
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups. IACR Cryptol. ePrint Arch. 2020: 747 (2020) - [i73]Xuan Thanh Do, Duong Hieu Phan, Moti Yung:
A Concise Bounded Anonymous Broadcast Yielding Combinatorial Trace-and-Revoke Schemes. IACR Cryptol. ePrint Arch. 2020: 826 (2020) - [i72]Rongmao Chen, Xinyi Huang, Moti Yung:
Subvert KEM to Break DEM: Practical Algorithm-Substitution Attacks on Public-Key Encryption. IACR Cryptol. ePrint Arch. 2020: 1079 (2020) - [i71]Benoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung:
Compact Simulation-Sound NIZK Arguments of Composite Residuosity and Applications to Logarithmic-Size Ring Signatures. IACR Cryptol. ePrint Arch. 2020: 1334 (2020)
2010 – 2019
- 2019
- [j69]Kwangsu Lee, Dong Hoon Lee, Jong Hwan Park, Moti Yung:
CCA Security for Self-Updatable Encryption: Protecting Cloud Data When Clients Read/Write Ciphertexts. Comput. J. 62(4): 545-562 (2019) - [j68]Raphael C.-W. Phan, Moti Yung:
Paradigm Shifts in Cryptographic Engineering. IEEE Trans. Dependable Secur. Comput. 16(5): 729-730 (2019) - [c331]Mingyi Zhao, Moti Yung:
Secure Zero-Day Detection: Wiping Off the VEP Trade-Off. CYSARM@CCS 2019: 35-45 - [c330]Sarvar Patel, Giuseppe Persiano, Kevin Yeo, Moti Yung:
Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing. CCS 2019: 79-93 - [c329]Sherman S. M. Chow, Alexander Russell, Qiang Tang, Moti Yung, Yongjun Zhao, Hong-Sheng Zhou:
Let a Non-barking Watchdog Bite: Cliptographic Signatures with an Offline Watchdog. Public Key Cryptography (1) 2019: 221-251 - [p3]Jesus Diaz, Seung Geol Choi, David Arroyo, Angelos D. Keromytis, Francisco B. Rodríguez, Moti Yung:
A Methodology for Retrofitting Privacy and Its Application to e-Shopping Transactions. Advances in Cyber Security 2019: 143-183 - [e63]Robert H. Deng, Valérie Gauthier-Umaña, Martín Ochoa, Moti Yung:
Applied Cryptography and Network Security - 17th International Conference, ACNS 2019, Bogota, Colombia, June 5-7, 2019, Proceedings. Lecture Notes in Computer Science 11464, Springer 2019, ISBN 978-3-030-21567-5 [contents] - [e62]Fuchun Guo, Xinyi Huang, Moti Yung:
Information Security and Cryptology - 14th International Conference, Inscrypt 2018, Fuzhou, China, December 14-17, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11449, Springer 2019, ISBN 978-3-030-14233-9 [contents] - [e61]Shlomi Dolev, Danny Hendler, Sachin Lodha, Moti Yung:
Cyber Security Cryptography and Machine Learning - Third International Symposium, CSCML 2019, Beer-Sheva, Israel, June 27-28, 2019, Proceedings. Lecture Notes in Computer Science 11527, Springer 2019, ISBN 978-3-030-20950-6 [contents] - [e60]Feng Liu, Jia Xu, Shouhuai Xu, Moti Yung:
Science of Cyber Security - Second International Conference, SciSec 2019, Nanjing, China, August 9-11, 2019, Revised Selected Papers. Lecture Notes in Computer Science 11933, Springer 2019, ISBN 978-3-030-34636-2 [contents] - [i70]Frederik Armknecht, Ingrid Verbauwhede, Melanie Volkamer, Moti Yung:
Biggest Failures in Security (Dagstuhl Seminar 19451). Dagstuhl Reports 9(11): 1-23 (2019) - [i69]Mihaela Ion, Ben Kreuter, Ahmet Erhan Nergiz, Sarvar Patel, Mariana Raykova, Shobhit Saxena, Karn Seth, David Shanahan, Moti Yung:
On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications. IACR Cryptol. ePrint Arch. 2019: 723 (2019) - [i68]Sarvar Patel, Giuseppe Persiano, Kevin Yeo, Moti Yung:
Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing. IACR Cryptol. ePrint Arch. 2019: 1292 (2019) - 2018
- [j67]Jiageng Chen, Chunhua Su, Kuo-Hui Yeh, Moti Yung:
Special Issue on Advanced Persistent Threat. Future Gener. Comput. Syst. 79: 243-246 (2018) - [c328]Karim Eldefrawy, Rafail Ostrovsky, Moti Yung:
Theoretical Foundations for Mobile Target Defense: Proactive Secret Sharing and Secure Multiparty Computation. From Database to Cyber Security 2018: 470-486 - [c327]Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou:
Correcting Subverted Random Oracles. CRYPTO (2) 2018: 241-271 - [c326]Jesus Diaz, Seung Geol Choi, David Arroyo, Angelos D. Keromytis, Francisco B. Rodríguez, Moti Yung:
Privacy in e-Shopping Transactions: Exploring and Addressing the Trade-Offs. CSCML 2018: 206-226 - [c325]Karim Eldefrawy, Rafail Ostrovsky, Sunoo Park, Moti Yung:
Proactive Secure Multiparty Computation with a Dishonest Majority. SCN 2018: 200-215 - [c324]Adam L. Young, Moti Yung:
Semantically Secure Anonymity: Foundations of Re-encryption. SCN 2018: 255-273 - [e59]Xiaofeng Chen, Dongdai Lin, Moti Yung:
Information Security and Cryptology - 13th International Conference, Inscrypt 2017, Xi'an, China, November 3-5, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10726, Springer 2018, ISBN 978-3-319-75159-7 [contents] - [e58]Feng Liu, Shouhuai Xu, Moti Yung:
Science of Cyber Security - First International Conference, SciSec 2018, Beijing, China, August 12-14, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11287, Springer 2018, ISBN 978-3-030-03025-4 [contents] - [i67]Vasyl Pihur, Aleksandra Korolova, Frederick Liu, Subhash Sankuratripati, Moti Yung, Dachuan Huang, Ruogu Zeng:
Differentially-Private "Draw and Discard" Machine Learning. CoRR abs/1807.04369 (2018) - 2017
- [j66]Adam L. Young, Moti Yung:
Cryptovirology: the birth, neglect, and explosion of ransomware. Commun. ACM 60(7): 24-26 (2017) - [j65]Adam L. Young, Moti Yung:
On Ransomware and Envisioning the Enemy of Tomorrow. Computer 50(11): 82-85 (2017) - [j64]Alexandra Rivero-García, Iván Santos-González, Candelaria Hernández-Goya, Pino Caballero-Gil, Moti Yung:
Patients' Data Management System Protected by Identity-Based Authentication and Key Exchange. Sensors 17(4): 733 (2017) - [j63]Kwangsu Lee, Seung Geol Choi, Dong Hoon Lee, Jong Hwan Park, Moti Yung:
Self-updatable encryption: Time constrained access control with hidden attributes and better efficiency. Theor. Comput. Sci. 667: 51-92 (2017) - [c323]Alexandra Dmitrienko, David Noack, Moti Yung:
Secure Wallet-Assisted Offline Bitcoin Payments with Double-Spender Revocation. AsiaCCS 2017: 520-531 - [c322]Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou:
Generic Semantic Security against a Kleptographic Adversary. CCS 2017: 907-922 - [c321]Qiang Tang, Moti Yung:
Cliptography: Post-Snowden Cryptography. CCS 2017: 2615-2616 - [c320]Adam L. Young, Moti Yung:
The Combinatorics of Product Scanning Multiplication and Squaring. CSCML 2017: 99-114 - [c319]Shlomi Dolev, Karim Eldefrawy, Juan A. Garay, Muni Venkateswarlu Kumaramangalam, Rafail Ostrovsky, Moti Yung:
Brief Announcement: Secure Self-Stabilizing Computation. PODC 2017: 415-417 - [e57]Kefei Chen, Dongdai Lin, Moti Yung:
Information Security and Cryptology - 12th International Conference, Inscrypt 2016, Beijing, China, November 4-6, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10143, Springer 2017, ISBN 978-3-319-54704-6 [contents] - [e56]Raphael C.-W. Phan, Moti Yung:
Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology - Second International Conference, Mycrypt 2016, Kuala Lumpur, Malaysia, December 1-2, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10311, Springer 2017, ISBN 978-3-319-61272-0 [contents] - [i66]Mihaela Ion, Ben Kreuter, Erhan Nergiz, Sarvar Patel, Shobhit Saxena, Karn Seth, David Shanahan, Moti Yung:
Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions. IACR Cryptol. ePrint Arch. 2017: 738 (2017) - 2016
- [j62]Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao:
Concurrent Knowledge Extraction in Public-Key Models. J. Cryptol. 29(1): 156-219 (2016) - [j61]Benoît Libert, Marc Joye, Moti Yung:
Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares. Theor. Comput. Sci. 645: 1-24 (2016) - [c318]Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou:
Cliptography: Clipping the Power of Kleptographic Attacks. ASIACRYPT (2) 2016: 34-64 - [c317]Adam L. Young, Moti Yung:
Cryptography as an Attack Technology: Proving the RSA/Factoring Kleptographic Attack. The New Codebreakers 2016: 243-255 - [c316]Benoît Libert, Fabrice Mouhartem, Thomas Peters, Moti Yung:
Practical "Signatures with Efficient Protocols" from Simple Assumptions. AsiaCCS 2016: 511-522 - [c315]Frederik Armknecht, Daisuke Moriyama, Ahmad-Reza Sadeghi, Moti Yung:
Towards a Unified Security Model for Physically Unclonable Functions. CT-RSA 2016: 271-287 - [c314]Benoît Libert, Somindu C. Ramanna, Moti Yung:
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions. ICALP 2016: 30:1-30:14 - [c313]Shlomi Dolev, Karim Eldefrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung:
Brief Announcement: Proactive Secret Sharing with a Dishonest Majority. PODC 2016: 401-403 - [c312]Yi Deng, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung:
On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs. SCN 2016: 237-253 - [c311]Shlomi Dolev, Karim El Defrawy, Joshua Lampkins, Rafail Ostrovsky, Moti Yung:
Proactive Secret Sharing with a Dishonest Majority. SCN 2016: 529-548 - [e55]Dongdai Lin, XiaoFeng Wang, Moti Yung:
Information Security and Cryptology - 11th International Conference, Inscrypt 2015, Beijing, China, November 1-3, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9589, Springer 2016, ISBN 978-3-319-38897-7 [contents] - [e54]Moti Yung, Jian-biao Zhang, Zhen Yang:
Trusted Systems - 7th International Conference, INTRUST 2015, Beijing, China, December 7-8, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9565, Springer 2016, ISBN 978-3-319-31549-2 [contents] - [e53]Jiageng Chen, Vincenzo Piuri, Chunhua Su, Moti Yung:
Network and System Security - 10th International Conference, NSS 2016, Taipei, Taiwan, September 28-30, 2016, Proceedings. Lecture Notes in Computer Science 9955, Springer 2016, ISBN 978-3-319-46297-4 [contents] - [i65]Frederik Armknecht, Daisuke Moriyama, Ahmad-Reza Sadeghi, Moti Yung:
Towards a Unified Security Model for Physically Unclonable Functions. IACR Cryptol. ePrint Arch. 2016: 33 (2016) - [i64]Adam L. Young, Moti Yung:
Semantically Secure Anonymity: Foundations of Re-encryption. IACR Cryptol. ePrint Arch. 2016: 341 (2016) - [i63]Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou:
Destroying Steganography via Amalgamation: Kleptographically CPA Secure Public Key Encryption. IACR Cryptol. ePrint Arch. 2016: 530 (2016) - [i62]Benoît Libert, Somindu C. Ramanna, Moti Yung:
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions. IACR Cryptol. ePrint Arch. 2016: 766 (2016) - 2015
- [j60]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Linearly homomorphic structure-preserving signatures and their applications. Des. Codes Cryptogr. 77(2-3): 441-477 (2015) - [j59]Kwangsu Lee, Dong Hoon Lee, Moti Yung:
Sequential aggregate signatures with short public keys without random oracles. Theor. Comput. Sci. 579: 100-125 (2015) - [c310]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Compactly Hiding Linear Spans - Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications. ASIACRYPT (1) 2015: 681-707 - [c309]Moti Yung:
From Mental Poker to Core Business: Why and How to Deploy Secure Computation Protocols? CCS 2015: 1-2 - [c308]Tomas Sander, Moti Yung:
WISCS'15: The 2nd ACM Workshop on Information Sharing and Collaborative Security. CCS 2015: 1717-1718 - [c307]Aydin Aysu, Ege Gulcan, Daisuke Moriyama, Patrick Schaumont, Moti Yung:
End-To-End Design of a PUF-Based Privacy Preserving Authentication Protocol. CHES 2015: 556-576 - [c306]Daisuke Moriyama, Moti Yung:
The bright side arguments for the coming smartphones crypto war: The added value of device encryption. CNS 2015: 65-73 - [c305]Benoît Libert, Thomas Peters, Moti Yung:
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions. CRYPTO (2) 2015: 296-316 - [c304]Jesus Diaz, Seung Geol Choi, David Arroyo, Angelos D. Keromytis, Francisco de Borja Rodríguez, Moti Yung:
Privacy Threats in E-Shopping (Position Paper). DPM/QASA@ESORICS 2015: 217-225 - [c303]Lucjan Hanzlik, Miroslaw Kutylowski, Moti Yung:
Hard Invalidation of Electronic Signatures. ISPEC 2015: 421-436 - [c302]Benoît Libert, Marc Joye, Moti Yung, Thomas Peters:
Secure Efficient History-Hiding Append-Only Signatures in the Standard Model. Public Key Cryptography 2015: 450-473 - [c301]Moti Yung:
The "Mobile Adversary" Paradigm in Distributed Computation and Systems. PODC 2015: 171-172 - [c300]Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation. TCC (1) 2015: 134-158 - [e52]Indrajit Ray, Tomas Sander, Moti Yung:
Proceedings of the 2nd ACM Workshop on Information Sharing and Collaborative Security, WISCS 2015, Denver, Colorado, USA, October 12, 2015. ACM 2015, ISBN 978-1-4503-3822-6 [contents] - [e51]Dongdai Lin, Moti Yung, Jianying Zhou:
Information Security and Cryptology - 10th International Conference, Inscrypt 2014, Beijing, China, December 13-15, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8957, Springer 2015, ISBN 978-3-319-16744-2 [contents] - [e50]Moti Yung, Liehuang Zhu, Yanjiang Yang:
Trusted Systems - 6th International Conference, INTRUST 2014, Beijing, China, December 16-17, 2014, Revised Selected Papers. Lecture Notes in Computer Science 9473, Springer 2015, ISBN 978-3-319-27997-8 [contents] - [e49]Meikang Qiu, Shouhuai Xu, Moti Yung, Haibo Zhang:
Network and System Security - 9th International Conference, NSS 2015, New York, NY, USA, November 3-5, 2015, Proceedings. Lecture Notes in Computer Science 9408, Springer 2015, ISBN 978-3-319-25644-3 [contents] - [i61]Kwangsu Lee, Dong Hoon Lee, Moti Yung:
Sequential Aggregate Signatures with Short Public Keys without Random Oracles. CoRR abs/1502.06691 (2015) - [i60]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Compactly Hiding Linear Spans: Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications. IACR Cryptol. ePrint Arch. 2015: 242 (2015) - [i59]Alexander Russell, Qiang Tang, Moti Yung, Hong-Sheng Zhou:
Cliptography: Clipping the Power of Kleptographic Attacks. IACR Cryptol. ePrint Arch. 2015: 695 (2015) - [i58]Benoît Libert, Thomas Peters, Moti Yung:
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions. IACR Cryptol. ePrint Arch. 2015: 743 (2015) - [i57]Aydin Aysu, Ege Gulcan, Daisuke Moriyama, Patrick Schaumont, Moti Yung:
End-to-end Design of a PUF-based Privacy Preserving Authentication Protocol. IACR Cryptol. ePrint Arch. 2015: 937 (2015) - [i56]Kwangsu Lee, Dong Hoon Lee, Jong Hwan Park, Moti Yung:
CCA Security for Self-Updatable Encryption: Protecting Cloud Data When Clients Read/Write Ciphertexts. IACR Cryptol. ePrint Arch. 2015: 1202 (2015) - 2014
- [c299]Benoît Libert, Marc Joye, Moti Yung, Thomas Peters:
Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security. ASIACRYPT (2) 2014: 1-21 - [c298]Isamu Teranishi, Moti Yung, Tal Malkin:
Order-Preserving Encryption Secure Beyond One-Wayness. ASIACRYPT (2) 2014: 42-61 - [c297]Adam L. Young, Moti Yung:
The drunk motorcyclist protocol for anonymous communication. CNS 2014: 157-165 - [c296]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Non-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures. EUROCRYPT 2014: 514-532 - [c295]Alexandra Dmitrienko, David Noack, Ahmad-Reza Sadeghi, Moti Yung:
On Offline Payments with Bitcoin (Poster Abstract). Financial Cryptography Workshops 2014: 159-160 - [c294]Benoît Libert, Moti Yung, Marc Joye, Thomas Peters:
Traceable Group Encryption. Public Key Cryptography 2014: 592-610 - [c293]Benoît Libert, Marc Joye, Moti Yung:
Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares. PODC 2014: 303-312 - [c292]David Naccache, Rainer Steinwandt, Adriana Suárez Corona, Moti Yung:
Narrow Bandwidth Is Not Inherent in Reverse Public-Key Encryption. SCN 2014: 598-607 - [e48]Gail-Joon Ahn, Moti Yung, Ninghui Li:
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, November 3-7, 2014. ACM 2014, ISBN 978-1-4503-2957-6 [contents] - [e47]Dongdai Lin, Shouhuai Xu, Moti Yung:
Information Security and Cryptology - 9th International Conference, Inscrypt 2013, Guangzhou, China, November 27-30, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8567, Springer 2014, ISBN 978-3-319-12086-7 [contents] - [i55]Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2014: 209 (2014) - [i54]Benoît Libert, Marc Joye, Moti Yung, Thomas Peters:
Concise Multi-Challenge CCA-Secure Encryption and Signatures with Almost Tight Security. IACR Cryptol. ePrint Arch. 2014: 743 (2014) - 2013
- [j58]Benoît Libert, Moti Yung:
Adaptively secure non-interactive threshold cryptosystems. Theor. Comput. Sci. 478: 76-100 (2013) - [c291]Kwangsu Lee, Dong Hoon Lee, Moti Yung:
Sequential Aggregate Signatures Made Shorter. ACNS 2013: 202-217 - [c290]Kwangsu Lee, Seung Geol Choi, Dong Hoon Lee, Jong Hwan Park, Moti Yung:
Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency. ASIACRYPT (1) 2013: 235-254 - [c289]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Linearly Homomorphic Structure-Preserving Signatures and Their Applications. CRYPTO (2) 2013: 289-307 - [c288]Kwangsu Lee, Dong Hoon Lee, Moti Yung:
Aggregating CL-Signatures Revisited: Extended Functionality and Better Efficiency. Financial Cryptography 2013: 171-188 - [c287]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
Resource-based corruptions and the combinatorics of hidden diversity. ITCS 2013: 415-428 - [c286]Kwangsu Lee, Dong Hoon Lee, Moti Yung:
Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies. Public Key Cryptography 2013: 423-442 - [e46]Ahmad-Reza Sadeghi, Virgil D. Gligor, Moti Yung:
2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13, Berlin, Germany, November 4-8, 2013. ACM 2013, ISBN 978-1-4503-2477-9 [contents] - [e45]Miroslaw Kutylowski, Moti Yung:
Information Security and Cryptology - 8th International Conference, Inscrypt 2012, Beijing, China, November 28-30, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7763, Springer 2013, ISBN 978-3-642-38518-6 [contents] - [i53]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Linearly Homomorphic Structure-Preserving Signatures and Their Applications. IACR Cryptol. ePrint Arch. 2013: 361 (2013) - [i52]Kwangsu Lee, Dong Hoon Lee, Moti Yung:
Sequential Aggregate Signatures Made Shorter. IACR Cryptol. ePrint Arch. 2013: 384 (2013) - [i51]Tal Malkin, Isamu Teranishi, Moti Yung:
Order-Preserving Encryption Secure Beyond One-Wayness. IACR Cryptol. ePrint Arch. 2013: 409 (2013) - [i50]Benoît Libert, Thomas Peters, Marc Joye, Moti Yung:
Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures. IACR Cryptol. ePrint Arch. 2013: 691 (2013) - [i49]Daisuke Moriyama, Shin'ichiro Matsuo, Moti Yung:
PUF-Based RFID Authentication Secure and Private under Complete Memory Leakage. IACR Cryptol. ePrint Arch. 2013: 712 (2013) - [i48]Kwangsu Lee, Seung Geol Choi, Dong Hoon Lee, Jong Hwan Park, Moti Yung:
Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency. IACR Cryptol. ePrint Arch. 2013: 762 (2013) - 2012
- [j57]Shlomi Dolev, Limor Lahiani, Moti Yung:
Secret swarm unit: Reactive k-secret sharing. Ad Hoc Networks 10(7): 1291-1305 (2012) - [j56]Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung:
Efficient robust private set intersection. Int. J. Appl. Cryptogr. 2(4): 289-303 (2012) - [c285]Assaf Ben-David, Omer Berkman, Yossi Matias, Sarvar Patel, Cem Paya, Moti Yung:
Contextual OTP: Mitigating Emerging Man-in-the-Middle Attacks with Wireless Hardware Tokens. ACNS 2012: 30-47 - [c284]Benoît Libert, Moti Yung:
Fully Forward-Secure Group Signatures. Cryptography and Security 2012: 156-184 - [c283]Omer Berkman, Benny Pinkas, Moti Yung:
Firm Grip Handshakes: A Tool for Bidirectional Vouching. CANS 2012: 142-157 - [c282]Yevgeniy Dodis, Weiliang Luo, Shouhuai Xu, Moti Yung:
Key-insulated symmetric key cryptography and mitigating attacks against cryptographic cloud software. AsiaCCS 2012: 57-58 - [c281]Benoît Libert, Thomas Peters, Moti Yung:
Group Signatures with Almost-for-Free Revocation. CRYPTO 2012: 571-589 - [c280]Benoît Libert, Thomas Peters, Moti Yung:
Scalable Group Signatures with Revocation. EUROCRYPT 2012: 609-627 - [c279]Michael O. Rabin, Yishay Mansour, S. Muthukrishnan, Moti Yung:
Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions. ICALP (1) 2012: 738-749 - [c278]Ali Juma, Yevgeniy Vahlis, Moti Yung:
Multi-location Leakage Resilient Cryptography. Public Key Cryptography 2012: 504-521 - [c277]Seung Geol Choi, Dana Dachman-Soled, Moti Yung:
On the Centrality of Off-Line E-Cash to Concrete Partial Information Games. SCN 2012: 264-280 - [c276]Benoît Libert, Moti Yung:
Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions. TCC 2012: 75-93 - [e44]Chuankun Wu, Moti Yung, Dongdai Lin:
Information Security and Cryptology - 7th International Conference, Inscrypt 2011, Beijing, China, November 30 - December 3, 2011. Revised Selected Papers. Lecture Notes in Computer Science 7537, Springer 2012, ISBN 978-3-642-34703-0 [contents] - [e43]Sara Foresti, Moti Yung, Fabio Martinelli:
Computer Security - ESORICS 2012 - 17th European Symposium on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings. Lecture Notes in Computer Science 7459, Springer 2012, ISBN 978-3-642-33166-4 [contents] - [e42]Liqun Chen, Moti Yung, Liehuang Zhu:
Trusted Systems - Third International Conference, INTRUST 2011, Beijing, China, November 27-29, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7222, Springer 2012, ISBN 978-3-642-32297-6 [contents] - [e41]Souhwan Jung, Moti Yung:
Information Security Applications - 12th International Workshop, WISA 2011, Jeju Island, Korea, August 22-24, 2011. Revised Selected Papers. Lecture Notes in Computer Science 7115, Springer 2012, ISBN 978-3-642-27889-1 [contents] - [e40]Dong Hoon Lee, Moti Yung:
Information Security Applications - 13th International Workshop, WISA 2012, Jeju Island, Korea, August 16-18, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7690, Springer 2012, ISBN 978-3-642-35415-1 [contents] - [i47]Charanjit S. Jutla, Moti Yung:
PayTree: "Amortized Signature" for Flexible Micro-Payments. IACR Cryptol. ePrint Arch. 2012: 10 (2012) - [i46]Donghoon Chang, Moti Yung:
Adaptive Preimage Resistance Analysis Revisited: \\ Requirements, Subtleties and Implications. IACR Cryptol. ePrint Arch. 2012: 209 (2012) - [i45]Benoît Libert, Thomas Peters, Moti Yung:
Scalable Group Signatures with Revocation. IACR Cryptol. ePrint Arch. 2012: 424 (2012) - [i44]Benoît Libert, Thomas Peters, Moti Yung:
Group Signatures with Almost-for-free Revocation. IACR Cryptol. ePrint Arch. 2012: 442 (2012) - [i43]Alfredo De Santis, Moti Yung:
"Metaproofs" (and their Cryptographic Applications). IACR Cryptol. ePrint Arch. 2012: 495 (2012) - [i42]Yi Deng, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung:
On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2012: 508 (2012) - [i41]Kwangsu Lee, Dong Hoon Lee, Moti Yung:
Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies. IACR Cryptol. ePrint Arch. 2012: 518 (2012) - [i40]Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
Resource-based Corruptions and the Combinatorics of Hidden Diversity. IACR Cryptol. ePrint Arch. 2012: 556 (2012) - [i39]Kwangsu Lee, Dong Hoon Lee, Moti Yung:
Aggregating CL-Signatures Revisited: Extended Functionality and Better Efficiency. IACR Cryptol. ePrint Arch. 2012: 562 (2012) - 2011
- [j55]Ted Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung:
The Efficient Dual Receiver Cryptosystem and Its Applications. Int. J. Netw. Secur. 13(3): 135-151 (2011) - [j54]Robert H. Deng, Yingjiu Li, Moti Yung, Yunlei Zhao:
A zero-knowledge based framework for RFID privacy. J. Comput. Secur. 19(6): 1109-1146 (2011) - [j53]Benoît Libert, Moti Yung:
Efficient traceable signatures in the standard model. Theor. Comput. Sci. 412(12-14): 1220-1242 (2011) - [c275]Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung:
Secure Efficient Multiparty Computing of Multivariate Polynomials and Applications. ACNS 2011: 130-146 - [c274]Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, Amit Sahai, Moti Yung:
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge. ASIACRYPT 2011: 390-406 - [c273]Benoît Libert, Moti Yung:
Adaptively Secure Forward-Secure Non-interactive Threshold Cryptosystems. Inscrypt 2011: 1-21 - [c272]Moti Yung:
From Protecting a System to Protecting a Global Ecosystem. Communications and Multimedia Security 2011: 255 - [c271]Tal Malkin, Isamu Teranishi, Moti Yung:
Key dependent message security: recent results and applications. CODASPY 2011: 3-12 - [c270]Tal Malkin, Isamu Teranishi, Moti Yung:
Efficient Circuit-Size Independent Public Key Encryption with KDM Security. EUROCRYPT 2011: 507-526 - [c269]Moti Yung:
Cryptographic Protocols: From the Abstract to the Practical to the Actual. Financial Cryptography Workshops 2011: 1-2 - [c268]Donghoon Chang, Mridul Nandi, Moti Yung:
On the Security of Hash Functions Employing Blockcipher Postprocessing. FSE 2011: 146-166 - [c267]Benoît Libert, Moti Yung:
Adaptively Secure Non-interactive Threshold Cryptosystems. ICALP (2) 2011: 588-600 - [c266]Shin'ichiro Matsuo, Daisuke Moriyama, Moti Yung:
Multifactor Authenticated Key Renewal. INTRUST 2011: 204-220 - [c265]Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung:
Signatures Resilient to Continual Leakage on Memory and Computation. TCC 2011: 89-106 - [e39]Feng Bao, Moti Yung, Dongdai Lin, Jiwu Jing:
Information Security and Cryptology - 5th International Conference, Inscrypt 2009, Beijing, China, December 12-15, 2009. Revised Selected Papers. Lecture Notes in Computer Science 6151, Springer 2011, ISBN 978-3-642-16341-8 [contents] - [e38]Xuejia Lai, Moti Yung, Dongdai Lin:
Information Security and Cryptology - 6th International Conference, Inscrypt 2010, Shanghai, China, October 20-24, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6584, Springer 2011, ISBN 978-3-642-21517-9 [contents] - [e37]Liqun Chen, Moti Yung:
Trusted Systems - Second International Conference, INTRUST 2010, Beijing, China, December 13-15, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6802, Springer 2011, ISBN 978-3-642-25282-2 [contents] - [e36]Yongwha Chung, Moti Yung:
Information Security Applications - 11th International Workshop, WISA 2010, Jeju Island, Korea, August 24-26, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6513, Springer 2011, ISBN 978-3-642-17954-9 [contents] - [i38]Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, Amit Sahai, Moti Yung:
Resettable Cryptography in Constant Rounds - the Case of Zero Knowledge. IACR Cryptol. ePrint Arch. 2011: 408 (2011) - [i37]Donghoon Chang, Mridul Nandi, Moti Yung:
Indifferentiability of the Hash Algorithm BLAKE. IACR Cryptol. ePrint Arch. 2011: 623 (2011) - 2010
- [j52]Moti Yung:
Preface. Theor. Comput. Sci. 411(10): 1235 (2010) - [j51]Benoît Libert, Jean-Jacques Quisquater, Moti Yung:
Key Evolution Systems in Untrusted Update Environments. ACM Trans. Inf. Syst. Secur. 13(4): 37:1-37:34 (2010) - [c264]Benoît Libert, Moti Yung:
Dynamic fully forward-secure group signatures. AsiaCCS 2010: 70-81 - [c263]Yu Yu, François-Xavier Standaert, Olivier Pereira, Moti Yung:
Practical leakage-resilient pseudorandom generators. CCS 2010: 141-151 - [c262]Robert H. Deng, Yingjiu Li, Moti Yung, Yunlei Zhao:
A New Framework for RFID Privacy. ESORICS 2010: 1-18 - [c261]Moti Yung:
Cryptography between Wonderland and Underland. EUROCRYPT 2010: 320-321 - [c260]Aggelos Kiayias, Moti Yung:
Tree-Homomorphic Encryption and Scalable Hierarchical Secret-Ballot Elections. Financial Cryptography 2010: 257-271 - [c259]Benoît Libert, Moti Yung:
Efficient Completely Non-malleable Public Key Encryption. ICALP (1) 2010: 127-139 - [c258]Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao:
Concurrent Knowledge Extraction in the Public-Key Model. ICALP (1) 2010: 702-714 - [c257]Le Trieu Phong, Shin'ichiro Matsuo, Moti Yung:
Leakage Resilient Strong Key-Insulated Signatures in Public Channel. INTRUST 2010: 160-172 - [c256]Shin'ichiro Matsuo, Le Trieu Phong, Miyako Ohkubo, Moti Yung:
Leakage-Resilient RFID Authentication with Forward-Privacy. RFIDSec 2010: 176-188 - [c255]Adam L. Young, Moti Yung:
Kleptography from Standard Assumptions and Applications. SCN 2010: 271-290 - [c254]Benoît Libert, Moti Yung:
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs. TCC 2010: 499-517 - [c253]Aggelos Kiayias, Moti Yung:
The Vector-Ballot Approach for Online Voting Procedures. Towards Trustworthy Elections 2010: 155-174 - [p2]François-Xavier Standaert, Olivier Pereira, Yu Yu, Jean-Jacques Quisquater, Moti Yung, Elisabeth Oswald:
Leakage Resilient Cryptography in Practice. Towards Hardware-Intrinsic Security 2010: 99-134 - [e35]Jianying Zhou, Moti Yung:
Applied Cryptography and Network Security, 8th International Conference, ACNS 2010, Beijing, China, June 22-25, 2010. Proceedings. Lecture Notes in Computer Science 6123, 2010, ISBN 978-3-642-13707-5 [contents] - [e34]Liqun Chen, Moti Yung:
Trusted Systems, First International Conference, INTRUST 2009, Beijing, China, December 17-19, 2009. Revised Selected Papers. Lecture Notes in Computer Science 6163, Springer 2010, ISBN 978-3-642-14596-4 [contents] - [e33]Shlomi Dolev, Jorge Arturo Cobb, Michael J. Fischer, Moti Yung:
Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings. Lecture Notes in Computer Science 6366, Springer 2010, ISBN 978-3-642-16022-6 [contents] - [i36]Robert H. Deng, Yingjiu Li, Andrew C. Yao, Moti Yung, Yunlei Zhao:
A New Framework for RFID Privacy. IACR Cryptol. ePrint Arch. 2010: 59 (2010) - [i35]Andrew C. Yao, Moti Yung, Yunlei Zhao:
Concurrent Knowledge Extraction in the Public-Key Model. IACR Cryptol. ePrint Arch. 2010: 74 (2010) - [i34]Andrew C. Yao, Moti Yung, Yunlei Zhao:
Adaptive Concurrent Non-Malleability with Bare Public-Keys. IACR Cryptol. ePrint Arch. 2010: 107 (2010) - [i33]Tal Malkin, Isamu Teranishi, Yevgeniy Vahlis, Moti Yung:
Signatures Resilient to Continual Leakage on Memory and Computation. IACR Cryptol. ePrint Arch. 2010: 522 (2010) - [i32]Donghoon Chang, Mridul Nandi, Moti Yung:
On the Security of Hash Functions Employing Blockcipher Postprocessing. IACR Cryptol. ePrint Arch. 2010: 629 (2010)
2000 – 2009
- 2009
- [j50]Debra L. Cook, Moti Yung, Angelos D. Keromytis:
Elastic block ciphers: method, security and instantiations. Int. J. Inf. Sec. 8(3): 211-231 (2009) - [j49]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) - [j48]Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient and secure authenticated key exchange using weak passwords. J. ACM 57(1): 3:1-3:39 (2009) - [c252]Dana Dachman-Soled, Tal Malkin, Mariana Raykova, Moti Yung:
Efficient Robust Private Set Intersection. ACNS 2009: 125-142 - [c251]Julien Cathalo, Benoît Libert, Moti Yung:
Group Encryption: Non-interactive Realization in the Standard Model. ASIACRYPT 2009: 179-196 - [c250]Seung Geol Choi, Ariel Elbaz, Tal Malkin, Moti Yung:
Secure Multi-party Computation Minimizing Online Rounds. ASIACRYPT 2009: 268-286 - [c249]David Naccache, Rainer Steinwandt, Moti Yung:
Reverse Public Key Encryption. BIOSIG 2009: 155-169 - [c248]Jung Yeon Hwang, Dong Hoon Lee, Moti Yung:
Universal forgery of the identity-based sequential aggregate signature scheme. AsiaCCS 2009: 157-160 - [c247]Jan Camenisch, Aggelos Kiayias, Moti Yung:
On the Portability of Generalized Schnorr Proofs. EUROCRYPT 2009: 425-442 - [c246]François-Xavier Standaert, Tal Malkin, Moti Yung:
A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks. EUROCRYPT 2009: 443-461 - [c245]Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung:
A New Randomness Extraction Paradigm for Hybrid Encryption. EUROCRYPT 2009: 590-609 - [c244]Aggelos Kiayias, Bülent Yener, Moti Yung:
Privacy-Preserving Information Markets for Computing Statistical Data. Financial Cryptography 2009: 32-50 - [c243]Shouhuai Xu, Moti Yung:
Expecting the Unexpected: Towards Robust Credential Infrastructure. Financial Cryptography 2009: 201-221 - [c242]Moti Yung:
How to Guard the Guards Themselves. FCT 2009: 1-2 - [c241]Maged H. Ibrahim, Aggelos Kiayias, Moti Yung, Hong-Sheng Zhou:
Secure Function Collection with Sublinear Storage. ICALP (2) 2009: 534-545 - [c240]Shouhuai Xu, Moti Yung:
SocialClouds: Concept, Security Architecture and Some Mechanisms. INTRUST 2009: 104-128 - [c239]Benoît Libert, Moti Yung:
Efficient Traceable Signatures in the Standard Model. Pairing 2009: 187-205 - [e32]Moti Yung, Peng Liu, Dongdai Lin:
Information Security and Cryptology, 4th International Conference, Inscrypt 2008, Beijing, China, December 14-17, 2008, Revised Selected Papers. Lecture Notes in Computer Science 5487, Springer 2009, ISBN 978-3-642-01439-0 [contents] - [e31]Pierangela Samarati, Moti Yung, Fabio Martinelli, Claudio A. Ardagna:
Information Security, 12th International Conference, ISC 2009, Pisa, Italy, September 7-9, 2009. Proceedings. Lecture Notes in Computer Science 5735, Springer 2009, ISBN 978-3-642-04473-1 [contents] - [e30]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. Lecture Notes in Computer Science 5379, Springer 2009, ISBN 978-3-642-00305-9 [contents] - [e29]Heung Youl Youm, Moti Yung:
Information Security Applications, 10th International Workshop, WISA 2009, Busan, Korea, August 25-27, 2009, Revised Selected Papers. Lecture Notes in Computer Science 5932, Springer 2009, ISBN 978-3-642-10837-2 [contents] - [i31]Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao:
Concurrent Knowledge-Extraction in the Public-Key Model. CoRR abs/0908.2476 (2009) - [i30]Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao:
Adaptive Concurrent Non-Malleability with Bare Public-Keys. CoRR abs/0910.3282 (2009) - [i29]Jan Camenisch, Aggelos Kiayias, Moti Yung:
On the Portability of Generalized Schnorr Proofs. IACR Cryptol. ePrint Arch. 2009: 50 (2009) - [i28]François-Xavier Standaert, Olivier Pereira, Yu Yu, Jean-Jacques Quisquater, Moti Yung, Elisabeth Oswald:
Leakage Resilient Cryptography in Practice. IACR Cryptol. ePrint Arch. 2009: 341 (2009) - 2008
- [j47]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) - [j46]Aggelos Kiayias, Moti Yung:
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. IEEE Trans. Inf. Theory 54(6): 2752-2769 (2008) - [c238]Debra L. Cook, Moti Yung, Angelos D. Keromytis:
Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers. ACISP 2008: 187-202 - [c237]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 - [c236]Benoît Libert, Jean-Jacques Quisquater, Moti Yung:
Key Evolution Systems in Untrusted Update Environments. Inscrypt 2008: 12-21 - [c235]Debra L. Cook, Moti Yung, Angelos D. Keromytis:
Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs. Inscrypt 2008: 157-180 - [c234]Aggelos Kiayias, Moti Yung:
Public-key traitor tracing from efficient decoding and unbounded enrollment: extended abstract. Digital Rights Management Workshop 2008: 9-18 - [c233]Vicente Benjumea, Seung Geol Choi, Javier López, Moti Yung:
Fair Traceable Multi-Group Signatures. Financial Cryptography 2008: 231-246 - [c232]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 - [c231]François-Xavier Standaert, Tal Malkin, Moti Yung:
Does Physical Security of Cryptographic Devices Need a Formal Study? (Invited Talk). ICITS 2008: 70 - [c230]Yongjin Yeom, Yongkuk Cho, Moti Yung:
High-Speed Implementations of Block Cipher ARIA Using Graphics Processing Units. MUE 2008: 271-275 - [c229]Petros Mol, Moti Yung:
Recovering NTRU Secret Key from Inversion Oracles. Public Key Cryptography 2008: 18-36 - [c228]Aggelos Kiayias, Shouhuai Xu, Moti Yung:
Privacy Preserving Data Mining within Anonymous Credential Systems. SCN 2008: 57-76 - [e28]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. Lecture Notes in Computer Science 5037, 2008, ISBN 978-3-540-68913-3 [contents] - [e27]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. Lecture Notes in Computer Science 4990, Springer 2008, ISBN 978-3-540-79498-1 [contents] - [e26]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. Lecture Notes in Computer Science 4867, Springer 2008, ISBN 978-3-540-77534-8 [contents] - [i27]Vicente Benjumea, Seung Geol Choi, Javier López, Moti Yung:
Fair Traceable Multi-Group Signatures. IACR Cryptol. ePrint Arch. 2008: 47 (2008) - [i26]Eike Kiltz, Krzysztof Pietrzak, Martijn Stam, Moti Yung:
A New Randomness Extraction Paradigm for Hybrid Encryption. IACR Cryptol. ePrint Arch. 2008: 304 (2008) - [i25]Debra L. Cook, Moti Yung, Angelos D. Keromytis:
Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs. IACR Cryptol. ePrint Arch. 2008: 496 (2008) - 2007
- [j45]Aggelos Kiayias, Moti Yung:
Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice. Des. Codes Cryptogr. 43(2-3): 61-78 (2007) - [j44]Jonathan Katz, Moti Yung:
Scalable Protocols for Authenticated Group Key Exchange. J. Cryptol. 20(1): 85-113 (2007) - [j43]Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung:
Decoding interleaved Reed-Solomon codes over noisy channels. Theor. Comput. Sci. 379(3): 348-360 (2007) - [c227]Donghoon Chang, Moti Yung, Jaechul Sung, Seokhie Hong, Sangjin Lee:
Preimage Attack on the Parallel FFT-Hashing Function. ACISP 2007: 59-67 - [c226]Aggelos Kiayias, Yiannis Tsiounis, Moti Yung:
Group Encryption. ASIACRYPT 2007: 181-199 - [c225]Seung Geol Choi, Ariel Elbaz, Ari Juels, Tal Malkin, Moti Yung:
Two-Party Computing with Encrypted Data. ASIACRYPT 2007: 298-314 - [c224]Vicente Benjumea, Seung Geol Choi, Javier López, Moti Yung:
Anonymity 2.0 - X.509 Extensions Supporting Privacy-Friendly Authentication. CANS 2007: 265-281 - [c223]Benoît Libert, Jean-Jacques Quisquater, Moti Yung:
Forward-secure signatures in untrusted update environments: efficient and generic constructions. CCS 2007: 266-275 - [c222]Debra L. Cook, Angelos D. Keromytis, Moti Yung:
Elastic block ciphers: the basic design. AsiaCCS 2007: 350-352 - [c221]Moti Yung:
On the Evolution of User Authentication: Non-bilateral Factors. Inscrypt 2007: 5-10 - [c220]Adam L. Young, Moti Yung:
A Timing-Resistant Elliptic Curve Backdoor in RSA. Inscrypt 2007: 427-441 - [c219]Moti Yung, Yunlei Zhao:
Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model. EUROCRYPT 2007: 129-147 - [c218]Shouhuai Xu, Moti Yung:
K-Anonymous Multi-party Secret Handshakes. Financial Cryptography 2007: 72-87 - [c217]Adam L. Young, Moti Yung:
Space-Efficient Kleptography Without Random Oracles. Information Hiding 2007: 112-129 - [c216]Shlomi Dolev, Limor Lahiani, Moti Yung:
Secret Swarm UnitReactive k-Secret Sharing. INDOCRYPT 2007: 123-137 - [c215]Debra L. Cook, Moti Yung, Angelos D. Keromytis:
The Security of Elastic Block Ciphers Against Key-Recovery Attacks. ISC 2007: 89-103 - [c214]Benoît Libert, Jean-Jacques Quisquater, Moti Yung:
Parallel Key-Insulated Public Key Encryption Without Random Oracles. Public Key Cryptography 2007: 298-314 - [e25]Jonathan Katz, Moti Yung:
Applied Cryptography and Network Security, 5th International Conference, ACNS 2007, Zhuhai, China, June 5-8, 2007, Proceedings. Lecture Notes in Computer Science 4521, Springer 2007, ISBN 978-3-540-72737-8 [contents] - [e24]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, ISBN 978-1-59593-888-6 [contents] - [e23]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, ISBN 978-1-59593-884-8 [contents] - [e22]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. Lecture Notes in Computer Science 4859, Springer 2007, ISBN 978-3-540-77025-1 [contents] - [e21]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. Lecture Notes in Computer Science 4298, Springer 2007, ISBN 978-3-540-71092-9 [contents] - [i24]Moti Yung, Yunlei Zhao:
Concurrent Knowledge-Extraction in the Public-Key Model. Electron. Colloquium Comput. Complex. TR07 (2007) - [i23]Aggelos Kiayias, Yiannis Tsiounis, Moti Yung:
Group Encryption. IACR Cryptol. ePrint Arch. 2007: 15 (2007) - [i22]Aggelos Kiayias, Moti Yung:
Cryptographic Hardness based on the Decoding of Reed-Solomon Codes. IACR Cryptol. ePrint Arch. 2007: 153 (2007) - [i21]Christophe Petit, François-Xavier Standaert, Olivier Pereira, Tal Malkin, Moti Yung:
A Block Cipher based PRNG Secure Against Side-Channel Key Recovery. IACR Cryptol. ePrint Arch. 2007: 356 (2007) - 2006
- [j42]Aggelos Kiayias, Moti Yung:
Secure scalable group signature with dynamic joins and separable authorities. Int. J. Secur. Networks 1(1/2): 24-45 (2006) - [j41]Jonathan Katz, Moti Yung:
Characterization of Security Notions for Probabilistic Private-Key Encryption. J. Cryptol. 19(1): 67-95 (2006) - [j40]Adam L. Young, Moti Yung:
On Fundamental Limitations of Proving Data Theft. IEEE Trans. Inf. Forensics Secur. 1(4): 524-531 (2006) - [c213]Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yung:
Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding. ASIACRYPT 2006: 283-298 - [c212]John G. Brainard, Ari Juels, Ronald L. Rivest, Michael Szydlo, Moti Yung:
Fourth-factor authentication: somebody you know. CCS 2006: 168-178 - [c211]Benoît Libert, Jean-Jacques Quisquater, Moti Yung:
Efficient Intrusion-Resilient Signatures Without Random Oracles. Inscrypt 2006: 27-41 - [c210]Aggelos Kiayias, Moti Yung:
Efficient Cryptographic Protocols Realizing E-Markets with Price Discrimination. Financial Cryptography 2006: 311-325 - [c209]Tal Malkin, François-Xavier Standaert, Moti Yung:
A Comparative Cost/Security Analysis of Fault Attack Countermeasures. FDTC 2006: 159-172 - [c208]Seyit Ahmet Çamtepe, Bülent Yener, Moti Yung:
Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks. ICC 2006: 2262-2267 - [c207]Adam L. Young, Moti Yung:
Hiding Information Hiding. Information Hiding 2006: 161-171 - [c206]Adam L. Young, Moti Yung:
An Elliptic Curve Backdoor Algorithm for RSASSA. Information Hiding 2006: 355-374 - [c205]Seung Geol Choi, Kunsoo Park, Moti Yung:
Short Traceable Signatures Based on Bilinear Pairings. IWSEC 2006: 88-103 - [c204]Moti Yung, Yunlei Zhao:
Interactive Zero-Knowledge with Restricted Random Oracles. TCC 2006: 21-40 - [c203]Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung:
Threshold and Proactive Pseudo-Random Permutations. TCC 2006: 542-560 - [e20]Jianying Zhou, Moti Yung, Feng Bao:
Applied Cryptography and Network Security, 4th International Conference, ACNS 2006, Singapore, June 6-9, 2006, Proceedings. Lecture Notes in Computer Science 3989, 2006, ISBN 3-540-34703-8 [contents] - [e19]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, ISBN 1-59593-548-7 [contents] - [e18]Helger Lipmaa, Moti Yung, Dongdai Lin:
Information Security and Cryptology, Second SKLOIS Conference, Inscrypt 2006, Beijing, China, November 29 - December 1, 2006, Proceedings. Lecture Notes in Computer Science 4318, Springer 2006, ISBN 3-540-49608-4 [contents] - [e17]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, ISBN 1-59593-555-X [contents] - [e16]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. Lecture Notes in Computer Science 3919, Springer 2006, ISBN 3-540-35998-2 [contents] - [e15]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. Lecture Notes in Computer Science 3958, Springer 2006, ISBN 3-540-33851-9 [contents] - [e14]Roberto De Prisco, Moti Yung:
Security and Cryptography for Networks, 5th International Conference, SCN 2006, Maiori, Italy, September 6-8, 2006, Proceedings. Lecture Notes in Computer Science 4116, Springer 2006, ISBN 3-540-38080-9 [contents] - [e13]JooSeok Song, Taekyoung Kwon, Moti Yung:
Information Security Applications, 6th International Workshop, WISA 2005, Jeju Island, Korea, August 22-24, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3786, Springer 2006, ISBN 3-540-31012-6 [contents] - [i20]Yevgeniy Dodis, Aleksandr Yampolskiy, Moti Yung:
Threshold and Proactive Pseudo-Random Permutations. IACR Cryptol. ePrint Arch. 2006: 17 (2006) - [i19]François-Xavier Standaert, Tal Malkin, Moti Yung:
A Unified Framework for the Analysis of Side-Channel Key Recovery Attacks (extended version). IACR Cryptol. ePrint Arch. 2006: 139 (2006) - [i18]Aggelos Kiayias, Moti Yung:
Copyrighting Public-key Functions and Applications to Black-box Traitor Tracing. IACR Cryptol. ePrint Arch. 2006: 458 (2006) - [i17]Donghoon Chang, Moti Yung:
Do We Need to Vary the Constants? (Methodological Investigation of Block-Cipher Based Hash Functions). IACR Cryptol. ePrint Arch. 2006: 467 (2006) - 2005
- [j39]Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung:
Scalable public-key tracing and revoking. Distributed Comput. 17(4): 323-347 (2005) - [c202]Cheol-Min Park, Myung-Hwan Kim, Moti Yung:
A Remark on Implementing the Weil Pairing. CISC 2005: 313-323 - [c201]Adam L. Young, Moti Yung:
Malicious Cryptography: Kleptographic Aspects. CT-RSA 2005: 7-18 - [c200]Aggelos Kiayias, Moti Yung:
Group Signatures with Efficient Concurrent Join. EUROCRYPT 2005: 198-214 - [c199]Aggelos Kiayias, Moti Yung:
Cryptography and decoding Reed-Solomon codes as a hard problem. ICITS 2005: 48 - [c198]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 - [c197]Aggelos Kiayias, Moti Yung:
Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers. Mycrypt 2005: 151-170 - [c196]Adam L. Young, Moti Yung:
Questionable Encryption and Its Applications. Mycrypt 2005: 210-221 - [c195]Adam L. Young, Moti Yung:
A Space Efficient Backdoor in RSA and Its Applications. Selected Areas in Cryptography 2005: 128-143 - [e12]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. Lecture Notes in Computer Science 3531, 2005, ISBN 3-540-26223-7 [contents] - [e11]Dengguo Feng, Dongdai Lin, Moti Yung:
Information Security and Cryptology, First SKLOIS Conference, CISC 2005, Beijing, China, December 15-17, 2005, Proceedings. Lecture Notes in Computer Science 3822, Springer 2005, ISBN 3-540-30855-5 [contents] - [e10]Reihaneh Safavi-Naini, Moti Yung:
Proceedings of the Fifth ACM Workshop on Digital Rights Management, Alexandria, VA, USA, November 7, 2005. ACM 2005, ISBN 1-59593-230-5 [contents] - [e9]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. Lecture Notes in Computer Science 3570, Springer 2005, ISBN 3-540-26656-9 [contents] - [e8]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. Lecture Notes in Computer Science 3580, Springer 2005, ISBN 3-540-27580-0 [contents] - [i16]Moti Yung, Yunlei Zhao:
Constant-Round Concurrently-Secure rZK in the (Real) Bare Public-Key Model. Electron. Colloquium Comput. Complex. TR05 (2005) - [i15]Aggelos Kiayias, Moti Yung:
Group Signatures with Efficient Concurrent Join. IACR Cryptol. ePrint Arch. 2005: 345 (2005) - 2004
- [b1]Adam L. Young, Moti Yung:
Malicious cryptography - exposing cryptovirology. Wiley 2004, ISBN 978-0-7645-4975-5, pp. I-XXIV, 1-392 - [j38]Poorvi L. Vora, Ben Adida, Ren Bucholz, David Chaum, David L. Dill, David R. Jefferson, Douglas W. Jones, William Lattin, Aviel D. Rubin, Michael Ian Shamos, Moti Yung:
Evaluation of voting systems. Commun. ACM 47(11): 144 (2004) - [j37]Matthew K. Franklin, Moti Yung:
Secure Hypergraphs: Privacy from Partial Broadcast. SIAM J. Discret. Math. 18(3): 437-450 (2004) - [c194]Luke McAven, Reihaneh Safavi-Naini, Moti Yung:
Unconditionally Secure Encryption Under Strong Attacks. ACISP 2004: 427-439 - [c193]Aggelos Kiayias, Moti Yung:
Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice. ASIACRYPT 2004: 401-416 - [c192]Shouhuai Xu, Moti Yung:
Accountable Ring Signatures: A Smart Card Approach. CARDIS 2004: 271-286 - [c191]Shouhuai Xu, Moti Yung:
k-anonymous secret handshakes with reusable credentials. CCS 2004: 158-167 - [c190]Theodore Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung:
The dual receiver cryptosystem and its applications. CCS 2004: 330-343 - [c189]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 - [c188]Adam L. Young, Moti Yung:
A Key Recovery System as Secure as Factoring. CT-RSA 2004: 129-142 - [c187]Tal Malkin, Satoshi Obana, Moti Yung:
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures. EUROCRYPT 2004: 306-322 - [c186]Aggelos Kiayias, Yiannis Tsiounis, Moti Yung:
Traceable Signatures. EUROCRYPT 2004: 571-589 - [c185]Aggelos Kiayias, Moti Yung:
The Vector-Ballot e-Voting Approach. Financial Cryptography 2004: 72-89 - [c184]Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung:
Electronic National Lotteries. Financial Cryptography 2004: 147-163 - [c183]Luke McAven, Reihaneh Safavi-Naini, Moti Yung:
Symmetric Authentication Codes with Secrecy and Unconditionally Secure Authenticated Encryption. INDOCRYPT 2004: 148-161 - [c182]Reihaneh Safavi-Naini, Luke McAven, Moti Yung:
General Group Authentication Codes and Their Relation to "Unconditionally-Secure Signatures". Public Key Cryptography 2004: 231-247 - [c181]Adam L. Young, Moti Yung:
A Subliminal Channel in Secret Block Ciphers. Selected Areas in Cryptography 2004: 198-211 - [c180]Adam L. Young, Moti Yung:
Relationships Between Diffie-Hellman and "Index Oracles". SCN 2004: 16-32 - [e7]Markus Jakobsson, Moti Yung, Jianying Zhou:
Applied Cryptography and Network Security, Second International Conference, ACNS 2004, Yellow Mountain, China, June 8-11, 2004, Proceedings. Lecture Notes in Computer Science 3089, Springer 2004, ISBN 3-540-22217-0 [contents] - [e6]Aggelos Kiayias, Moti Yung:
Proceedings of the 2004 ACM Workshop on Digital Rights Management 2004, Washington, DC, USA, October 25, 2004. ACM 2004, ISBN 1-58113-969-1 [contents] - [e5]Kijoon Chae, Moti Yung:
Information Security Applications, 4th International Workshop, WISA 2003, Jeju Island, Korea, August 25-27, 2003, Revised Papers. Lecture Notes in Computer Science 2908, Springer 2004, ISBN 3-540-20827-5 [contents] - [e4]Chae Hoon Lim, Moti Yung:
Information Security Applications, 5th International Workshop, WISA 2004, Jeju Island, Korea, August 23-25, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3325, Springer 2004, ISBN 3-540-24015-2 [contents] - [i14]Aggelos Kiayias, Yiannis Tsiounis, Moti Yung:
Traceable Signatures. IACR Cryptol. ePrint Arch. 2004: 7 (2004) - [i13]Tal Malkin, Satoshi Obana, Moti Yung:
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures. IACR Cryptol. ePrint Arch. 2004: 52 (2004) - [i12]Aggelos Kiayias, Moti Yung:
Group Signatures: Provable Security, Efficient Constructions and Anonymity from Trapdoor-Holders. IACR Cryptol. ePrint Arch. 2004: 76 (2004) - [i11]Debra L. Cook, Moti Yung, Angelos D. Keromytis:
Elastic Block Ciphers. IACR Cryptol. ePrint Arch. 2004: 128 (2004) - [i10]Debra L. Cook, Moti Yung, Angelos D. Keromytis:
Elastic AES. IACR Cryptol. ePrint Arch. 2004: 141 (2004) - [i9]Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung:
Scalable Public-Key Tracing and Revoking. IACR Cryptol. ePrint Arch. 2004: 160 (2004) - [i8]Aggelos Kiayias, Moti Yung:
Cryptanalyzing the Polynomial-Reconstruction based Public-Key System Under Optimal Parameter Choice. IACR Cryptol. ePrint Arch. 2004: 217 (2004) - 2003
- [c179]Adam L. Young, Moti Yung:
Backdoor Attacks on Black-Box Ciphers Exploiting Low-Entropy Plaintexts. ACISP 2003: 297-311 - [c178]Jonathan Katz, Moti Yung:
Scalable Protocols for Authenticated Group Key Exchange. CRYPTO 2003: 110-125 - [c177]Yevgeniy Dodis, Matthew K. Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung:
Intrusion-Resilient Public-Key Encryption. CT-RSA 2003: 19-32 - [c176]Mario Baldi, Yoram Ofek, Moti Yung:
Idiosyncratic Signatures for Authenticated Execution of Management Code. DSOM 2003: 204-206 - [c175]Aggelos Kiayias, Moti Yung:
Extracting Group Signatures from Traitor Tracing Schemes. EUROCRYPT 2003: 630-648 - [c174]Shouhuai Xu, Moti Yung:
Retrofitting Fairness on the Original RSA-Based E-cash. Financial Cryptography 2003: 51-68 - [c173]Moti Yung:
Trusted Computing Platforms: The Good, the Bad, and the Ugly. Financial Cryptography 2003: 250-254 - [c172]Aggelos Kiayias, Moti Yung:
Non-interactive Zero-Sharing with Applications to Private Distributed Decision Making. Financial Cryptography 2003: 303-320 - [c171]Mario Baldi, Yoram Ofek, Moti Yung:
The TrustedFlow (TM) Protocol-Idiosyncratic Signatures for Authenticated Execution. IAW 2003: 288-291 - [c170]Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung:
Decoding of Interleaved Reed Solomon Codes over Noisy Data. ICALP 2003: 97-108 - [c169]Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung:
Strong Key-Insulated Signature Schemes. Public Key Cryptography 2003: 130-144 - [c168]Yevgeniy Dodis, Nelly Fazio, Aggelos Kiayias, Moti Yung:
Scalable public-key tracing and revoking. PODC 2003: 190-199 - [p1]Aggelos Kiayias, Moti Yung:
Robust Verifiable non-Interactive Zero-Sharing - A Plug-in Utility for Enhanced Voters' Privacy. Secure Electronic Voting 2003: 139-151 - [e3]Jianying Zhou, Moti Yung, Yongfei Han:
Applied Cryptography and Network Security, First International Conference, ACNS 2003. Kunming, China, October 16-19, 2003, Proceedings. Lecture Notes in Computer Science 2846, Springer 2003, ISBN 3-540-20208-0 [contents] - [e2]Moti Yung:
Proceedings of the 2003 ACM workshop on Digital rights management 2003, Washington, DC, USA, October 27, 2003. ACM 2003, ISBN 1-58113-786-9 [contents] - [i7]Jonathan Katz, Moti Yung:
Scalable Protocols for Authenticated Group Key Exchange. IACR Cryptol. ePrint Arch. 2003: 171 (2003) - 2002
- [j36]Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti Yung:
Self-Stabilizing Symmetry Breaking in Constant Space. SIAM J. Comput. 31(5): 1571-1595 (2002) - [j35]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptively secure distributed public-key systems. Theor. Comput. Sci. 287(2): 535-561 (2002) - [c167]Hyun-Jeong Kim, Dong Hoon Lee, Moti Yung:
Privacy against Piracy: Protecting Two-Level Revocable P-K Traitor Tracing. ACISP 2002: 482-496 - [c166]Jonathan Katz, Moti Yung:
Threshold Cryptosystems Based on Factoring. ASIACRYPT 2002: 192-205 - [c165]Moti Yung:
Crypto-integrity. ASIACRYPT 2002: 567-573 - [c164]Aggelos Kiayias, Moti Yung:
Breaking and Repairing Asymmetric Public-Key Traitor Tracing. Digital Rights Management Workshop 2002: 32-50 - [c163]Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, Moti Yung:
Observability Analysis - Detecting When Improved Cryptosystems Fail. CT-RSA 2002: 17-29 - [c162]Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung:
Key-Insulated Public Key Cryptosystems. EUROCRYPT 2002: 65-82 - [c161]Aggelos Kiayias, Moti Yung:
Traitor Tracing with Constant Transmission Rate. EUROCRYPT 2002: 450-465 - [c160]Shouhuai Xu, Moti Yung:
The Dark Side of Threshold Cryptography. Financial Cryptography 2002: 198-219 - [c159]Daniel E. Geer Jr., Moti Yung:
Split-and-Delegate: Threshold Cryptography for the Masses. Financial Cryptography 2002: 220-237 - [c158]Aggelos Kiayias, Moti Yung:
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes. ICALP 2002: 232-243 - [c157]Aggelos Kiayias, Moti Yung:
Self-tallying Elections and Perfect Ballot Secrecy. Public Key Cryptography 2002: 141-158 - [c156]Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Forward Secrecy in Password-Only Key Exchange Protocols. SCN 2002: 29-44 - [c155]Yevgeniy Dodis, Moti Yung:
Exposure-Resilience for Free: The Hierarchical ID-based Encryption Case. IEEE Security in Storage Workshop 2002: 45-52 - [e1]Moti Yung:
Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 2002, Proceedings. Lecture Notes in Computer Science 2442, Springer 2002, ISBN 3-540-44050-X [contents] - [i6]Aggelos Kiayias, Moti Yung:
Cryptographic Hardness based on the Decoding of Reed-Solomon Codes with Applications. Electron. Colloquium Comput. Complex. TR02 (2002) - [i5]Yevgeniy Dodis, Jonathan Katz, Shouhuai Xu, Moti Yung:
Key-Insulated Public-Key Cryptosystems. IACR Cryptol. ePrint Arch. 2002: 77 (2002) - 2001
- [j34]David M'Raïhi, Moti Yung:
E-commerce applications of smart cards. Comput. Networks 36(4): 453-472 (2001) - [c154]Aggelos Kiayias, Moti Yung:
On Crafty Pirates and Foxy Tracers. Digital Rights Management Workshop 2001: 22-39 - [c153]Adam L. Young, Moti Yung:
Bandwidth-Optimal Kleptographic Attacks. CHES 2001: 235-250 - [c152]Aggelos Kiayias, Moti Yung:
Self Protecting Pirates and Black-Box Traitor Tracing. CRYPTO 2001: 63-79 - [c151]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 - [c150]Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. EUROCRYPT 2001: 475-494 - [c149]Ed Gerck, C. Andrew Neff, Ronald L. Rivest, Aviel D. Rubin, Moti Yung:
The Business of Electronic Voting. Financial Cryptography 2001: 234-259 - [c148]Enrico Buonanno, Jonathan Katz, Moti Yung:
Incremental Unforgeable Encryption. FSE 2001: 109-124 - [c147]Aggelos Kiayias, Moti Yung:
Secure Games with Polynomial Expressions. ICALP 2001: 939-950 - [c146]Enriquillo Valdez, Moti Yung:
DISSECT: DIStribution for SECurity Tool. ISC 2001: 125-143 - [c145]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptive Security for the Additive-Sharing Based Proactive RSA. Public Key Cryptography 2001: 240-263 - [c144]Adam L. Young, Moti Yung:
A PVSS as Hard as Discrete Log and Shareholder Separability. Public Key Cryptography 2001: 287-299 - [c143]Aggelos Kiayias, Moti Yung:
Polynomial Reconstruction Based Cryptography. Selected Areas in Cryptography 2001: 129-133 - [i4]Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. IACR Cryptol. ePrint Arch. 2001: 31 (2001) - [i3]Jonathan Katz, Moti Yung:
Threshold Cryptosystems Based on Factoring. IACR Cryptol. ePrint Arch. 2001: 93 (2001) - 2000
- [j33]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) - [j32]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) - [j31]Yoram Ofek, Moti Yung:
Combined Asynchronous/Synchronous Packet Switching Architecture: QoS Guarantees for Integrated Parallel Computing and Real-Time Traffic. J. Parallel Distributed Comput. 60(3): 275-295 (2000) - [j30]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) - [j29]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) - [c142]Adam L. Young, Moti Yung:
Towards Signature-Only Signature Schemes. ASIACRYPT 2000: 97-115 - [c141]Shouhuai Xu, Moti Yung, Gendu Zhang:
Friendly Observers Ease Off-Line E-Cash. CARDIS 2000: 3-18 - [c140]Johan Håstad, Jakob Jonsson, Ari Juels, Moti Yung:
Funkspiel schemes: an alternative to conventional tamper resistance. CCS 2000: 125-133 - [c139]Tomas Sander, Amnon Ta-Shma, Moti Yung:
Blind, Auditable Membership Proofs. Financial Cryptography 2000: 53-71 - [c138]Moti Yung:
Payment Systems: The Next Generation. Financial Cryptography 2000: 136-139 - [c137]Jonathan Katz, Moti Yung:
Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation. FSE 2000: 284-299 - [c136]Adam L. Young, Moti Yung:
Hash to the Rescue: Space Minimization for PKI Directories. ICISC 2000: 235-245 - [c135]Ernest F. Brickell, David Pointcheval, Serge Vaudenay, Moti Yung:
Design Validations for Discrete Logarithm Based Signature Schemes. Public Key Cryptography 2000: 276-292 - [c134]Yair Frankel, Philip D. MacKenzie, Moti Yung:
"Psyeudorandom Intermixing": A Tool for Shared Cryptography. Public Key Cryptography 2000: 306-325 - [c133]Adam L. Young, Moti Yung:
RSA-Based Auto-recoverable Cryptosystems. Public Key Cryptography 2000: 326-341 - [c132]Jonathan Katz, Moti Yung:
Complete characterization of security notions for probabilistic private-key encryption. STOC 2000: 245-254 - [c131]Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung:
On zero-knowledge proofs (extended abstract): "from membership to decision". STOC 2000: 255-264
1990 – 1999
- 1999
- [j28]Bülent Yener, Yoram Ofek, Moti Yung:
Convergence routing on disjoint spanning trees. Comput. Networks 31(5): 429-443 (1999) - [j27]Yoram Ofek, Moti Yung:
Access regulation mechanism for switch-based LAN. Comput. Networks 31(5): 505-518 (1999) - [c130]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptively-Secure Optimal-Resilience Proactive RSA. ASIACRYPT 1999: 180-194 - [c129]Alain J. Mayer, Moti Yung:
Secure Protocol Transformation via "Expansion": From Two-Party to Groups. CCS 1999: 83-92 - [c128]Markus Jakobsson, David M'Raïhi, Yiannis Tsiounis, Moti Yung:
Electronic Payments: Where Do We Go from Here?. CQRE 1999: 43-63 - [c127]Adam L. Young, Moti Yung:
Auto-recoverable Auto-certifiable Cryptosystems (A Survey). CQRE 1999: 204-218 - [c126]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptively-Secure Distributed Public-Key Systems. ESA 1999: 4-27 - [c125]Yair Frankel, Moti Yung:
Cryptosystems Robust against "Dynamic Faults" Meet Enterprise Needs for Organizational "Change Control". Financial Cryptography 1999: 241-252 - [c124]Tomas Sander, Adam L. Young, Moti Yung:
Non-Interactive CryptoComputing For NC1. FOCS 1999: 554-567 - [c123]Markus Jakobsson, Julien P. Stern, Moti Yung:
Scramble All, Encrypt Small. FSE 1999: 95-111 - [c122]Shingo Miyazaki, Kouichi Sakurai, Moti Yung:
On Threshold RSA-Signing with no Dealer. ICISC 1999: 197-207 - [c121]Pascal Paillier, Moti Yung:
Self-Escrowed Public-Key Infrastructures. ICISC 1999: 257-268 - [c120]Enriquillo Valdez, Moti Yung:
Software DisEngineering: Program Hiding Architecture and Experiments. Information Hiding 1999: 379-394 - [c119]Shouhuai Xu, Moti Yung, Gendu Zhang, Hong Zhu:
Money Conservation via Atomicity in Fair Off-Line E-Cash. ISW 1999: 14-31 - [c118]Helena Handschuh, Yiannis Tsiounis, Moti Yung:
Decision Oracles are Equivalent to Matching Oracles. Public Key Cryptography 1999: 276-289 - [c117]Adam L. Young, Moti Yung:
Auto-Recoverable Cryptosystems with Faster Initialization and the Escrow Hierarchy. Public Key Cryptography 1999: 306-314 - [c116]Matthew K. Franklin, Juan A. Garay, Moti Yung:
Self-Testing/Correcting Protocols (Extended Abstract). DISC 1999: 269-283 - 1998
- [j26]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) - [j25]Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation. J. Cryptol. 11(2): 87-108 (1998) - [c115]Adam L. Young, Moti Yung:
Finding Length-3 Positive Cunningham Chains. ANTS 1998: 289-298 - [c114]Yair Frankel, Yiannis Tsiounis, Moti Yung:
Fair Off-Line e-cash Made Easy. ASIACRYPT 1998: 257-270 - [c113]Yair Frankel, Moti Yung:
How to Say "YES" with Smart Cards. CARDIS 1998: 203-212 - [c112]Adam L. Young, Moti Yung:
Auto-Recoverable Auto-Certifiable Cryptosystems. EUROCRYPT 1998: 17-31 - [c111]Markus Jakobsson, Moti Yung:
On Assurance Structures for WWW Commerce. Financial Cryptography 1998: 141-157 - [c110]Yair Frankel, David W. Kravitz, Charles T. Montgomery, Moti Yung:
Beyond Identity: Warranty-Based Digital Signature Transactions. Financial Cryptography 1998: 241-253 - [c109]Adam L. Young, Moti Yung:
Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs. FSE 1998: 122-133 - [c108]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung:
Image Density is Complete for Non-Interactive-SZK (Extended Abstract). ICALP 1998: 784-795 - [c107]Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung:
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it. ISAAC 1998: 59-68 - [c106]Yair Frankel, Moti Yung:
Distributed Public Key Cryptosystems. Public Key Cryptography 1998: 1-13 - [c105]Tatsuaki Okamoto, Moti Yung:
Lower Bounds on Term-Based Divisible Cash Systems. Public Key Cryptography 1998: 72-82 - [c104]Yiannis Tsiounis, Moti Yung:
On the Security of ElGamal Based Encryption. Public Key Cryptography 1998: 117-134 - [c103]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Robust Efficient Distributed RSA-Key Generation. PODC 1998: 320 - [c102]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 - [c101]Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung:
Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols. STACS 1998: 511-521 - [c100]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Robust Efficient Distributed RSA-Key Generation. STOC 1998: 663-672 - [c99]Mihir Bellare, Juan A. Garay, Charanjit S. Jutla, Moti Yung:
VarietyCash: A Multi-Purpose Electronic Payment System. USENIX Workshop on Electronic Commerce 1998 - 1997
- [j24]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) - [j23]Bülent Yener, Inderpal S. Bhandari, Yoram Ofek, Moti Yung:
Fault-Tolerant Convergence Routing. J. Parallel Distributed Comput. 42(2): 173-183 (1997) - [j22]Yoram Ofek, Bülent Yener, Moti Yung:
Concurrent Asynchronous Broadcast on the MetaNet. IEEE Trans. Computers 46(7): 737-748 (1997) - [j21]Xiangdong Yu, Moti Yung:
Scheduling Task-Trees with Additive Scales on Parallel/Distributed Machines. Theor. Comput. Sci. 181(2): 357-378 (1997) - [j20]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) - [j19]Bülent Yener, Yoram Ofek, Moti Yung:
Combinatorial design of congestion-free networks. IEEE/ACM Trans. Netw. 5(6): 989-1000 (1997) - [c98]Amir Herzberg, Markus Jakobsson, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung:
Proactive Public Key and Signature Systems. CCS 1997: 100-110 - [c97]Giovanni Di Crescenzo, Tatsuaki Okamoto, Moti Yung:
Keeping the SZK-Verifier Honest Unconditionally. CRYPTO 1997: 31-45 - [c96]Adam L. Young, Moti Yung:
The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. CRYPTO 1997: 264-276 - [c95]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Proactive RSA. CRYPTO 1997: 440-454 - [c94]Adam L. Young, Moti Yung:
Kleptography: Using Cryptography Against Cryptography. EUROCRYPT 1997: 62-74 - [c93]Mihir Bellare, Markus Jakobsson, Moti Yung:
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function. EUROCRYPT 1997: 280-305 - [c92]Markus Jakobsson, Moti Yung:
Distributed "Magic Ink" Signatures. EUROCRYPT 1997: 450-464 - [c91]George I. Davida, Yair Frankel, Yiannis Tsiounis, Moti Yung:
Anonymity Control in E-Cash Systems. Financial Cryptography 1997: 1-16 - [c90]Markus Jakobsson, Moti Yung:
Applying Anti-Trust Policies to Increase Trust in a Versatile E-Money System. Financial Cryptography 1997: 217-238 - [c89]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Optimal Resilience Proactive Public-Key Cryptosystems. FOCS 1997: 384-393 - [c88]Adam L. Young, Moti Yung:
Sliding Encryption: A Cryptographic Tool for Mobile Agents. FSE 1997: 230-241 - [c87]Yair Frankel, Moti Yung:
On Characterization of Escrow Encryption Schemes. ICALP 1997: 705-715 - [c86]Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung:
Zero-knowledge proofs of decision power: new protocols and optimal round-complexity. ICICS 1997: 17-27 - [c85]Philippe A. Janson, Gene Tsudik, Moti Yung:
Scalability and Flexibility in Authentication Services: The KryptoKnight Approach. INFOCOM 1997: 725-736 - [c84]Andrew Mayer, Moti Yung:
Generalized secret sharing and group-key distribution using short keys. SEQUENCES 1997: 30-44 - [c83]Adam L. Young, Moti Yung:
Deniable Password Snatching: On the Possibility of Evasive Electronic Espionage. S&P 1997: 224-235 - [i2]Mihir Bellare, Markus Jakobsson, Moti Yung:
Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function. IACR Cryptol. ePrint Arch. 1997: 2 (1997) - 1996
- [j18]Mihir Bellare, Moti Yung:
Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation. J. Cryptol. 9(3): 149-166 (1996) - [c82]Yair Frankel, Yiannis Tsiounis, Moti Yung:
"Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash. ASIACRYPT 1996: 286-300 - [c81]Markus Jakobsson, Moti Yung:
Revokable and Versatile Electronic Money (extended abstract). CCS 1996: 76-87 - [c80]Vasant Shanbhogue, Moti Yung:
Distributed Computing in Asynchronous Networks with Byzantine Edges. COCOON 1996: 352-360 - [c79]Adam L. Young, Moti Yung:
The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone? CRYPTO 1996: 89-103 - [c78]Markus Jakobsson, Moti Yung:
Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers. CRYPTO 1996: 186-200 - [c77]Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, Moti Yung:
Multi-Autority Secret-Ballot Elections with Linear Work. EUROCRYPT 1996: 72-83 - [c76]Xiangdong Yu, Moti Yung:
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem. ICALP 1996: 610-621 - [c75]Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya, Moti Yung:
A Progress Report on Subliminal-Free Channels. Information Hiding 1996: 157-168 - [c74]Chung-Sheng Li, Yoram Ofek, Moti Yung:
"Time-Driven Priority" Flow Control for Real-Time Heterogeneous Internetworking. INFOCOM 1996: 189-197 - [c73]Alain J. Mayer, Yoram Ofek, Moti Yung:
Approximating Max-Min Fair Rates via Distributed Local Scheduling with Partial Information. INFOCOM 1996: 928-936 - [c72]Yair Frankel, Peter Gemmell, Moti Yung:
Witness-Based Cryptographic Program Checking and Applications (an Announcement). PODC 1996: 211 - [c71]Alain J. Mayer, Rafail Ostrovsky, Moti Yung:
Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. SODA 1996: 564-573 - [c70]Adam L. Young, Moti Yung:
Cryptovirology: Extortion-Based Security Threats and Countermeasures. S&P 1996: 129-140 - [c69]Yair Frankel, Peter Gemmell, Moti Yung:
Witness-Based Cryptographic Program Checking and Robust Function Sharing. STOC 1996: 499-508 - [i1]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Proactive RSA. IACR Cryptol. ePrint Arch. 1996: 12 (1996) - 1995
- [j17]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) - [j16]Yoram Ofek, Moti Yung:
METANET principles of an arbitrary topology LAN. IEEE/ACM Trans. Netw. 3(2): 169-180 (1995) - [j15]Yair Frankel, Amir Herzberg, Paul A. Karger, Hugo Krawczyk, Charles A. Kunzinger, Mordechai M. Yung:
Security issues in a CDPD wireless network. IEEE Wirel. Commun. 2(4): 16-27 (1995) - [c68]Xiangdong Yu, Moti Yung:
Scheduling Task-Tree with Additive Scales on Parallel / Distributed Machines. COCOON 1995: 607-616 - [c67]Yair Frankel, Moti Yung:
Escrow Encryption Systems Visited: Attacks, Analysis and Designs. CRYPTO 1995: 222-235 - [c66]Yair Frankel, Moti Yung:
Cryptanalysis of the Immunized LL Public Key Systems. CRYPTO 1995: 287-296 - [c65]Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, Moti Yung:
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. CRYPTO 1995: 339-352 - [c64]Noga Alon, Zvi Galil, Moti Yung:
Efficient Dynamic-Resharing "Verifiable Secret Sharing" Against Mobile Adversary. ESA 1995: 523-537 - [c63]Zvi Galil, Alain J. Mayer, Moti Yung:
Resolving Message Complexity of Byzantine Agreement and beyond. FOCS 1995: 724-733 - [c62]Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung:
Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time. ICALP 1995: 159-170 - [c61]Bülent Yener, Yoram Ofek, Moti Yung:
Topological Design of Loss-Free Switch-Based LANs. INFOCOM 1995: 88-96 - [c60]Alain J. Mayer, Yoram Ofek, Moti Yung:
Local Fairness in General-Topology Networks with Convergence Routing. INFOCOM 1995: 891-899 - [c59]Matthew K. Franklin, Moti Yung:
Secure hypergraphs: privacy from partial broadcast (Extended Abstract). STOC 1995: 36-44 - 1994
- [j14]Yoram Ofek, Moti Yung:
Routing and Flow Control on the MetaNet: An Overview. Comput. Networks ISDN Syst. 26(6-8): 859-872 (1994) - [c58]Xiangdong Yu, Moti Yung:
Space Lower-Bounds for Pseudorandom-Generators. SCT 1994: 186-197 - [c57]Giuseppe Parlati, Moti Yung:
Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking. ESA 1994: 183-201 - [c56]Matthew K. Franklin, Moti Yung:
The Blinding of Weak Signatures (Extended Abstract). EUROCRYPT 1994: 67-76 - [c55]Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung:
On Monotone Formula Closure of SZK. FOCS 1994: 454-465 - [c54]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 - [c53]Bülent Yener, Inderpal S. Bhandari, Yoram Ofek, Moti Yung:
Fault-tolerant convergence routing. ICNP 1994: 229-238 - [c52]Yoram Ofek, Moti Yung:
The Integrated MetaNet Architecture: A Switch-Based Multimedia LAN for Parallel Computing and Real-Time Traffic. INFOCOM 1994: 802-811 - [c51]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 - [c50]William Aiello, Ramarathnam Venkatesan, Moti Yung:
Coins, Weights and Contention in Balancing Networks. PODC 1994: 193-205 - [c49]Alfredo De Santis, Yvo Desmedt, Yair Frankel, Moti Yung:
How to share a function securely. STOC 1994: 522-533 - [c48]Moti Yung:
Secure Distributed Computing: Theory and Practice. WDAG 1994: 53-73 - 1993
- [j13]Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung:
Perfectly Secure Message Transmission. J. ACM 40(1): 17-47 (1993) - [j12]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 15(1): 173 (1993) - [j11]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 J. Sel. Areas Commun. 11(5): 679-693 (1993) - [c47]Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Interactive Hashing Simplifies Zero-Knowledge Protocol Design. EUROCRYPT 1993: 267-273 - [c46]Matthew K. Franklin, Zvi Galil, Moti Yung:
Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems. FOCS 1993: 670-679 - [c45]Matthew K. Franklin, Moti Yung:
Secure and Efficient Off-Line Digital Money (Extended Abstract). ICALP 1993: 265-276 - [c44]Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung:
Efficient On-Line Call Control Algorithms. ISTCS 1993: 285-293 - [c43]Bülent Yener, Yoram Ofek, Moti Yung:
Configuration and performance issues in the MetaNet design. LCN 1993: 291-299 - 1992
- [j10]Othar Hansson, Andrew Mayer, Moti Yung:
Criticizing solutions to relaxed models yields powerful admissible heuristics. Inf. Sci. 63(3): 207-227 (1992) - [j9]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. J. Algorithms 13(1): 33-54 (1992) - [c42]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 - [c41]Mihir Bellare, Moti Yung:
Certifying Cryptographic Tools: The Case of Trapdoor Permutations. CRYPTO 1992: 442-460 - [c40]Carlo Blundo, Alfredo De Santis, Amir Herzberg, Shay Kutten, Ugo Vaccaro, Moti Yung:
Perfectly-Secure Key Distribution for Dynamic Conferences. CRYPTO 1992: 471-486 - [c39]Alfredo De Santis, Giuseppe Persiano, Moti Yung:
One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier. ICALP 1992: 28-40 - [c38]Yvo Desmedt, Yair Frankel, Moti Yung:
Multi-Receiver/Multi-Sender Network Security: Efficient Authenticated Multicast/Feedback. INFOCOM 1992: 2045-2054 - [c37]Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Secure Commitment Against A Powerful Adversary. STACS 1992: 439-448 - [c36]Alain J. Mayer, Yoram Ofek, Rafail Ostrovsky, Moti Yung:
Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract). STOC 1992: 667-678 - [c35]Matthew K. Franklin, Moti Yung:
Communication Complexity of Secure Computation (Extended Abstract). STOC 1992: 699-710 - 1991
- [j8]Gilles Brassard, Claude Crépeau, Moti Yung:
Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. Theor. Comput. Sci. 84(1): 23-52 (1991) - [c34]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 - [c33]Yvo Desmedt, Moti Yung:
Weakness of Undeniable Signature Schemes (Extended Abstract). EUROCRYPT 1991: 205-220 - [c32]Yoram Ofek, Moti Yung:
Lossless Asynchronous Broadcast-with-Feedback on the MetaNet Architecture. INFOCOM 1991: 1050-1063 - [c31]Rafail Ostrovsky, Moti Yung:
How to Withstand Mobile Virus Attacks (Extended Abstract). PODC 1991: 51-59 - [c30]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 - 1990
- [j7]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) - [c29]Gilles Brassard, Moti Yung:
One-Way Group Actions. CRYPTO 1990: 94-107 - [c28]Yvo Desmedt, Moti Yung:
Abritrated Unconditionally Secure Authentication Can Be Unconditionally Protected Against Arbiter's Attacks (Extended Abstract). CRYPTO 1990: 177-188 - [c27]Alfredo De Santis, Moti Yung:
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems. CRYPTO 1990: 366-377 - [c26]Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung:
Fair Games against an All-Powerful Adversary. Advances In Computational Complexity Theory 1990: 155-169 - [c25]Alfredo De Santis, Moti Yung:
On the Design of Provably Secure Cryptographic Hash Functions. EUROCRYPT 1990: 412-431 - [c24]Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung:
Perfectly Secure Message Transmission. FOCS 1990: 36-45 - [c23]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 - [c22]David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung:
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. SODA 1990: 1-11 - [c21]Moni Naor, Moti Yung:
Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. STOC 1990: 427-437 - [c20]Yehuda Afek, Shay Kutten, Moti Yung:
Memory-Efficient Self Stabilizing Protocols for General Networks. WDAG 1990: 15-28 - [c19]Yoram Ofek, Moti Yung:
Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed Networks. WDAG 1990: 192-212
1980 – 1989
- 1989
- [j6]Marek Chrobak, Moti Yung:
Fast Algorithms for Edge-Coloring Planar Graphs. J. Algorithms 10(1): 35-51 (1989) - [j5]Bruce Abramson, Moti Yung:
Divide and Conquer under Global Constraints: A Solution to the N-Queens Problem. J. Parallel Distributed Comput. 6(3): 649-662 (1989) - [j4]Zvi Galil, Stuart Haber, Moti Yung:
Minimum-Knowledge Interactive Proofs for Decision Problems. SIAM J. Comput. 18(4): 711-739 (1989) - [c18]Zvi Galil, Stuart Haber, Moti Yung:
Security against Replay Chosen-Ciphertext Attack. Distributed Computing And Cryptography 1989: 183-190 - [c17]Rafail Ostrovsky, Moti Yung:
On Necessary Conditions for Secure Distributed Computation. Distributed Computing And Cryptography 1989: 229-234 - [c16]Zvi Galil, Stuart Haber, Moti Yung:
A Secure Public-key Authentication Scheme. EUROCRYPT 1989: 3-15 - [c15]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 - [c14]Moti Yung:
Zero-Knowledge Proofs of Computational Power (Extended Summary). EUROCRYPT 1989: 196-207 - [c13]Michael Kharitonov, Andrew V. Goldberg, Moti Yung:
Lower Bounds for Pseudorandom Number Generators. FOCS 1989: 242-247 - [c12]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 - [c11]Moni Naor, Moti Yung:
Universal One-Way Hash Functions and their Cryptographic Applications. STOC 1989: 33-43 - 1988
- [c10]Marek Chrobak, Moti Yung:
Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs. AWOC 1988: 11-23 - [c9]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
- [j3]Zvi Galil, Moti Yung:
Partitioned Encryption and Achieving Simultaneity by Partitioning. Inf. Process. Lett. 26(2): 81-88 (1987) - [j2]Zvi Galil, Gad M. Landau, Mordechai M. Yung:
Distributed Algorithms in Synchronous Broadcasting Networks. Theor. Comput. Sci. 49: 171-184 (1987) - [c8]Russell Impagliazzo, Moti Yung:
Direct Minimum-Knowledge Computations. CRYPTO 1987: 40-51 - [c7]Zvi Galil, Stuart Haber, Moti Yung:
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model. CRYPTO 1987: 135-155 - 1986
- [c6]Bruce Abramson, Moti Yung:
Construction Through Decomposition: A Divide-and-Conquer Algoithm for the N-Queens Problem. FJCC 1986: 620-628 - [c5]Josh Cohen Benaloh, Moti Yung:
Distributing the Power of a Government to Enhance the Privacy of Voters (Extended Abstract). PODC 1986: 52-62 - 1985
- [j1]Mordechai M. Yung:
A Secure and Useful 'Keyless Cryptosystem'. Inf. Process. Lett. 21(1): 35-38 (1985) - [c4]Zvi Galil, Stuart Haber, Moti Yung:
Symmetric Public-Key Encryption. CRYPTO 1985: 128-137 - [c3]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 - [c2]Gad M. Landau, Mordechai M. Yung, Zvi Galil:
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract). ICALP 1985: 363-372 - 1984
- [c1]Moti Yung:
Cryptoprotocols: Subscription to a Public Key, the Secret Blocking and the Multi-Player Mental Poker Game (Extended Abstract). CRYPTO 1984: 439-453
Coauthor Index
[j70] [c300] [i55] [c287] [i40] [c260] [c253] [c247] [c244] [c241] [i29] [j46] [c234] [c228] [j45] [j43] [c226] [e23] [i23] [i22] [j42] [c210] [e15] [i18] [j39] [c200] [c199] [c197] [i15] [c193] [c186] [c185] [e6] [i14] [i12] [i9] [i8] [c175] [c172] [c170] [c168] [p1] [c164] [c161] [c158] [c157] [i6] [c154] [c152] [c147] [c143]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-04 21:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
