Skip to search formSkip to main contentSkip to account menu

A New Approach to Practical Active-Secure Two-Party Computation

A new approach to practical two-party computation secure against an active adversary is proposed, using an OT-based approach and getting efficiency via OT extension in the random oracle model.
View PDF on arXiv (opens in a new tab)

The Simplest Protocol for Oblivious Transfer

The simplest and most efficient protocol for 1-out-of-n OT to date is described, which is obtained by tweaking the Diffie-Hellman key-exchange protocol, and it achieves UC-security against active and adaptive corruptions in the random oracle model.
View via Publisher (opens in a new tab)

Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives

We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the security of symmetric-key primitives, believed to be quantum-secure, and (b) have…
View on ACM (opens in a new tab)

Semi-Homomorphic Encryption and Multiparty Computation

The relaxed notion of a semi-homomorphic encryption scheme is defined, where the plaintext can be recovered as long as the computed function does not increase the size of the input "too much", and a number of existing cryptosystems are captured.
View via Publisher (opens in a new tab)

ZKBoo: Faster Zero-Knowledge for Boolean Circuits

ZKBoo1 is a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and a proof-ofconcept implementation is described, which can generate a non-interactive proof for the SHA-1 circuit in approximately 13ms.
View Paper (opens in a new tab)

Access Control Encryption: Enforcing Information Flow with Cryptography

We initiate the study of Access Control Encryption ACE, a novel cryptographic primitive that allows fine-grained access control, by giving different rights to different users not only in terms of…
View PDF on arXiv (opens in a new tab)

Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently

The main contribution of this paper is to construct an efficient protocol for the special case of secure two-party computation where only one party has input (like in the zero-knowledge case) and is essentially only twice as slow as the passive secure version of Yao's garbled circuit protocol.
View on ACM (opens in a new tab)

Privacy-aware mechanism design

A new model of privacy-aware agents where agents need only have a conservative upper bound on how loss of privacy adversely affects their utility is proposed, in deviation from prior modeling which required full characterization.
View on ACM (opens in a new tab)

A privacy-preserving protocol for neural-network-based computation

The problem of secure data processing by means of a neural network (NN) is addressed and an efficient way of implementing the proposed protocol by Means of some recently proposed multi-party computation techniques is described.
View on ACM (opens in a new tab)

Calling out Cheaters: Covert Security With Public Verifiability

This work proposes (and formally define) an extension of the model where, when an honest party detects cheating, it also receives a certificate that can be published and used to persuade other parties, without revealing any information about the honest party's input.
View via Publisher (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)