-
Chapter and Conference Paper
Succinct Functional Commitments for Circuits from k- \(\textsf{Lin}\)
A functional commitment allows a user to commit to an input \(\textbf{x}\) x ...
-
Chapter and Conference Paper
Succinct Vector, Polynomial, and Functional Commitments from Lattices
Vector commitment schemes allow a user to commit to a vector of values \(\textbf{x}\in \{0,1\}^\ell \) ...
-
Chapter and Conference Paper
Registered Attribute-Based Encryption
Attribute-based encryption (ABE) generalizes public-key encryption and enables fine-grained control to encrypted data. However, ABE upends the traditional trust model of public-key encryption by requiring a si...
-
Chapter and Conference Paper
Non-interactive Zero-Knowledge from Non-interactive Batch Arguments
Zero-knowledge and succinctness are two important properties that arise in the study of non-interactive arguments. Previously, Kitagawa et al. (TCC 2020) showed how to obtain a non-interactive zero-knowledge (...
-
Chapter and Conference Paper
Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis
A functional commitment allows a user to commit to an input \(\textbf{x}\in \{0,1\}^\ell \) ...
-
Chapter and Conference Paper
How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More
Witness encryption is a generalization of public-key encryption where the public key can be any \(\textsf{NP}\) ...
-
Chapter and Conference Paper
Fully Succinct Batch Arguments for \(\textsf{NP}\) from Indistinguishability Obfuscation
Non-interactive batch arguments for \(\textsf{NP} \) NP provide a way to am...
-
Chapter and Conference Paper
Multi-authority ABE from Lattices Without Random Oracles
Attribute-based encryption (ABE) extends public-key encryption to enable fine-grained control to encrypted data. However, this comes at the cost of needing a central trusted authority to issue decryption keys. A ...
-
Chapter and Conference Paper
Traceable PRFs: Full Collusion Resistance and Active Security
The main goal of traceable cryptography is to protect against unauthorized redistribution of cryptographic functionalities. Such schemes provide a way to embed identities (i.e., a “mark”) within cryptographic ...
-
Chapter and Conference Paper
Batch Arguments for \(\textsf{NP}\) and More from Standard Bilinear Group Assumptions
Non-interactive batch arguments for \(\textsf{NP}\) NP provide a way to amo...
-
Article
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions
A software watermarking scheme allows one to embed a “mark” into a program without significantly altering the behavior of the program. Moreover, it should be difficult to remove the watermark without destroyin...
-
Article
Avoiding genetic racial profiling in criminal DNA profile databases
DNA profiling has become an essential tool for crime solving and prevention, and CODIS (Combined DNA Index System) criminal investigation databases have flourished at the national, state and even local level. ...
-
Chapter and Conference Paper
Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions
Software watermarking schemes allow a user to embed an identifier into a piece of code such that the resulting program is nearly functionally-equivalent to the original program, and yet, it is difficult to rem...
-
Article
Multi-theorem Preprocessing NIZKs from Lattices
Non-interactive zero-knowledge (NIZK) proofs are fundamental to modern cryptography. Numerous NIZK constructions are known in both the random oracle and the common reference string (CRS) models. In the CRS mod...
-
Chapter and Conference Paper
On Succinct Arguments and Witness Encryption from Groups
Succinct non-interactive arguments (SNARGs) enable proofs of \(\mathsf {NP} \) statements with very low communication...
-
Chapter and Conference Paper
Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions
A traitor tracing scheme is a multi-user public-key encryption scheme where each user in the system holds a decryption key that is associated with the user’s identity. Using the public key, a content distribut...
-
Chapter and Conference Paper
New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More
Non-interactive zero-knowledge proofs (NIZKs) are important primitives in cryptography. A major challenge since the early works on NIZKs has been to construct NIZKs with a statistical zero-knowledge guarantee aga...
-
Chapter and Conference Paper
Watermarking Public-Key Cryptographic Primitives
A software watermarking scheme enables users to embed a message or mark within a program while preserving its functionality
-
Chapter and Conference Paper
New Constructions of Reusable Designated-Verifier NIZKs
Non-interactive zero-knowledge arguments (NIZKs) for \(\mathsf {NP}\) are an important cryptographic primitive
-
Chapter and Conference Paper
Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs
A software watermarking scheme enables one to embed a “mark” (i.e., a message) within a program while preserving the program’s functionality
