Daniel Apon

Affiliations:
  • University of Maryland, College Park, MD, USA (PhD 2017)


According to our database1, Daniel Apon authored at least 31 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
So about that Quantum Lattice Thing: Rebuttal to "Exact Coset Sampling for Quantum Lattice Algorithms".
IACR Cryptol. ePrint Arch., 2025

2024
NICE-PAKE: On the Security of KEM-Based PAKE Constructions without Ideal Ciphers.
IACR Cryptol. ePrint Arch., 2024

2023
The Complexity of Grid Coloring.
Theory Comput. Syst., June, 2023

2022
When Frodo Flips: End-to-End Key Recovery on FrodoKEM via Rowhammer.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Nonmalleable Digital Lockers and Robust Fuzzy Extractors in the Plain Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
SoK: How (not) to Design and Implement Post-quantum Cryptography.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

2020
Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

Cryptanalysis of LEDAcrypt.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Constant-Round Group Key Exchange from the Ring-LWE Assumption.
Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

2017
Frontiers in Lattice Cryptography and Program Obfuscation.
PhD thesis, 2017

Vector Encoding over Lattices and Its Applications.
IACR Cryptol. ePrint Arch., 2017

Weak is Better: Tightly Secure Short Signatures from Weak PRFs.
IACR Cryptol. ePrint Arch., 2017

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Efficient, Reusable Fuzzy Extractors from LWE.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

2016
Review of: Analysis of Boolean Functions by Ryan O'Donnell.
SIGACT News, 2016

Fully-Secure Lattice-Based IBE as Compact as PKE.
IACR Cryptol. ePrint Arch., 2016

Dimension-Preserving Reductions from LWE to LWR.
IACR Cryptol. ePrint Arch., 2016

Deniable Attribute Based Encryption for Branching Programs from LWE.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

POPE: Partial Order Preserving Encoding.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Bi-Deniable Inner Product Encryption from LWE.
IACR Cryptol. ePrint Arch., 2015

2014
Review of selected papers on design of algorithms by Donald E. Knuth.
SIGACT News, 2014

Review of selected papers on discrete mathematics by Donald E. Knuth.
SIGACT News, 2014

Implementing Cryptographic Program Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Verifiable Oblivious Storage.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

2013
One-Round Multi-Party Communication Complexity of Distinguishing Sums.
Electron. Colloquium Comput. Complex., 2013

On Lower Bound Methods for Tree-like Cutting Plane Proofs
CoRR, 2013

2012
Review of theory of computation by Dexter C. Kozen.
SIGACT News, 2012

Parallel search for Ramsey grid colorings.
Proceedings of the 50th Annual Southeast Regional Conference, 2012

2011
Review of games, puzzles, & computation by Robert A. Hearn and Erik D. Demaine.
SIGACT News, 2011

2010
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, 2010


  Loading...