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 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- Rate-limited secure function evaluation (Q329720) (← links)
- Secure multi-party computation protocol for sequencing problem (Q350932) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Secure computation without computers (Q517015) (← links)
- Secure collaborative supply chain planning and inverse optimization -- the JELS model (Q621669) (← links)
- Probability timed automata for investigating communication processes (Q747506) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation (Q1687724) (← links)
- Quantum solution to a class of two-party private summation problems (Q1700369) (← links)
- Privacy-preserving outsourcing of image feature extraction in cloud computing (Q1701922) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Oblivious DFA evaluation on joint input and its applications (Q2023228) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069) (← links)
- Limits on the adaptive security of Yao's garbling (Q2128573) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Enforcing input correctness via certification in garbled circuit evaluation (Q2167732) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack (Q2195311) (← links)
- Secure two-party computation in a quantum world (Q2229292) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption (Q2829960) (← links)
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings (Q2874554) (← links)
- An Efficient Protocol for Oblivious DFA Evaluation and Applications (Q2890023) (← links)
- Secure Two-Party Computation: A Visual Way (Q2948250) (← links)
- Secure Top-k Subgroup Discovery (Q3003501) (← links)
- Adaptive Security of Yao’s Garbled Circuits (Q3179366) (← links)
