default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNadia Heninger
Person information
- affiliation: University of Pennsylvania, Philadelphia, PA, USA
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Gabrielle De Micheli
, Nadia Heninger:
Survey: Recovering cryptographic keys from partial information, by example. IACR Commun. Cryptol. 1(1): 28 (2024)- [c39]Hannah Davis, Matthew D. Green, Nadia Heninger, Keegan Ryan, Adam Suhl:
On the Possibility of a Backdoor in the Micali-Schnorr Generator. Public Key Cryptography (1) 2024: 352-386 - [c38]Harry Eldridge, Gabrielle Beck, Matthew Green, Nadia Heninger, Abhishek Jain:
Abuse-Resistant Location Tracking: Balancing Privacy and Safety in the Offline Finding Ecosystem. USENIX Security Symposium 2024 - [c37]Sharon Goldberg, Miro Haller, Nadia Heninger, Mike Milano, Dan Shumow, Marc Stevens, Adam Suhl:
RADIUS/UDP Considered Harmful. USENIX Security Symposium 2024 - [i37]Christopher Battarbee, Giacomo Borin, Ryann Cartor, Nadia Heninger, David Jao, Laura Maddison, Edoardo Persichetti, Angela Robinson, Daniel Smith-Tone, Rainer Steinwandt:
On the Semidirect Discrete Logarithm Problem in Finite Groups. IACR Cryptol. ePrint Arch. 2024: 905 (2024) - 2023
- [c36]Dylan Rowe, Joachim Breitner, Nadia Heninger:
The Curious Case of the Half-Half Bitcoin ECDSA Nonces. AFRICACRYPT 2023: 273-284 - [c35]Keegan Ryan, Kaiwen He, George Arnold Sullivan, Nadia Heninger:
Passive SSH Key Compromise via Lattices. CCS 2023: 2886-2900 - [c34]Keegan Ryan, Nadia Heninger:
Fast Practical Lattice Reduction Through Iterated Compression. CRYPTO (3) 2023: 3-36 - [c33]Nadia Heninger, Keegan Ryan:
The Hidden Number Problem with Small Unknown Multipliers: Cryptanalyzing MEGA in Six Queries and Other Applications. Public Key Cryptography (1) 2023: 147-176 - [i36]Keegan Ryan, Nadia Heninger:
Fast Practical Lattice Reduction through Iterated Compression. IACR Cryptol. ePrint Arch. 2023: 237 (2023) - [i35]Hannah Davis, Matthew Green, Nadia Heninger, Keegan Ryan, Adam Suhl:
On the Possibility of a Backdoor in the Micali-Schnorr Generator. IACR Cryptol. ePrint Arch. 2023: 440 (2023) - [i34]Dylan Rowe, Joachim Breitner, Nadia Heninger:
The curious case of the half-half Bitcoin ECDSA nonces. IACR Cryptol. ePrint Arch. 2023: 841 (2023) - [i33]Gabrielle Beck, Harry Eldridge, Matthew Green, Nadia Heninger, Abhishek Jain:
Abuse-Resistant Location Tracking: Balancing Privacy and Safety in the Offline Finding Ecosystem. IACR Cryptol. ePrint Arch. 2023: 1332 (2023) - [i32]Keegan Ryan, Kaiwen He, George Arnold Sullivan, Nadia Heninger:
Passive SSH Key Compromise via Lattices. IACR Cryptol. ePrint Arch. 2023: 1711 (2023) - 2022
- [j10]Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. IEEE Secur. Priv. 20(2): 80-86 (2022) - [c32]George Arnold Sullivan, Jackson Sippe, Nadia Heninger, Eric Wustrow:
Open to a fault: On the passive compromise of TLS keys via transient errors. USENIX Security Symposium 2022: 233-250 - [i31]Nadia Heninger:
RSA, DH, and DSA in the Wild. IACR Cryptol. ePrint Arch. 2022: 48 (2022) - [i30]Keegan Ryan, Nadia Heninger:
Cryptanalyzing MEGA in Six Queries. IACR Cryptol. ePrint Arch. 2022: 914 (2022) - 2021
- [c31]Martin R. Albrecht, Nadia Heninger:
On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem. EUROCRYPT (1) 2021: 528-558 - 2020
- [j9]Brett Hemenway Falk, Nadia Heninger, Michael Rudow:
Properties of constacyclic codes under the Schur product. Des. Codes Cryptogr. 88(6): 993-1021 (2020) - [j8]Gabrielle De Micheli, Nadia Heninger, Barak Shani:
Characterizing overstretched NTRU attacks. J. Math. Cryptol. 14(1): 110-119 (2020) - [c30]Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) 2020: 62-91 - [c29]Shaanan Cohney, Andrew Kwong, Shahar Paz, Daniel Genkin, Nadia Heninger, Eyal Ronen, Yuval Yarom:
Pseudorandom Black Swans: Cache Attacks on CTR_DRBG. SP 2020: 1241-1258 - [c28]Daniel Moghimi, Jo Van Bulck, Nadia Heninger, Frank Piessens, Berk Sunar:
CopyCat: Controlled Instruction-Level Attacks on Enclaves. USENIX Security Symposium 2020: 469-486 - [c27]Daniel Moghimi, Berk Sunar, Thomas Eisenbarth, Nadia Heninger:
TPM-FAIL: TPM meets Timing and Lattice Attacks. USENIX Security Symposium 2020: 2057-2073 - [e2]Joseph Bonneau, Nadia Heninger:
Financial Cryptography and Data Security - 24th International Conference, FC 2020, Kota Kinabalu, Malaysia, February 10-14, 2020 Revised Selected Papers. Lecture Notes in Computer Science 12059, Springer 2020, ISBN 978-3-030-51279-8 [contents] - [i29]Daniel Moghimi, Jo Van Bulck, Nadia Heninger, Frank Piessens, Berk Sunar:
CopyCat: Controlled Instruction-Level Attacks on Enclaves for Maximal Key Extraction. CoRR abs/2002.08437 (2020) - [i28]Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. CoRR abs/2006.06197 (2020) - [i27]Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. IACR Cryptol. ePrint Arch. 2020: 697 (2020) - [i26]Gabrielle De Micheli, Nadia Heninger:
Recovering cryptographic keys from partial information, by example. IACR Cryptol. ePrint Arch. 2020: 1506 (2020) - [i25]Martin R. Albrecht, Nadia Heninger:
On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem. IACR Cryptol. ePrint Arch. 2020: 1540 (2020)
2010 – 2019
- 2019
- [j7]David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thomé, Luke Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella Béguelin, Paul Zimmermann:
Imperfect forward secrecy: how Diffie-Hellman fails in practice. Commun. ACM 62(1): 106-114 (2019) - [c26]Joachim Breitner, Nadia Heninger:
Biased Nonce Sense: Lattice Attacks Against Weak ECDSA Signatures in Cryptocurrencies. Financial Cryptography 2019: 3-20 - [c25]Marcella Hastings, Nadia Heninger, Eric Wustrow:
Short Paper: The Proof is in the Pudding - Proofs of Work for Solving Discrete Logarithms. Financial Cryptography 2019: 396-404 - [e1]Nadia Heninger, Patrick Traynor:
28th USENIX Security Symposium, USENIX Security 2019, Santa Clara, CA, USA, August 14-16, 2019. USENIX Association 2019 [contents] - [i24]Daniel Moghimi, Berk Sunar, Thomas Eisenbarth, Nadia Heninger:
TPM-FAIL: TPM meets Timing and Lattice Attacks. CoRR abs/1911.05673 (2019) - [i23]Joachim Breitner, Nadia Heninger:
Biased Nonce Sense: Lattice Attacks against Weak ECDSA Signatures in Cryptocurrencies. IACR Cryptol. ePrint Arch. 2019: 23 (2019) - [i22]Shaanan Cohney, Andrew Kwong, Shahar Paz, Daniel Genkin, Nadia Heninger, Eyal Ronen, Yuval Yarom:
Pseudorandom Black Swans: Cache Attacks on CTR_DRBG. IACR Cryptol. ePrint Arch. 2019: 996 (2019) - 2018
- [j6]Stephen Checkoway, Jacob Maskiewicz, Christina Garman, Joshua Fried, Shaanan Cohney, Matthew Green, Nadia Heninger, Ralf-Philipp Weinmann, Eric Rescorla, Hovav Shacham:
Where did I leave my keys?: lessons from the Juniper Dual EC incident. Commun. ACM 61(11): 148-155 (2018) - [j5]Fergus Dall, Gabrielle De Micheli, Thomas Eisenbarth, Daniel Genkin, Nadia Heninger, Ahmad Moghimi, Yuval Yarom:
CacheQuote: Efficiently Recovering Long-term Secrets of SGX EPID via Cache Attacks. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(2): 171-191 (2018) - [c24]Shaanan N. Cohney, Matthew D. Green, Nadia Heninger:
Practical State Recovery Attacks against Legacy RNG Implementations. CCS 2018: 265-280 - [c23]Luke Valenta, Nick Sullivan, Antonio Sanso, Nadia Heninger:
In Search of CurveSwap: Measuring Elliptic Curve Implementations in the Wild. EuroS&P 2018: 384-398 - [i21]Brett Hemenway Falk, Nadia Heninger, Michael Rudow:
Properties of Constacyclic Codes Under the Schur Product. CoRR abs/1810.07630 (2018) - [i20]Luke Valenta, Nick Sullivan, Antonio Sanso, Nadia Heninger:
In search of CurveSwap: Measuring elliptic curve implementations in the wild. IACR Cryptol. ePrint Arch. 2018: 298 (2018) - [i19]Gabrielle De Micheli, Nadia Heninger, Barak Shani:
Characterizing overstretched NTRU attacks. IACR Cryptol. ePrint Arch. 2018: 630 (2018) - [i18]Marcella Hastings, Nadia Heninger, Eric Wustrow:
The Proof is in the Pudding: Proofs of Work for Solving Discrete Logarithms. IACR Cryptol. ePrint Arch. 2018: 939 (2018) - 2017
- [j4]Yuval Yarom, Daniel Genkin, Nadia Heninger:
CacheBleed: a timing attack on OpenSSL constant-time RSA. J. Cryptogr. Eng. 7(2): 99-112 (2017) - [c22]Daniel J. Bernstein, Joachim Breitner, Daniel Genkin, Leon Groot Bruinderink, Nadia Heninger, Tanja Lange, Christine van Vredendaal, Yuval Yarom:
Sliding Right into Disaster: Left-to-Right Sliding Windows Leak. CHES 2017: 555-576 - [c21]Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé:
A Kilobit Hidden SNFS Discrete Logarithm Computation. EUROCRYPT (1) 2017: 202-231 - [c20]Luke Valenta, David Adrian, Antonio Sanso, Shaanan Cohney, Joshua Fried, Marcella Hastings, J. Alex Halderman, Nadia Heninger:
Measuring small subgroup attacks against Diffie-Hellman. NDSS 2017 - [c19]Daniel J. Bernstein, Nadia Heninger, Paul Lou, Luke Valenta:
Post-quantum RSA. PQCrypto 2017: 311-329 - [i17]Daniel J. Bernstein, Nadia Heninger, Paul Lou, Luke Valenta:
Post-quantum RSA. IACR Cryptol. ePrint Arch. 2017: 351 (2017) - [i16]Daniel J. Bernstein, Joachim Breitner, Daniel Genkin, Leon Groot Bruinderink, Nadia Heninger, Tanja Lange, Christine van Vredendaal, Yuval Yarom:
Sliding right into disaster: Left-to-right sliding windows leak. IACR Cryptol. ePrint Arch. 2017: 627 (2017) - 2016
- [c18]Ted Chinburg, Brett Hemenway, Nadia Heninger, Zachary Scherr:
Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith's Method for Univariate Polynomials. ASIACRYPT (1) 2016: 759-788 - [c17]Stephen Checkoway, Jacob Maskiewicz, Christina Garman, Joshua Fried, Shaanan Cohney, Matthew Green, Nadia Heninger, Ralf-Philipp Weinmann, Eric Rescorla, Hovav Shacham:
A Systematic Analysis of the Juniper Dual EC Incident. CCS 2016: 468-479 - [c16]Yuval Yarom, Daniel Genkin, Nadia Heninger:
CacheBleed: A Timing Attack on OpenSSL Constant Time RSA. CHES 2016: 346-367 - [c15]Luke Valenta, Shaanan Cohney, Alex Liao, Joshua Fried, Satya Bodduluri, Nadia Heninger:
Factoring as a Service. Financial Cryptography 2016: 321-338 - [c14]Marcella Hastings, Joshua Fried, Nadia Heninger:
Weak Keys Remain Widespread in Network Devices. Internet Measurement Conference 2016: 49-63 - [c13]Nimrod Aviram, Sebastian Schinzel, Juraj Somorovsky, Nadia Heninger, Maik Dankel, Jens Steube, Luke Valenta, David Adrian, J. Alex Halderman, Viktor Dukhovni, Emilia Käsper, Shaanan Cohney, Susanne Engels, Christof Paar, Yuval Shavitt:
DROWN: Breaking TLS Using SSLv2. USENIX Security Symposium 2016: 689-706 - [i15]Ted Chinburg, Brett Hemenway, Nadia Heninger, Zachary Scherr:
Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials. CoRR abs/1605.08065 (2016) - [i14]Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé:
A kilobit hidden SNFS discrete logarithm computation. CoRR abs/1610.02874 (2016) - [i13]Yuval Yarom, Daniel Genkin, Nadia Heninger:
CacheBleed: A Timing Attack on OpenSSL Constant Time RSA. IACR Cryptol. ePrint Arch. 2016: 224 (2016) - [i12]Stephen Checkoway, Shaanan Cohney, Christina Garman, Matthew Green, Nadia Heninger, Jacob Maskiewicz, Eric Rescorla, Hovav Shacham, Ralf-Philipp Weinmann:
A Systematic Analysis of the Juniper Dual EC Incident. IACR Cryptol. ePrint Arch. 2016: 376 (2016) - [i11]Ted Chinburg, Brett Hemenway, Nadia Heninger, Zachary Scherr:
Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials. IACR Cryptol. ePrint Arch. 2016: 869 (2016) - [i10]Joshua Fried, Pierrick Gaudry, Nadia Heninger, Emmanuel Thomé:
A kilobit hidden SNFS discrete logarithm computation. IACR Cryptol. ePrint Arch. 2016: 961 (2016) - [i9]Luke Valenta, David Adrian, Antonio Sanso, Shaanan Cohney, Joshua Fried, Marcella Hastings, J. Alex Halderman, Nadia Heninger:
Measuring small subgroup attacks against Diffie-Hellman. IACR Cryptol. ePrint Arch. 2016: 995 (2016) - 2015
- [j3]Henry Cohn, Nadia Heninger:
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. Adv. Math. Commun. 9(3): 311-339 (2015) - [c12]David Adrian, Karthikeyan Bhargavan, Zakir Durumeric, Pierrick Gaudry, Matthew Green, J. Alex Halderman, Nadia Heninger, Drew Springall, Emmanuel Thomé, Luke Valenta, Benjamin VanderSloot, Eric Wustrow, Santiago Zanella Béguelin, Paul Zimmermann:
Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice. CCS 2015: 5-17 - [i8]Luke Valenta, Shaanan Cohney, Alex Liao, Joshua Fried, Satya Bodduluri, Nadia Heninger:
Factoring as a Service. IACR Cryptol. ePrint Arch. 2015: 1000 (2015) - 2014
- [c11]Joppe W. Bos, J. Alex Halderman, Nadia Heninger, Jonathan Moore, Michael Naehrig, Eric Wustrow:
Elliptic Curve Cryptography in Practice. Financial Cryptography 2014: 157-175 - 2013
- [c10]Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, Nicko van Someren:
Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild. ASIACRYPT (2) 2013: 341-360 - [i7]Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, Nicko van Someren:
Factoring RSA keys from certified smart cards: Coppersmith in the wild. IACR Cryptol. ePrint Arch. 2013: 599 (2013) - [i6]Joppe W. Bos, J. Alex Halderman, Nadia Heninger, Jonathan Moore, Michael Naehrig, Eric Wustrow:
Elliptic Curve Cryptography in Practice. IACR Cryptol. ePrint Arch. 2013: 734 (2013) - 2012
- [c9]Nadia Heninger, Zakir Durumeric, Eric Wustrow, J. Alex Halderman:
Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices. USENIX Security Symposium 2012: 205-220 - [c8]Casey Devet, Ian Goldberg, Nadia Heninger:
Optimally Robust Private Information Retrieval. USENIX Security Symposium 2012: 269-283 - [c7]Deepika Gopal, Nadia Heninger:
Torchestra: reducing interactive traffic delays over tor. WPES 2012: 31-42 - [i5]Casey Devet, Ian Goldberg, Nadia Heninger:
Optimally Robust Private Information Retrieval. IACR Cryptol. ePrint Arch. 2012: 83 (2012) - 2011
- [c6]Henry Cohn, Nadia Heninger:
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. ICS 2011: 298-308 - [r1]Nadia Heninger:
Cold-Boot Attacks. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 216-217 - [i4]Henry Cohn, Nadia Heninger:
Approximate common divisors via lattices. CoRR abs/1108.2714 (2011) - [i3]Henry Cohn, Nadia Heninger:
Approximate common divisors via lattices. IACR Cryptol. ePrint Arch. 2011: 437 (2011) - 2010
- [c5]Scott Wolchok, Owen S. Hofmann, Nadia Heninger, Edward W. Felten, J. Alex Halderman, Christopher J. Rossbach, Brent Waters, Emmett Witchel:
Defeating Vanish with Low-Cost Sybil Attacks Against Large DHTs. NDSS 2010 - [c4]Nadia Heninger:
Computational Complexity and Information Asymmetry in Election Audits with Low-Entropy Randomness. EVT/WOTE 2010 - [i2]Henry Cohn, Nadia Heninger:
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. CoRR abs/1008.1284 (2010)
2000 – 2009
- 2009
- [j2]J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, Edward W. Felten:
Lest we remember: cold-boot attacks on encryption keys. Commun. ACM 52(5): 91-98 (2009) - [c3]Nadia Heninger, Hovav Shacham:
Reconstructing RSA Private Keys from Random Key Bits. CRYPTO 2009: 1-17 - [c2]William Clarkson, Tim Weyrich, Adam Finkelstein, Nadia Heninger, J. Alex Halderman, Edward W. Felten:
Fingerprinting Blank Paper Using Commodity Scanners. SP 2009: 301-314 - 2008
- [c1]J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, Edward W. Felten:
Lest We Remember: Cold Boot Attacks on Encryption Keys. USENIX Security Symposium 2008: 45-60 - [i1]Nadia Heninger, Hovav Shacham:
Reconstructing RSA Private Keys from Random Key Bits. IACR Cryptol. ePrint Arch. 2008: 510 (2008) - 2006
- [j1]Nadia Heninger, Eric M. Rains, Neil J. A. Sloane:
On the integrality of nth roots of generating functions. J. Comb. Theory A 113(8): 1732-1745 (2006)
Coauthor Index
Shaanan Cohney
aka: Shaanan N. Cohney
aka: Shaanan N. Cohney
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-10-07 22:11 CEST 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:
