The following pages link to (Q4343426):
Displaying 22 items.
- Multi-party computation with conversion of secret sharing (Q664384) (← links)
- Private computation using a PEZ dispenser. (Q1426438) (← links)
- Oblivious transfer in incomplete networks (Q1629424) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster (Q2057167) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Oblivious Transfer Is Symmetric (Q3593098) (← links)
- Oblivious Transfer Based on the McEliece Assumptions (Q5502796) (← links)
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (Q5738872) (← links)
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND (Q5857004) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5918800) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
