Nadia Heninger

According to our database1, Nadia Heninger authored at least 55 papers between 2006 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Pseudorandom Black Swans: Cache Attacks on CTR_DRBG.
IACR Cryptology ePrint Archive, 2019

Biased Nonce Sense: Lattice Attacks against Weak ECDSA Signatures in Cryptocurrencies.
IACR Cryptology ePrint Archive, 2019

Imperfect forward secrecy: how Diffie-Hellman fails in practice.
Commun. ACM, 2019

2018
CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018

In search of CurveSwap: Measuring elliptic curve implementations in the wild.
IACR Cryptology ePrint Archive, 2018

Characterizing overstretched NTRU attacks.
IACR Cryptology ePrint Archive, 2018

The Proof is in the Pudding: Proofs of Work for Solving Discrete Logarithms.
IACR Cryptology ePrint Archive, 2018

Properties of Constacyclic Codes Under the Schur Product.
CoRR, 2018

Where did I leave my keys?: lessons from the Juniper Dual EC incident.
Commun. ACM, 2018

In Search of CurveSwap: Measuring Elliptic Curve Implementations in the Wild.
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

Practical State Recovery Attacks against Legacy RNG Implementations.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
CacheBleed: a timing attack on OpenSSL constant-time RSA.
J. Cryptographic Engineering, 2017

Post-quantum RSA.
IACR Cryptology ePrint Archive, 2017

Sliding right into disaster: Left-to-right sliding windows leak.
IACR Cryptology ePrint Archive, 2017

Post-quantum RSA.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

Measuring small subgroup attacks against Diffie-Hellman.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

A Kilobit Hidden SNFS Discrete Logarithm Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Sliding Right into Disaster: Left-to-Right Sliding Windows Leak.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2017, 2017

2016
CacheBleed: A Timing Attack on OpenSSL Constant Time RSA.
IACR Cryptology ePrint Archive, 2016

Measuring small subgroup attacks against Diffie-Hellman.
IACR Cryptology ePrint Archive, 2016

A kilobit hidden SNFS discrete logarithm computation.
IACR Cryptology ePrint Archive, 2016

Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials.
IACR Cryptology ePrint Archive, 2016

A Systematic Analysis of the Juniper Dual EC Incident.
IACR Cryptology ePrint Archive, 2016

A kilobit hidden SNFS discrete logarithm computation.
CoRR, 2016

Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials.
CoRR, 2016


Weak Keys Remain Widespread in Network Devices.
Proceedings of the 2016 ACM on Internet Measurement Conference, 2016

Factoring as a Service.
Proceedings of the Financial Cryptography and Data Security, 2016

CacheBleed: A Timing Attack on OpenSSL Constant Time RSA.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2016, 2016

A Systematic Analysis of the Juniper Dual EC Incident.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith's Method for Univariate Polynomials.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Factoring as a Service.
IACR Cryptology ePrint Archive, 2015

Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding.
Adv. in Math. of Comm., 2015

Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Elliptic Curve Cryptography in Practice.
Proceedings of the Financial Cryptography and Data Security, 2014

2013
Elliptic Curve Cryptography in Practice.
IACR Cryptology ePrint Archive, 2013

Factoring RSA keys from certified smart cards: Coppersmith in the wild.
IACR Cryptology ePrint Archive, 2013

Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Optimally Robust Private Information Retrieval.
IACR Cryptology ePrint Archive, 2012

Torchestra: reducing interactive traffic delays over tor.
Proceedings of the 11th annual ACM Workshop on Privacy in the Electronic Society, 2012

Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices.
Proceedings of the 21th USENIX Security Symposium, Bellevue, WA, USA, August 8-10, 2012, 2012

Optimally Robust Private Information Retrieval.
Proceedings of the 21th USENIX Security Symposium, Bellevue, WA, USA, August 8-10, 2012, 2012

2011
Cold-Boot Attacks.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Approximate common divisors via lattices.
IACR Cryptology ePrint Archive, 2011

Approximate common divisors via lattices
CoRR, 2011

Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding.
Proceedings of the Innovations in Computer Science, 2011

2010
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
CoRR, 2010

Computational Complexity and Information Asymmetry in Election Audits with Low-Entropy Randomness.
Proceedings of the 2010 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2010

Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs.
Proceedings of the Network and Distributed System Security Symposium, 2010

2009
Lest we remember: cold-boot attacks on encryption keys.
Commun. ACM, 2009

Fingerprinting Blank Paper Using Commodity Scanners.
Proceedings of the 30th IEEE Symposium on Security and Privacy (S&P 2009), 2009

Reconstructing RSA Private Keys from Random Key Bits.
Proceedings of the Advances in Cryptology, 2009

2008
Reconstructing RSA Private Keys from Random Key Bits.
IACR Cryptology ePrint Archive, 2008

Lest We Remember: Cold Boot Attacks on Encryption Keys.
Proceedings of the 17th USENIX Security Symposium, 2008

2006
On the integrality of nth roots of generating functions.
J. Comb. Theory, Ser. A, 2006


  Loading...