• Publications
  • Influence
Tamper and Leakage Resilience in the Split-State Model
TLDR
In this paper, we show how to algorithmically secure any cryptographic functionality from continual split-state leakage and tampering attacks. Expand
  • 127
  • 14
  • PDF
Memory Delegation
TLDR
We consider the problem of delegating computation, where the delegator doesn't even know the input to the function being delegated, and runs in time significantly smaller than the input length. Expand
  • 119
  • 4
  • PDF
Constant-Round MPC with Fairness and Guarantee of Output Delivery
TLDR
We study the round complexity of multiparty computation with fairness and guaranteed output delivery, assuming existence of an honest majority. Expand
  • 48
  • 4
  • PDF
Leakage Resilient Fully Homomorphic Encryption
TLDR
We construct the first leakage resilient variants of fully homomorphic encryption (FHE) schemes based on the decision learning with errors (DLWE) assumption. Expand
  • 11
  • 4
  • PDF
Various Proxy Re-Encryption Schemes from Lattices
TLDR
In this work, we first point out a subtle but serious mistake in the security proof of the work by Kirshanova. Expand
  • 11
  • 3
  • PDF
Reducing the Leakage in Practical Order-Revealing Encryption
TLDR
We study practical order-revealing encryption (ORE) with a well-defined leakage profile (the information revealed about the plaintexts from their ciphertexts), a direction recently initiated by Chenette, Lewi, Weis, and Wu. Expand
  • 21
  • 3
  • PDF
Parameter-Hiding Order Revealing Encryption
TLDR
We define a new notion of security for order-revealing encryption, called parameter-hiding ORE, which maintains the secrecy of these parameters. Expand
  • 11
  • 3
  • PDF
Re-encryption, Functional Re-encryption, and Multi-hop Re-encryption: A Framework for Achieving Obfuscation-Based Security and Instantiations from Lattices
TLDR
We construct a secure obfuscator for the re-encryption primitive from the Decisional Learning with Errors DLWE assumption, without going through fully homomorphic encryption. Expand
  • 40
  • 2
  • PDF
Public-Key Cryptography from New Multivariate Quadratic Assumptions
TLDR
We study a new type of assumption inspired from the field of solving multivariate quadratic (MQ) equations that can be used to construct public-key encryptions. Expand
  • 36
  • 2
  • PDF
Parallel Repetition Theorems for Interactive Arguments
TLDR
We study efficient parallel repetition theorems for several classes of interactive arguments and obtain the following results: We show a tight parallel repetition theorem for public-coin interactive arguments. Expand
  • 35
  • 2
  • PDF
...
1
2
3
4
...