Scott Yilek

dblp:93/5760 · DBLP profile ↗
← Back
16ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 15 · 1 first-author · 3 since 2021Theory of computation · 2Computer networks · 1 · 1 first-author
YearPublicationVenuePosition
2025 Sum-Preserving Encryption: Improved Bounds and Constructions for Long Vectors
Sarah Miracle, Scott Yilek
ACNS (1)2
2023 Targeted Invertible Pseudorandom Functions and Deterministic Format-Transforming Encryption
Sarah Miracle, Scott Yilek
CT-RSA2
2022 New Algorithms and Analyses for Sum-Preserving Encryption
Sarah Miracle, Scott Yilek
ASIACRYPT (3)2
2018 Targeted Ciphers for Format-Preserving Encryption
Sarah Miracle, Scott Yilek
SAC2
2017 Cycle Slicer: An Algorithm for Building Permutations on Special Domains
Sarah Miracle, Scott Yilek
ASIACRYPT (3)2
2016 Reverse Cycle Walking and Its Applications
Sarah Miracle, Scott Yilek
ASIACRYPT (1)2
2013 The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
Thomas Ristenpart, Scott Yilek
CRYPTO (1)2
2012 Standard Security Does Not Imply Security against Selective-Opening
Mihir Bellare, Rafael Dowsley, Brent Waters, Scott Yilek
EUROCRYPT4
2011 Identity-Based Encryption Secure against Selective Opening Attack
Mihir Bellare, Brent Waters, Scott Yilek
TCC3
2010 Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine
Scott Yilek
CT-RSA1
2010 When Good Randomness Goes Bad: Virtual Machine Reset Vulnerabilities and Hedging Deployed Cryptography
Thomas Ristenpart, Scott Yilek
NDSS2
2009 Hedged Public-Key Encryption: How to Protect against Bad Randomness
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev 0001, Hovav Shacham, Scott Yilek
ASIACRYPT7
2009 Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
Mihir Bellare, Dennis Hofheinz, Scott Yilek
EUROCRYPT3
2009 When private keys are public: results from the 2008 Debian OpenSSL vulnerability
abstract
We report on the aftermath of the discovery of a severe vulnerability in the Debian Linux version of OpenSSL. Systems affected by the bug generated predictable random numbers, most importantly public/private keypairs. To study user response to this vulnerability, we collected a novel dataset of daily remote scans of over 50,000 SSL/TLS-enabled Web servers, of which 751 displayed vulnerable certificates. We report three primary results. First, as expected from previous work, we find an extremely slow rate of fixing, with 30% of the hosts vulnerable when we began our survey on day 4 after disclosure still vulnerable almost six months later. However, unlike conventional vulnerabilities, which typically show a short, fast fixing phase, we observe a much flatter curve with fixing extending six months after the announcement. Second, we identify some predictive factors for the rate of upgrading. Third, we find that certificate authorities continued to issue certificates to servers with weak keys long after the vulnerability was disclosed.
Scott Yilek, Eric Rescorla, Hovav Shacham, Brandon Enright, Stefan Savage
Internet Measurement Conference1
2008 The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
Daniele Micciancio, Scott Yilek
TCC2
2007 The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
Thomas Ristenpart, Scott Yilek
EUROCRYPT2