• Publications
  • Influence
Subversion-Resilient Signature Schemes
TLDR
We provide a formal treatment of security of digital signatures against subversion attacks (SAs). Expand
  • 59
  • 10
  • PDF
Redactable Blockchain – or – Rewriting History in Bitcoin and Friends
TLDR
We put forward a new framework that makes it possible to re-write or compress the content of any number of blocks in decentralized services exploiting the blockchain technology. Expand
  • 108
  • 8
  • PDF
Continuous Non-malleable Codes
TLDR
Non-malleable codes are a natural relaxation of error correcting/ detecting codes that have useful applications in the context of tamper resilient cryptography. Expand
  • 101
  • 8
  • PDF
On the Non-malleability of the Fiat-Shamir Transform
TLDR
We formally define simulation soundness and a weak form of simulation extraction in the random oracle model (ROM). Expand
  • 80
  • 7
  • PDF
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits
TLDR
We show that for any polynomial bound s given a-priori, there is an efficient non-malleable code that protects against all tampering functions f computable by a circuit of size s. Expand
  • 73
  • 6
  • PDF
Leakage-Resilient Storage
TLDR
We introduce a new primitive, that we call leakage-resilient storage (LRS), which is an (unkeyed) scheme for encoding messages, and can be viewed as a generalization of the All-Or-Nothing Transform (AONT, Rivest 1997). Expand
  • 75
  • 5
  • PDF
Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience
TLDR
We revisit the question of constructing public-key encryption and signature schemes with security in the presence of bounded leakage and tampering memory attacks. Expand
  • 21
  • 5
  • PDF
Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier
TLDR
We show that it is possible to go beyond the algebraic barrier and achieve security against arbitrary key relations, by restricting the number of tampering queries the adversary is allowed to ask for. Expand
  • 32
  • 3
  • PDF
Efficient Authentication from Hard Learning Problems
TLDR
We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Expand
  • 51
  • 2
  • PDF
A Tamper and Leakage Resilient Random Access Machine
  • 7
  • 2