Pages that link to "Item:Q1015361"
From MaRDI portal
The following pages link to A proof of security of Yao's protocol for two-party computation (Q1015361):
Displaying 41 items.
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss (Q3181035) (← links)
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory (Q3304808) (← links)
- One-Time Programs with Limited Memory (Q3454868) (← links)
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions (Q3603006) (← links)
- Adaptively Secure Two-Party Computation with Erasures (Q3623039) (← links)
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption (Q4915998) (← links)
- Techniques for Efficient Secure Computation Based on Yao’s Protocol (Q4916013) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- The Complexity of Differential Privacy (Q5021135) (← links)
- Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption (Q5056012) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations (Q5157397) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- Cryptography and Game Theory: Designing Protocols for Exchanging Information (Q5445513) (← links)
- Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender (Q5498725) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
- Dispelling myths on superposition attacks: formal security model and attack analyses (Q5918646) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5918800) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- Triply adaptive UC NIZK (Q6132421) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
- How to build a trapdoor function from an encryption scheme (Q6157550) (← links)
- Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)
- A new approach to garbled circuits (Q6535139) (← links)
- A conceptually simple and generic construction of plaintext checkable encryption in the standard model (Q6544472) (← links)
- A novel quantum protocol for secure Hamming distance computation (Q6547324) (← links)
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
- PFE: linear active security, double-shuffle proofs, and low-complexity communication (Q6573663) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead (Q6595685) (← links)
- Certified everlasting secure collusion-resistant functional encryption, and more (Q6637338) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
- Toward malicious constant-rate 2PC via arithmetic garbling (Q6637552) (← links)
- Malicious security for SCALES. Outsourced computation with ephemeral servers (Q6653038) (← links)
