• Publications
  • Influence
Universally Composable Commitments
We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantees that commitment protocols behave like an "ideal commitment service,"
Random Oracles in a Quantum World
TLDR
It is shown that certain post-quantum proposals, including ones based on lattices, can be proven secure using history-free reductions and are therefore postquantum secure.
Physically Uncloneable Functions in the Universal Composition Framework
TLDR
This paper augments Canetti's universal composition (UC) framework by considering Physically Uncloneable Functions (PUFs) in the UC framework, and devise efficient UC-secure protocols for basic tasks like oblivious transfer, commitments, and key exchange.
Security of Sanitizable Signatures Revisited
TLDR
This work revisits the security requirements for sanitizable signatures and, for the first time, presents a comprehensive formal treatment, investigating the relationship of the properties and showing for example that unforgeability follows from accountability.
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
TLDR
Based on the quadratic residuosity assumption, a non-interactive crypto-computing protocol for the greater-than function is presented such that only the relation of the parties' inputs is revealed and the number of modular multiplications reduced significantly.
Redactable Signatures for Tree-Structured Data: Definitions and Constructions
TLDR
This work revisits Kundu and Bertino's work and gives rigorous security models for the redactable signatures for tree-structured data, relate the notions, and give a construction that can be proven secure under standard cryptographic assumptions.
Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
TLDR
A superlogarithmic lower bound on the number of hash function evaluations for such online extractable proofs is given, matching the number in the construction, and how to enhance security of the group signature scheme suggested recently by Boneh, Boyen and Shacham with its construction is shown.
Round-Optimal Composable Blind Signatures in the Common Reference String Model
TLDR
This work builds concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity, and puts forward the definition of universally composable blind signature schemes.
A Formal Approach to Distance-Bounding RFID Protocols
TLDR
The security of the RFID distance-bounding scheme due to Kim and Avoine is assessed, and it is enhanced to include impersonation security and allow for errors due to noisy channel transmissions.
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
TLDR
A deterministic scheme for the secure encryption of uniformly and independently distributed messages based solely on the existence of trapdoor one-way permutations is presented and a generalization of the construction is shown that allows secure deterministic encryption of independent high-entropy messages.
...
...