David J. Wu

Orcid: 0000-0002-5191-692X

Affiliations:
  • University of Texas at Austin, Department of Computer Science, TX, USA
  • University of Virginia (UVA), Department of Computer Science, Charlottesville, VA, USA (former)
  • Stanford University, CA, USA (former, PhD 2018)


According to our database1, David J. Wu authored at least 54 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis.
IACR Cryptol. ePrint Arch., 2024

Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2024

YPIR: High-Throughput Single-Server PIR with Silent Preprocessing.
IACR Cryptol. ePrint Arch., 2024

2023
Monotone Policy BARGs from BARGs and Additively Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2023

Realizing Flexible Broadcast Encryption: How to Broadcast to a Public-Key Directory.
IACR Cryptol. ePrint Arch., 2023

How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More.
IACR Cryptol. ePrint Arch., 2023

The One-Wayness of Jacobi Signatures.
IACR Cryptol. ePrint Arch., 2023

Authenticated private information retrieval.
IACR Cryptol. ePrint Arch., 2023

Non-Interactive Zero-Knowledge from Non-Interactive Batch Arguments.
IACR Cryptol. ePrint Arch., 2023

Batch Arguments to NIZKs from One-Way Functions.
IACR Cryptol. ePrint Arch., 2023

2022
Succinct Vector, Polynomial, and Functional Commitments from Lattices.
IACR Cryptol. ePrint Arch., 2022

Batch Arguments for NP and More from Standard Bilinear Group Assumptions.
IACR Cryptol. ePrint Arch., 2022

Multi-Authority ABE from Lattices without Random Oracles.
IACR Cryptol. ePrint Arch., 2022

Spiral: Fast, High-Rate Single-Server PIR via FHE Composition.
IACR Cryptol. ePrint Arch., 2022

Registered Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2022

Fully Succinct Batch Arguments for NP from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2022

Fully Succinct Batch Arguments for sfNP from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Batch Arguments for sfNP and More from Standard Bilinear Group Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
Avoiding genetic racial profiling in criminal DNA profile databases.
Nat. Comput. Sci., 2021

Watermarking Cryptographic Functionalities from Standard Lattice Assumptions.
J. Cryptol., 2021

CryptGPU: Fast Privacy-Preserving Machine Learning on the GPU.
IACR Cryptol. ePrint Arch., 2021

Traceable PRFs: Full Collusion Resistance and Active Security.
IACR Cryptol. ePrint Arch., 2021

Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices.
IACR Cryptol. ePrint Arch., 2021

2020
Multi-theorem Preprocessing NIZKs from Lattices.
J. Cryptol., 2020

New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More.
IACR Cryptol. ePrint Arch., 2020

Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2020

On Succinct Arguments and Witness Encryption from Groups.
IACR Cryptol. ePrint Arch., 2020

Can Verifiable Delay Functions Be Based on Random Oracles?
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2019

New Constructions of Reusable Designated-Verifier NIZKs.
IACR Cryptol. ePrint Arch., 2019

Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2019

Watermarking Public-Key Cryptographic Primitives.
IACR Cryptol. ePrint Arch., 2019

2018
Lattice-based non-interactive argument systems.
PhD thesis, 2018

Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs.
IACR Cryptol. ePrint Arch., 2018

Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs.
IACR Cryptol. ePrint Arch., 2018

Exploring Crypto Dark Matter: New Simple PRF Candidates and Their Applications.
IACR Cryptol. ePrint Arch., 2018

2017
Access Control Encryption for General Policies from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2017

Constrained Keys for Invertible Pseudorandom Functions.
IACR Cryptol. ePrint Arch., 2017

Lattice-Based SNARGs and Their Application to More Efficient Obfuscation.
IACR Cryptol. ePrint Arch., 2017

Quantum Operating Systems.
Proceedings of the 16th Workshop on Hot Topics in Operating Systems, 2017

2016
Privately Evaluating Decision Trees and Random Forests.
Proc. Priv. Enhancing Technol., 2016

Order-Revealing Encryption: New Constructions, Applications, and Lower Bounds.
IACR Cryptol. ePrint Arch., 2016

Function-Hiding Inner Product Encryption is Practical.
IACR Cryptol. ePrint Arch., 2016

Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions.
IACR Cryptol. ePrint Arch., 2016

Privacy-Preserving Shortest Path Computation.
Proceedings of the 23rd Annual Network and Distributed System Security Symposium, 2016

Privacy, Discovery, and Authentication for the Internet of Things.
Proceedings of the Computer Security - ESORICS 2016, 2016

2015
Practical Order-Revealing Encryption with Limited Leakage.
IACR Cryptol. ePrint Arch., 2015

Constraining Pseudorandom Functions Privately.
IACR Cryptol. ePrint Arch., 2015

Fully Homomorphic Encryption: Cryptography's holy grail.
XRDS, 2015

2014
Immunizing Multilinear Maps Against Zeroizing Attacks.
IACR Cryptol. ePrint Arch., 2014

2013
Private Database Queries Using Somewhat Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2013

Deep learning with COTS HPC systems.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
End-to-end text recognition with convolutional neural networks.
Proceedings of the 21st International Conference on Pattern Recognition, 2012

2011
Text Detection and Character Recognition in Scene Images with Unsupervised Feature Learning.
Proceedings of the 2011 International Conference on Document Analysis and Recognition, 2011


  Loading...