Scott Yilek

According to our database1, Scott Yilek authored at least 19 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Targeted Invertible Pseudorandom Functions and Deterministic Format-Transforming Encryption.
Proceedings of the Topics in Cryptology - CT-RSA 2023, 2023

2022
Interactive History Sniffing with Dynamically-Generated QR Codes and CSS Difference Blending.
Proceedings of the 43rd IEEE Security and Privacy, 2022

New Algorithms and Analyses for Sum-Preserving Encryption.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2018
Targeted Ciphers for Format-Preserving Encryption.
Proceedings of the Selected Areas in Cryptography - SAC 2018, 2018

2017
Cycle Slicer: An Algorithm for Building Permutations on Special Domains.
IACR Cryptol. ePrint Arch., 2017

2016
Reverse Cycle Walking and Its Applications.
IACR Cryptol. ePrint Arch., 2016

2013
The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Hedged Public-key Encryption: How to Protect against Bad Randomness.
IACR Cryptol. ePrint Arch., 2012

2011
Standard Security Does Not Imply Security Against Selective-Opening.
IACR Cryptol. ePrint Arch., 2011

2010
Identity-Based Encryption Secure against Selective Opening Attack.
IACR Cryptol. ePrint Arch., 2010

When Good Randomness Goes Bad: Virtual Machine Reset Vulnerabilities and Hedging Deployed Cryptography.
Proceedings of the Network and Distributed System Security Symposium, 2010

2009
Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine.
IACR Cryptol. ePrint Arch., 2009

Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions.
IACR Cryptol. ePrint Arch., 2009

Encryption Schemes Secure under Selective Opening Attack.
IACR Cryptol. ePrint Arch., 2009

When private keys are public: results from the 2008 Debian OpenSSL vulnerability.
Proceedings of the 9th ACM SIGCOMM Internet Measurement Conference, IMC 2009, Chicago, 2009

Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening.
Proceedings of the Advances in Cryptology, 2009

2008
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007
The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks.
IACR Cryptol. ePrint Arch., 2007

Recommenders everywhere: : the WikiLens community-maintained recommender system.
Proceedings of the 2007 International Symposium on Wikis, 2007


  Loading...