default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Apon
Person information
- affiliation (PhD 2017): University of Maryland, College Park, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b1]Daniel Christopher Apon:
Frontiers in Lattice Cryptography and Program Obfuscation. University of Maryland, College Park, MD, USA, 2017
Journal Articles
- 2023
- [j8]Daniel Apon, William Gasarch
, Kevin Lawler:
The Complexity of Grid Coloring. Theory Comput. Syst. 67(3): 521-547 (2023) - 2016
- [j7]Daniel Apon:
Review of: Analysis of Boolean Functions by Ryan O'Donnell. SIGACT News 47(4): 9-12 (2016) - 2014
- [j6]Daniel Apon:
Review of selected papers on discrete mathematics by Donald E. Knuth. SIGACT News 45(2): 10-13 (2014) - [j5]Daniel Apon:
Review of selected papers on design of algorithms by Donald E. Knuth. SIGACT News 45(2): 14-16 (2014) - 2013
- [j4]Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
One-round multi-party communication complexity of distinguishing sums. Theor. Comput. Sci. 501: 101-108 (2013) - 2012
- [j3]Daniel Apon:
Review of theory of computation by Dexter C. Kozen. SIGACT News 43(1): 23-27 (2012) - 2011
- [j2]Daniel Apon:
Review of games, puzzles, & computation by Robert A. Hearn and Erik D. Demaine. SIGACT News 42(3): 45-49 (2011) - 2010
- [j1]Daniel Apon:
Joint review of computational complexity: a conceptual perspective by Oded Goldreich published by Cambridge University Press, 2008 and computational complexity: a modern approach by Sanjeev Arora and Boaz Barak published by Cambridge University Press, 2009. SIGACT News 41(4): 15-21 (2010)
Conference and Workshop Papers
- 2022
- [c13]Daniel Apon, Chloé Cachet, Benjamin Fuller, Peter Hall, Feng-Hao Liu:
Nonmalleable Digital Lockers and Robust Fuzzy Extractors in the Plain Model. ASIACRYPT (4) 2022: 353-383 - [c12]Michael Fahr, Hunter Kippen, Andrew Kwong, Thinh Dang, Jacob Lichtinger, Dana Dachman-Soled, Daniel Genkin, Alexander Nelson, Ray A. Perlner, Arkady Yerukhimovich, Daniel Apon:
When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer. CCS 2022: 979-993 - 2021
- [c11]James Howe, Thomas Prest, Daniel Apon:
SoK: How (not) to Design and Implement Post-quantum Cryptography. CT-RSA 2021: 444-477 - 2020
- [c10]Daniel Apon, Ray A. Perlner, Angela Robinson, Paolo Santini:
Cryptanalysis of LEDAcrypt. CRYPTO (3) 2020: 389-418 - [c9]Daniel Apon, Dustin Moody, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme. PQCrypto 2020: 307-322 - 2019
- [c8]Daniel Apon, Dana Dachman-Soled, Huijing Gong, Jonathan Katz:
Constant-Round Group Key Exchange from the Ring-LWE Assumption. PQCrypto 2019: 189-205 - 2017
- [c7]Daniel Apon, Chongwon Cho, Karim Eldefrawy, Jonathan Katz:
Efficient, Reusable Fuzzy Extractors from LWE. CSCML 2017: 1-18 - [c6]Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee:
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. ICALP 2017: 38:1-38:16 - 2016
- [c5]Kevin Lewi, Alex J. Malozemoff, Daniel Apon, Brent Carmer, Adam Foltzer, Daniel Wagner, David W. Archer, Dan Boneh, Jonathan Katz, Mariana Raykova:
5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs. CCS 2016: 981-992 - [c4]Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich:
POPE: Partial Order Preserving Encoding. CCS 2016: 1131-1142 - [c3]Daniel Apon, Xiong Fan, Feng-Hao Liu:
Deniable Attribute Based Encryption for Branching Programs from LWE. TCC (B2) 2016: 299-329 - 2014
- [c2]Daniel Apon, Jonathan Katz, Elaine Shi, Aishwarya Thiruvengadam:
Verifiable Oblivious Storage. Public Key Cryptography 2014: 131-148 - 2012
- [c1]Daniel Apon, Wing Ning Li:
Parallel search for Ramsey grid colorings. ACM Southeast Regional Conference 2012: 274-279
Informal and Other Publications
- 2022
- [i22]Michael Fahr, Hunter Kippen, Andrew Kwong, Thinh Dang, Jacob Lichtinger, Dana Dachman-Soled, Daniel Genkin, Alexander Nelson, Ray A. Perlner, Arkady Yerukhimovich, Daniel Apon:
When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer. IACR Cryptol. ePrint Arch. 2022: 952 (2022) - [i21]Daniel Apon, Chloé Cachet, Benjamin Fuller, Peter Hall, Feng-Hao Liu:
Nonmalleable Digital Lockers and Robust Fuzzy Extractors in the Plain Model. IACR Cryptol. ePrint Arch. 2022: 1108 (2022) - 2021
- [i20]James Howe, Thomas Prest, Daniel Apon:
SoK: How (not) to Design and Implement Post-Quantum Cryptography. IACR Cryptol. ePrint Arch. 2021: 462 (2021) - 2020
- [i19]Daniel Apon, Ray A. Perlner, Angela Robinson, Paolo Santini:
Cryptanalysis of LEDAcrypt. IACR Cryptol. ePrint Arch. 2020: 455 (2020) - [i18]Daniel Apon, Dustin Moody, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel:
Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme. IACR Cryptol. ePrint Arch. 2020: 1086 (2020) - 2019
- [i17]Daniel Apon, Dana Dachman-Soled, Huijing Gong, Jonathan Katz:
Constant-Round Group Key Exchange from the Ring-LWE Assumption. IACR Cryptol. ePrint Arch. 2019: 398 (2019) - 2017
- [i16]Daniel Apon, Xiong Fan, Feng-Hao Liu:
Vector Encoding over Lattices and Its Applications. IACR Cryptol. ePrint Arch. 2017: 455 (2017) - [i15]Jacob Alperin-Sheriff, Daniel Apon:
Weak is Better: Tightly Secure Short Signatures from Weak PRFs. IACR Cryptol. ePrint Arch. 2017: 563 (2017) - [i14]Daniel Apon, Chongwon Cho, Karim Eldefrawy, Jonathan Katz:
Efficient, Reusable Fuzzy Extractors from LWE. IACR Cryptol. ePrint Arch. 2017: 755 (2017) - 2016
- [i13]Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich:
POPE: Partial Order Preserving Encoding. CoRR abs/1610.04025 (2016) - [i12]Daniel Apon, Xiong Fan, Feng-Hao Liu:
Fully-Secure Lattice-Based IBE as Compact as PKE. IACR Cryptol. ePrint Arch. 2016: 125 (2016) - [i11]Daniel Apon, Xiong Fan, Feng-Hao Liu:
Deniable Attribute Based Encryption for Branching Programs from LWE. IACR Cryptol. ePrint Arch. 2016: 562 (2016) - [i10]Jacob Alperin-Sheriff, Daniel Apon:
Dimension-Preserving Reductions from LWE to LWR. IACR Cryptol. ePrint Arch. 2016: 589 (2016) - [i9]Kevin Lewi, Alex J. Malozemoff, Daniel Apon, Brent Carmer, Adam Foltzer, Daniel Wagner, David W. Archer, Dan Boneh, Jonathan Katz, Mariana Raykova:
5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs. IACR Cryptol. ePrint Arch. 2016: 619 (2016) - [i8]Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee:
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. IACR Cryptol. ePrint Arch. 2016: 1003 (2016) - 2015
- [i7]Daniel Apon, Xiong Fan, Feng-Hao Liu:
Bi-Deniable Inner Product Encryption from LWE. IACR Cryptol. ePrint Arch. 2015: 993 (2015) - [i6]Daniel S. Roche, Daniel Apon, Seung Geol Choi, Arkady Yerukhimovich:
POPE: Partial Order-Preserving Encoding. IACR Cryptol. ePrint Arch. 2015: 1106 (2015) - 2014
- [i5]Daniel Apon, Jonathan Katz, Elaine Shi, Aishwarya Thiruvengadam:
Verifiable Oblivious Storage. IACR Cryptol. ePrint Arch. 2014: 153 (2014) - [i4]Daniel Apon, Yan Huang, Jonathan Katz, Alex J. Malozemoff:
Implementing Cryptographic Program Obfuscation. IACR Cryptol. ePrint Arch. 2014: 779 (2014) - 2013
- [i3]Daniel Apon:
On Lower Bound Methods for Tree-like Cutting Plane Proofs. CoRR abs/1301.0862 (2013) - [i2]Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
One-Round Multi-Party Communication Complexity of Distinguishing Sums. CoRR abs/1301.4269 (2013) - [i1]Daniel Apon, Jonathan Katz, Alex J. Malozemoff:
One-Round Multi-Party Communication Complexity of Distinguishing Sums. Electron. Colloquium Comput. Complex. TR13 (2013)
Coauthor Index
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-04-24 23:10 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:
