Fetching the paper…
Reading the bibliography…
Insightful interdisciplinary collaboration is essential to the principled governance of technology.
The Russell-Einstein Manifesto
Bertrand Russell and Albert Einstein. 1955 · 1955
Earlier work this paper cites.
The Two Cultures
C.P. Snow. 1959 · 1959
Earlier work this paper cites.
New Directions in Cryptography
Whitfield Diffie and Martin Hellman. 1976 · 1976
Earlier work this paper cites.
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
Ronald L. Rivest, Adi Shamir, and Leonard Adleman. 1978 · 1978
Earlier work this paper cites.
Robustness in the Strategy of Scientific Model Building
George E.P. Box. 1979 · 1979
Earlier work this paper cites.
On the Security of Public Key Protocols
Danny Dolev and Andrew Yao. 1983 · 1983
Earlier work this paper cites.
Probabilistic Encryption
Shafi Goldwasser and Silvio Micali. 1984 · 1984
Earlier work this paper cites.
Security Without Identification: Transaction Systems to Make Big Brother Obsolete
David Chaum. 1985 · 1985
Earlier work this paper cites.
The Limits of Correctness
Brian Cantwell Smith. 1985 · 1985
Earlier work this paper cites.
How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Conference on the Theory and Application of Cryptographic Techniques . Springer, 186–194
Amos Fiat and Adi Shamir. 1986 · 1986
Earlier work this paper cites.
Barriers against Interdisciplinarity: Implications for Studies of Science, Technology, and Society (STS)
Henry H. Bauer. 1990 · 1990
Earlier work this paper cites.
Can Neural Networks Do Better Than the Vapnik-Chervonenkis Bounds?
David Cohn and Gerald Tesauro. 1990 · 1990
Earlier work this paper cites.
Role of Nodels in Statistical Analysis
David R. Cox. 1990 · 1990
Earlier work this paper cites.
How Tight are the Vapnik-Chervonenkis Bounds?
David Cohn and Gerald Tesauro. 1992 · 1992
Earlier work this paper cites.
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS ’93) . 62–73
Mihir Bellare and Phillip Rogaway. 1993 · 1993
Earlier work this paper cites.
Multi-Culturalism Redux: Science, Law, and Politics
Peter H Schuck. 1993 · 1993
Earlier work this paper cites.
A Personal View of Average-Case Complexity. In Proceedings of the Tenth Annual IEEE Conference on Structure in Complexity Theory . IEEE, 134–147
Russell Impagliazzo. 1995 · 1995
Earlier work this paper cites.
Accountability in a Computerized Society
Helen Nissenbaum. 1996 · 1996
Earlier work this paper cites.
13 U.S.C. § 9
1997 · 1997
Earlier work this paper cites.
The Decision Diffie-Hellman Problem. In International Algorithmic Number Theory Symposium . Springer, 48–63
Dan Boneh. 1998 · 1998
Earlier work this paper cites.
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In International Cryptology Conference . Springer, 13–25
Ronald Cramer and Victor Shoup. 1998 · 1998
Earlier work this paper cites.
Code: and Other Laws of Cyberspace
Lawrence Lessig. 1999 · 1999
Earlier work this paper cites.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Peter W. Shor. 1999 · 1999
Earlier work this paper cites.
On the Complexity of k-SAT
Russell Impagliazzo and Ramamohan Paturi. 2001 · 2001
Earlier work this paper cites.
On the Power of Unique 2-Prover 1-Round Games. In ACM Symposium on Theory of Computing (STOC 02’) . 767–775
Subhash Khot. 2002 · 2002
Earlier work this paper cites.
Revealing Information while Preserving Privacy. In Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems . 202–210
Irit Dinur and Kobbi Nissim. 2003 · 2003
Earlier work this paper cites.
On the (In)security of the Fiat-Shamir Paradigm. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS ’03) . IEEE, 102–113
Shafi Goldwasser and Yael Tauman Kalai. 2003 · 2003
Earlier work this paper cites.
On Cryptographic Assumptions and Challenges. In Annual International Cryptology Conference . Springer, 96–109
Moni Naor. 2003 · 2003
Earlier work this paper cites.
Convex Optimization
Stephen P. Boyd and Lieven Vandenberghe. 2004 · 2004
Earlier work this paper cites.
The Random Oracle Methodology, Revisited
Ran Canetti, Oded Goldreich, and Shai Halevi. 2004 · 2004
Earlier work this paper cites.
Privacy and Rationality in Individual Decision Making
Alessandro Acquisti and Jens Grossklags. 2005 · 2005
Earlier work this paper cites.
Calibrating Noise to Sensitivity in Private Data Analysis. In Theory of Cryptography Conference . Springer, 265–284
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006 · 2006
Earlier work this paper cites.
On Post-Modern Cryptography
Oded Goldreich. 2006 · 2006
Earlier work this paper cites.
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. In Annual International Cryptology Conference . Springer, 466–481
Daniel R.L. Brown and Kristian Gjøsteen. 2007 · 2007
Earlier work this paper cites.
The Export of Cryptography in the 20th Century and the 21st
Whitfield Diffie and Susan Landau. 2007 · 2007
Earlier work this paper cites.
Another Look at "Provable Security"
Neal Koblitz and Alfred J. Menezes. 2007 · 2007
Earlier work this paper cites.
The Cost of Privacy: Destruction of Data-Mining Utility in Anonymized Data Publishing. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . 70–78
Justin Brickell and Vitaly Shmatikov. 2008 · 2008
Earlier work this paper cites.
Differential Privacy: A Survey of Results. In International Conference on Theory and Applications of Models of Computation . Springer, 1–19
Cynthia Dwork. 2008 · 2008
Earlier work this paper cites.
Robust de-Anonymization of Large Sparse Datasets. In 2008 IEEE Symposium on Security and Privacy (IEEE S&P ’08) . IEEE, 111–125
Arvind Narayanan and Vitaly Shmatikov. 2008 · 2008
Earlier work this paper cites.
Information Accountability
Daniel J. Weitzner, Harold Abelson, Tim Berners-Lee, Joan Feigenbaum, James Hendler, and Gerald Jay Sussman. 2008 · 2008
Earlier work this paper cites.
The Differential Privacy Frontier. In Theory of Cryptography Conference . Springer, 496–502
Cynthia Dwork. 2009 · 2009
Earlier work this paper cites.
Foundations of Cryptography: Volume 2, Basic Applications
Oded Goldreich. 2009 · 2009
Earlier work this paper cites.
Lest We Remember: Cold-Boot Attacks on Encryption Keys
J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, and Edward W. Felten. 2009 · 2009
Earlier work this paper cites.
Broken Promises of Privacy: Responding to the Surprising Failure of Anonymization
Paul Ohm. 2009 · 2009
Earlier work this paper cites.
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
Oded Regev. 2009 · 2009
Earlier work this paper cites.
Differential Privacy for Statistics: What We Know and What We Want to Learn
Cynthia Dwork and Adam Smith. 2010 · 2010
Earlier work this paper cites.
A Statistical Framework for Differential Privacy
Larry Wasserman and Shuheng Zhou. 2010 · 2010
Earlier work this paper cites.
What Can We Learn Privately?
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith. 2011 · 2011
Earlier work this paper cites.
How Much is Enough? Choosing ε \varepsilon for Differential Privacy. In International Conference on Information Security . Springer, 325–340
Jaewoo Lee and Chris Clifton. 2011 · 2011
Earlier work this paper cites.
Third-Round Report of the SHA-3 Cryptographic Hash Algorithm Competition
Shu-jen Chang, Ray Perlner, William E. Burr, Meltem Sönmez Turan, John M. Kelsey, Souradyuti Paul, and Lawrence E. Bassham. 2012 · 2012
Cited alongside, same era.
Fairness through Awareness. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference . 214–226
Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold, and Richard Zemel. 2012 · 2012
Cited alongside, same era.
Mining your Ps and Qs: Detection of Widespread Weak Keys in Network Devices. In 21st USENIX Security Symposium (USENIX Security ’12) . 205–220
Nadia Heninger, Zakir Durumeric, Eric Wustrow, and J. Alex Halderman. 2012 · 2012
Cited alongside, same era.
Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild. In International Conference on the Theory and Application of Cryptology and Information Security . Springer, 341–360
Daniel J. Bernstein, Yun-An Chang, Chen-Mou Cheng, Li-Ping Chou, Nadia Heninger, Tanja Lange, and Nicko Van Someren. 2013 · 2013
Cited alongside, same era.
The Many Flaws of Dual_EC_DRBG
Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms . SIAM, 2468–2479
Úlfar Erlingsson, Vitaly Feldman, Ilya Mironov, Ananth Raghunathan, Kunal Talwar, and Abhradeep Thakurta. 2019 · 2019
Later among the works it cites.
Hyperparameter Optimization
Matthias Feurer and Frank Hutter. 2019 · 2019
Later among the works it cites.
Choosing Epsilon for Privacy as a Service
Sara Krehbiel. 2019 · 2019
Later among the works it cites.
Peeter Laud and Alisa Pankova. 2019 · 2019
Later among the works it cites.
Investigating Statistical Privacy Frameworks from the Perspective of Hypothesis Testing
Changchang Liu, Xi He, Thee Chanyaswad, Shiqiang Wang, and Prateek Mittal. 2019 · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Matthew Green. September 8th, 2013 · 2013
Cited alongside, same era.
The Algorithmic Foundations of Differential Privacy
Cynthia Dwork and Aaron Roth. 2014 · 2014
Cited alongside, same era.
Explaining and Harnessing Adversarial Examples
Ian J. Goodfellow, Jonathon Shlens, and Christian Szegedy. 2014 · 2014
Cited alongside, same era.
Differential Privacy: An Economic Method for Choosing Epsilon. In 2014 IEEE 27th Computer Security Foundations Symposium . IEEE, 398–410
Justin Hsu, Marco Gaboardi, Andreas Haeberlen, Sanjeev Khanna, Arjun Narayan, Benjamin C. Pierce, and Aaron Roth. 2014 · 2014
Cited alongside, same era.
Introduction to Modern Cryptography
Jonathan Katz and Yehuda Lindell. 2014 · 2014
Cited alongside, same era.
Cache Missing for Fun and Profit
Colin Percival. 2005 · 2014
Cited alongside, same era.
Understanding Machine Learning: From Theory to Algorithms
Shai Shalev-Shwartz and Shai Ben-David. 2014 · 2014
Cited alongside, same era.
Keys under Doormats: Mandating Insecurity by Requiring Government Access to all Data and Communications
Harold Abelson, Ross Anderson, Steven M. Bellovin, Josh Benaloh, Matt Blaze, Whitfield Diffie, John Gilmore, Matthew Green, Susan Landau, Peter G. Neumann, et al · 2015
Cited alongside, same era.
Model Cards for Model Reporting. In Proceedings of the Conference on Fairness, Accountability, and Transparency . 220–229
Margaret Mitchell, Simone Wu, Andrew Zaldivar, Parker Barnes, Lucy Vasserman, Ben Hutchinson, Elena Spitzer, Inioluwa Deborah Raji, and Timnit Gebru. 2019 · 2019
Later among the works it cites.
This Thing Called Fairness: Disciplinary Confusion Realizing a Value in Technology
Deirdre K. Mulligan, Joshua A. Kroll, Nitin Kohli, and Richmond Y. Wong. 2019 · 2019
Later among the works it cites.
Together or Alone: The Price of Privacy in Collaborative Learning
Balázs Pejó, Qiang Tang, and Gergely Biczók. 2019 · 2019
Later among the works it cites.
Stop Explaining Black Box Machine Learning Models for High Stakes Decisions and Use Interpretable Models Instead
Cynthia Rudin. 2019 · 2019
Later among the works it cites.
Fairness and Abstraction in Sociotechnical Systems. In Proceedings of the Conference on Fairness, Accountability, and Transparency . 59–68
Andrew D. Selbst, danah boyd, Sorelle A. Friedler, Suresh Venkatasubramanian, and Janet Vertesi. 2019 · 2019
Later among the works it cites.
Assumptions Used in the Safety Assessment Process and the Effects of Multiple Alerts and Indications on Pilot Performance
R.L. Sumwalt, B. Landsberg, and J. Homendy. 2019 · 2019
Later among the works it cites.
Roles for Computing in Social Change. In Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency . 252–260
Rediet Abebe, Solon Barocas, Jon Kleinberg, Karen Levy, Manish Raghavan, and David G. Robinson. 2020 · 2020
Later among the works it cites.
Factorization of RSA-250
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevec, Nadia Heninger, Emmanuel Thomé, and Paul Zimmerman. 2020 · 2020
Later among the works it cites.
Disclosure Avoidance for the 2020 Census: An Introduction
U.S. Census Bureau. 2021b · 2020
Later among the works it cites.
Towards Formalizing the GDPR’s Notion of Singling Out
Aloni Cohen and Kobbi Nissim. 2020 · 2020
Later among the works it cites.
SoK: Differential Privacies
Damien Desfontaines and Balázs Pejó. 2020 · 2020
Later among the works it cites.
Models in Science
Roman Frigg and Stephan Hartmann. 2020 · 2020
Later among the works it cites.
Changes to the Census Could Make Small Towns Disappear
Gus Wezerek and David Van Riper. Feburary 6th, 2020 · 2020
Later among the works it cites.
A Hierarchy of Limitations in Machine Learning
Momin M. Malik. 2020 · 2020
Later among the works it cites.
How Differential Privacy Will Affect our Understanding of Health Disparities in the United States
Alexis R. Santos-Lozada, Jeffrey T. Howard, and Ashton M. Verdery. 2020 · 2020
Later among the works it cites.
Aiping Xiong, Tianhao Wang, Ninghui Li, and Somesh Jha. 2020 · 2020
Later among the works it cites.
Can Differential Privacy Save the Census?
Julia Angwin. 2021 · 2021
Later among the works it cites.
Verification Dilemmas, Law, and the Promise of Zero-Knowledge Proofs
Kenneth A. Bamberger, Ran Canetti, Shafi Goldwasser, Rebecca Wexler, and Evan Joseph Zimmerman. 2021 · 2021
Later among the works it cites.
Statistical Inference is Not a Privacy Violation
Mark Bun, Damien Desfontaines, Cynthia Dwork, Moni Naor, Kobbi Nissim, Aaron Roth, Adam Smith, Thomas Steinke, Jonathan Ullman, and Salil Vadhan. 2021 · 2021
Later among the works it cites.
Census Bureau Sets Key Parameters to Protect Privacy in 2020 Census Results
U.S. Census Bureau. 2021a · 2021
Later among the works it cites.
Hyperparameter Optimization is Deceiving Us, and How to Stop It
A. Feder Cooper, Yucheng Lu, Jessica Forde, and Christopher M. De Sa. 2021 · 2021
Later among the works it cites.
Datasheets for Datasets
Timnit Gebru, Jamie Morgenstern, Briana Vecchione, Jennifer Wortman Vaughan, Hanna Wallach, Hal Daumé Iii, and Kate Crawford. 2021 · 2021
Later among the works it cites.
Shots taken, shots returned regarding the Census’ motivation for using differential privacy (and btw, it’s not an algorithm)
Jessica Hullman. 2021 · 2021
Later among the works it cites.
The Impact of the US Census Disclosure Avoidance System on Redistricting and Voting Rights Analysis
Christopher T. Kenny, Shiro Kuriwaki, Cory McCartan, Evan Rosenman, Tyler Simko, and Kosuke Imai. 2021 · 2021
Later among the works it cites.
The Role of Chance in the Census Bureau Database Reconstruction Experiment
Steven Ruggles and David Van Riper. 2021 · 2021
Later among the works it cites.
Protecting Cryptography Against Compelled Self-Incrimination. In 30th USENIX Security Symposium (USENIX Security ’21) . 591–608
Sarah Scheffler and Mayank Varia. 2021 · 2021
Later among the works it cites.
SoK: Hate, Harassment, and the Changing Landscape of Online Abuse
Kurt Thomas, Devdatta Akhawe, Michael Bailey, Dan Boneh, Elie Bursztein, Sunny Consolvo, Nicola Dell, Zakir Durumeric, Patrick Gage Kelley, Deepak Kumar, et al · 2021
Later among the works it cites.
Status Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process
Gorjan Alagic, Daniel Apon, David Cooper, Quynh Dang, Thinh Dang, John Kelsey, Jacob Lichtinger, Carl Miller, Dustin Moody, Rene Peralta, Ray Perlner, Angela Robinson, and Daniel Smith-Tone. 2022 · 2022
Closest in time.
Breaking Rainbow Takes a Weekend on a Laptop. In International Cryptology Conference . Springer, 464–479
Ward Beullens. 2022 · 2022
Closest in time.
Balancing Data Privacy and Usability in the Federal Statistical System
V. Joseph Hotz, Christopher R. Bollinger, Tatiana Komarova, Charles F. Manski, Robert A. Moffitt, Denis Nekipelov, Aaron Sojourner, and Bruce D. Spencer. 2022 · 2022
Closest in time.
Leakage and the Reproducibility Crisis in ML-based Science
Sayash Kapoor and Arvind Narayanan. 2022 · 2022
Closest in time.
Blueprint for an AI Bill of Rights: Making Automated Systems Work for the American People
Office of Science and Technology Policy of the Executive Office of the President. 2022 · 2022
Closest in time.
A Note on Reimplementing the Castryck-Decru Attack and Lessons Learned for SageMath
Rémy Oudompheng and Giacomo Pope. 2022 · 2022
Closest in time.
Reconstruction Attacks on Aggressive Relaxations of Differential Privacy
Prottay Protivash, John Durrell, Zeyu Ding, Danfeng Zhang, and Daniel Kifer. 2022 · 2022
Closest in time.
An Efficient Key Recovery Attack on SIDH. In Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 423–447
Wouter Castryck and Thomas Decru. 2023 · 2023
Closest in time.
Joint Statement on Enforcement Efforts Against Discrimination and Bias In Automated Systems
Rohit Chopra, Kristin Clarke, Charlotte A. Burrows, and Lina M. Khan. 2023 · 2023
Closest in time.
Weak Fiat-Shamir Attacks on Modern Proof Systems
Quang Dao, Jim Miller, Opal Wright, and Paul Grubbs. 2023 · 2023
Closest in time.
Optimization’s Neglected Normative Commitments. In Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency (FAccT ’23) . 50–63
Benjamin Laufer, Thomas Gilbert, and Helen Nissenbaum. 2023 · 2023
Closest in time.
SIKE Cryptographic Challenge
Microsoft. 2023 · 2023
Closest in time.
OpenAI. 2023 · 2023
Closest in time.
An oversight hearing to examine A.I., focusing on rules for artificial intelligence
Senate Judiciary Subcommittee on Privacy, Technology, and the Law. 2023 · 2023
Closest in time.
No Free Delivery Service: Epistemic Limits of Passive Data Collection in Complex Social Systems
Maximilian Nickel. 2024 · 2024
Closest in time.
How to Prove False Statements: Practical Attacks on Fiat-Shamir
Dmitry Khovratovich, Ron D. Rothblum, and Lev Soukhanov. 2025 · 2025
Closest in time.