scientific article; zbMATH DE number 1256767
From MaRDI portal
Publication:4228503
zbMath0917.94012MaRDI QIDQ4228503
Publication date: 1 March 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitycryptographic primitivesrandom number generationone-way functioncomplete Boolean functionobvious transfer
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (35)
On the round complexity of black-box secure MPC ⋮ Two-round MPC: information-theoretic and black-box ⋮ Information-theoretic broadcast with dishonest majority for long messages ⋮ Secure Multiparty RAM Computation in Constant Rounds ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Round-optimal black-box protocol compilers ⋮ More efficient oblivious transfer extensions ⋮ On the feasibility of extending oblivious transfer ⋮ The Simplest Protocol for Oblivious Transfer ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Fully-secure MPC with minimal trust ⋮ Adaptively code-correlation robustness functions and its applications to private set intersection ⋮ Oblivious transfer with constant computational overhead ⋮ SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model ⋮ Batching base oblivious transfers ⋮ Oblivious-transfer complexity of noisy coin-toss via secure zero communication reductions ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ All-but-many encryption ⋮ Improved Private Set Intersection Against Malicious Adversaries ⋮ OT-Combiners via Secure Computation ⋮ On the Complexity of Additively Homomorphic UC Commitments ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ A proof of security of Yao's protocol for two-party computation ⋮ On the power of secure two-party computation ⋮ Blazing fast OT for three-round UC OT extension ⋮ Oblivious transfer is in MiniQCrypt ⋮ Network Oblivious Transfer ⋮ On the Power of Secure Two-Party Computation ⋮ On Complete Primitives for Fairness ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens
This page was built for publication:
