Nadia Heninger
Orcid: 0000-0002-7904-7295Affiliations:
- University of Pennsylvania, Philadelphia, PA, USA
- University of California, San Diego, USA
According to our database1,
Nadia Heninger
authored at least 55 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
IACR Cryptol. ePrint Arch., 2024
IACR Commun. Cryptol., 2024
Proceedings of the 33rd USENIX Security Symposium, 2024
2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Abuse-Resistant Location Tracking: Balancing Privacy and Safety in the Offline Finding Ecosystem.
IACR Cryptol. ePrint Arch., 2023
The Hidden Number Problem with Small Unknown Multipliers: Cryptanalyzing MEGA in Six Queries and Other Applications.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023
2022
IEEE Secur. Priv., 2022
Proceedings of the 31st USENIX Security Symposium, 2022
2020
IACR Cryptol. ePrint Arch., 2020
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment.
IACR Cryptol. ePrint Arch., 2020
On Bounded Distance Decoding with Predicate: Breaking the "Lattice Barrier" for the Hidden Number Problem.
IACR Cryptol. ePrint Arch., 2020
CopyCat: Controlled Instruction-Level Attacks on Enclaves for Maximal Key Extraction.
CoRR, 2020
Proceedings of the 29th USENIX Security Symposium, 2020
Proceedings of the 29th USENIX Security Symposium, 2020
2019
IACR Cryptol. ePrint Arch., 2019
Biased Nonce Sense: Lattice Attacks against Weak ECDSA Signatures in Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2019
Short Paper: The Proof is in the Pudding - Proofs of Work for Solving Discrete Logarithms.
Proceedings of the Financial Cryptography and Data Security, 2019
2018
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
Commun. ACM, 2018
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018
2017
IACR Cryptol. ePrint Arch., 2017
2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Cryptographic applications of capacity theory: On the optimality of Coppersmith's method for univariate polynomials.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Proceedings of the 25th USENIX Security Symposium, 2016
Proceedings of the 2016 ACM on Internet Measurement Conference, 2016
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016
2015
Adv. Math. Commun., 2015
2013
IACR Cryptol. ePrint Arch., 2013
2012
Proceedings of the 11th annual ACM Workshop on Privacy in the Electronic Society, 2012
Proceedings of the 21th USENIX Security Symposium, Bellevue, WA, USA, August 8-10, 2012, 2012
2011
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011
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
Proceedings of the Network and Distributed System Security Symposium, 2010
2009
Proceedings of the 30th IEEE Symposium on Security and Privacy (SP 2009), 2009
2008
IACR Cryptol. ePrint Arch., 2008
2006
J. Comb. Theory A, 2006