scientific article; zbMATH DE number 1030985
From MaRDI portal
Publication:4343427
zbMath0876.94026MaRDI QIDQ4343427
Jeroen van de Graaf, Claude Crépeau, Alain Tapp
Publication date: 1 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bit commitmenterror correcting codesone-out-of-two oblivious transfercommitted oblivious transferprivate multi-party computation
Related Items (28)
One-way functions imply secure computation in a quantum world ⋮ Oblivious transfer in incomplete networks ⋮ On insecurity of Naor-Pinkas' distributed oblivious transfer ⋮ Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement ⋮ Rate-limited secure function evaluation ⋮ Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem ⋮ Generalizing Efficient Multiparty Computation ⋮ Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) ⋮ On sufficient oracles for secure computation with identifiable abort ⋮ On the impossibility of non-static quantum bit commitment between two parties ⋮ 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 ⋮ Composable Security in the Bounded-Quantum-Storage Model ⋮ Multi-party computation with conversion of secret sharing ⋮ Information-Theoretic Conditions for Two-Party Secure Function Evaluation ⋮ OT-Combiners via Secure Computation ⋮ Quantum state secure transmission in network communications ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ On the power of secure two-party computation ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Compact, efficient and UC-secure isogeny-based oblivious transfer ⋮ On Garbling Schemes with and Without Privacy ⋮ On the Power of Secure Two-Party Computation ⋮ A Single Initialization Server for Multi-party Cryptography ⋮ Statistical Security Conditions for Two-Party Secure Function Evaluation ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security
This page was built for publication:
