Adam L. Young

Adam L. Young, Moti Yung: Kleptography from Standard Assumptions and Applications. SCN 2010: 271-290

Adam L. Young, Moti Yung: A Timing-Resistant Elliptic Curve Backdoor in RSA. Inscrypt 2007: 427-441

Adam L. Young, Moti Yung: Space-Efficient Kleptography Without Random Oracles. Information Hiding 2007: 112-129

Adam L. Young: Cryptoviral extortion using Microsoft's Crypto API. Int. J. Inf. Sec. 5(2): 67-76 (2006)

Adam L. Young, Moti Yung: On Fundamental Limitations of Proving Data Theft. IEEE Transactions on Information Forensics and Security 1(4): 524-531 (2006)

Adam L. Young, Moti Yung: Hiding Information Hiding. Information Hiding 2006: 161-171

Adam L. Young, Moti Yung: An Elliptic Curve Backdoor Algorithm for RSASSA. Information Hiding 2006: 355-374

Adam L. Young, Moti Yung: Malicious Cryptography: Kleptographic Aspects. CT-RSA 2005: 7-18

Adam L. Young: Building a Cryptovirus Using Microsoft's Cryptographic API. ISC 2005: 389-401

Adam L. Young, Moti Yung: Questionable Encryption and Its Applications. Mycrypt 2005: 210-221

Adam L. Young, Moti Yung: A Space Efficient Backdoor in RSA and Its Applications. Selected Areas in Cryptography 2005: 128-143

Markus Jakobsson, Adam L. Young: Distributed Phishing Attacks. IACR Cryptology ePrint Archive 2005: 91 (2005)

Adam L. Young, Moti Yung: Malicious cryptography - exposing cryptovirology. Wiley 2004, isbn 978-0-7645-4975-5, pp. I-XXIV, 1-392

Adam L. Young, Moti Yung: A Key Recovery System as Secure as Factoring. CT-RSA 2004: 129-142

Adam L. Young, Moti Yung: A Subliminal Channel in Secret Block Ciphers. Selected Areas in Cryptography 2004: 198-211

Adam L. Young, Moti Yung: Relationships Between Diffie-Hellman and "Index Oracles". SCN 2004: 16-32

Adam L. Young, Moti Yung: Backdoor Attacks on Black-Box Ciphers Exploiting Low-Entropy Plaintexts. ACISP 2003: 297-311

Adam L. Young: Non-Zero Sum Games and Survivable Malware. IAW 2003: 24-29

Adam L. Young: A Weakness in Smart Card PKI Certification. IAW 2003: 30-34

Adam L. Young, Moti Yung: Bandwidth-Optimal Kleptographic Attacks. CHES 2001: 235-250

Markus Jakobsson, David Pointcheval, Adam L. Young: Secure Mobile Gambling. CT-RSA 2001: 110-125

Adam L. Young, Moti Yung: A PVSS as Hard as Discrete Log and Shareholder Separability. Public Key Cryptography 2001: 287-299

Adam L. Young, Moti Yung: Towards Signature-Only Signature Schemes. ASIACRYPT 2000: 97-115

Adam L. Young, Moti Yung: Hash to the Rescue: Space Minimization for PKI Directories. ICISC 2000: 235-245

Adam L. Young, Moti Yung: RSA-Based Auto-recoverable Cryptosystems. Public Key Cryptography 2000: 326-341

Adam L. Young, Moti Yung: Auto-recoverable Auto-certifiable Cryptosystems (A Survey). CQRE 1999: 204-218

Tomas Sander, Adam L. Young, Moti Yung: Non-Interactive CryptoComputing For NC¹. FOCS 1999: 554-567

Adam L. Young, Moti Yung: Auto-Recoverable Cryptosystems with Faster Initialization and the Escrow Hierarchy. Public Key Cryptography 1999: 306-314

Adam L. Young, Moti Yung: Finding Length-3 Positive Cunningham Chains. ANTS 1998: 289-298

Adam L. Young, Moti Yung: Auto-Recoverable Auto-Certifiable Cryptosystems. EUROCRYPT 1998: 17-31

Adam L. Young, Moti Yung: Monkey: Black-Box Symmetric Ciphers Designed for MONopolizing KEYs. FSE 1998: 122-133

Adam L. Young, Moti Yung: The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems. CRYPTO 1997: 264-276

Adam L. Young, Moti Yung: Kleptography: Using Cryptography Against Cryptography. EUROCRYPT 1997: 62-74

Adam L. Young, Moti Yung: Sliding Encryption: A Cryptographic Tool for Mobile Agents. FSE 1997: 230-241

Adam L. Young, Moti Yung: Deniable Password Snatching: On the Possibility of Evasive Electronic Espionage. IEEE Symposium on Security and Privacy 1997: 224-235

Adam L. Young, Moti Yung: The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone? CRYPTO 1996: 89-103

Adam L. Young, Moti Yung: Cryptovirology: Extortion-Based Security Threats and Countermeasures. IEEE Symposium on Security and Privacy 1996: 129-140