scientific article; zbMATH DE number 1030984
From MaRDI portal
Publication:4343426
zbMath0876.94021MaRDI QIDQ4343426
Publication date: 1 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ Oblivious transfer in incomplete networks ⋮ Lower and upper bounds on the randomness complexity of private computations of AND ⋮ On the feasibility of extending oblivious transfer ⋮ Correction to: ``Topology-hiding communication from minimal assumptions ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Structure-aware private set intersection, with applications to fuzzy matching ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Random sources in private computation ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Malicious secure, structure-aware private set intersection ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ Private computation using a PEZ dispenser. ⋮ Multi-party computation with conversion of secret sharing ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Oblivious Transfer Is Symmetric ⋮ 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 ⋮ An improvement of multi-exponentiation with encrypted bases argument: smaller and faster ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ Network Oblivious Transfer ⋮ Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND ⋮ Broadcast-optimal two-round MPC
This page was built for publication:
