Committed oblivious transfer and private multi-party computation

DOI10.1007/3-540-44750-4_9MaRDI QIDQ4343427zbMATH OpenFDO

Authors Claude Crépeau, Jeroen van de Graaf, Alain Tapp

Publication date 1 December 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44750-4_9

bit commitment committed oblivious transfer error correcting codes one-out-of-two oblivious transfer private multi-party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

Topics in Cryptology – CT-RSA 2006
Theory of Cryptography
On the efficiency of bit commitment reductions
Efficient Two-Party Secure Computation on Committed Inputs
Secure two-party computation over a Z-channel

Cited in

(39)

Oblivious transfer in incomplete networks
\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
High-performance multi-party computation for binary circuits based on oblivious transfer
Compact, efficient and UC-secure isogeny-based oblivious transfer
Efficient and tight oblivious transfer from PKE with tight multi-user security
One-way functions imply secure computation in a quantum world
On the power of secure two-party computation
On insecurity of Naor-Pinkas' distributed oblivious transfer
On the complexity of additively homomorphic UC commitments
Accelerating oblivious transfer with batch multi-exponentiation
On garbling schemes with and without privacy
On the Power of Secure Two-Party Computation
Oblivious transfer from weakly random self-reducible public-key cryptosystem
Generalizing efficient multiparty computation
Efficient generic zero-knowledge proofs from commitments (extended abstract)
On the efficiency of bit commitment reductions
Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement
Rate-limited secure function evaluation
Composable Security in the Bounded-Quantum-Storage Model
Information-Theoretic Conditions for Two-Party Secure Function Evaluation
On the impossibility of non-static quantum bit commitment between two parties
Communication-efficient distributed oblivious transfer
scientific article; zbMATH DE number 1941258 (Why is no real title available?)
OT-Combiners via Secure Computation
Computational and Information Science
A Single Initialization Server for Multi-party Cryptography
Statistical Security Conditions for Two-Party Secure Function Evaluation
Oblivious Transfer Based on the McEliece Assumptions
Topics in Cryptology – CT-RSA 2006
Theory of Cryptography
On sufficient oracles for secure computation with identifiable abort
Cryptography with certified deletion
Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge)
On the question of secret probability distributions in quantum bit commitment
On the correlation complexity of MPC with cheater identification
Multi-party computation with conversion of secret sharing
On the communication complexity of secure multi-party computation with aborts
Quantum state secure transmission in network communications
Shared OT and its applications

This page was built for publication: Committed oblivious transfer and private multi-party computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4343427)