The following pages link to (Q4035733):
Displayed 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Partial fairness in secure two-party computation (Q421046) (← links)
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- A proof of security of Yao's protocol for two-party computation (Q1015361) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Secure multiplication of shared secrets in the exponent (Q1044710) (← links)
- Distributed anonymous data perturbation method for privacy-preserving data mining (Q1045647) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Robust threshold DSS signatures (Q1854399) (← 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)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Abstractions of non-interference security: probabilistic versus possibilistic (Q2018754) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- Obfuscation for cryptographic purposes (Q2267356) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- Simplified Universal Composability Framework (Q2796143) (← links)
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- Compact and Efficient UC Commitments Under Atomic-Exchanges (Q2942848) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- Anonymous Communication and Anonymous Cash (Q3452339) (← links)
- Composable Security in the Bounded-Quantum-Storage Model (Q3519536) (← links)
- Oblivious Transfer Is Symmetric (Q3593098) (← links)
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation (Q3593116) (← links)
- Adaptively Secure Two-Party Computation with Erasures (Q3623039) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- Efficient Fully-Simulatable Oblivious Transfer (Q5458932) (← links)
- Statistical Security Conditions for Two-Party Secure Function Evaluation (Q5502794) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Conditional Reactive Simulatability (Q5862529) (← links)
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)