Pages that link to "Item:Q5429383"
From MaRDI portal
The following pages link to An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (Q5429383):
Displaying 50 items.
- 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 collaborative supply chain planning and inverse optimization -- the JELS model (Q621669) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited (Q1675724) (← links)
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost (Q1694723) (← links)
- A black-box construction of non-malleable encryption from semantically secure encryption (Q1747662) (← 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)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- Enforcing input correctness via certification in garbled circuit evaluation (Q2167732) (← 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)
- Privacy-preserving self-helped medical diagnosis scheme based on secure two-party computation in wireless sensor networks (Q2262421) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- Escrow free attribute-based signature with self-revealability (Q2282038) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- On Garbling Schemes with and Without Privacy (Q2827734) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Constant-Round Maliciously Secure Two-Party Computation in the RAM Model (Q3179369) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting (Q3457062) (← links)
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (Q3457092) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- Adaptively Secure Two-Party Computation with Erasures (Q3623039) (← links)
- Two-Prover Protocols---Low Error at Affordable Rates (Q4507353) (← links)
- Techniques for Efficient Secure Computation Based on Yao’s Protocol (Q4916013) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Two-Round Oblivious Linear Evaluation from Learning with Errors (Q5087264) (← links)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (Q5261691) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Oblivious transfer based on single-qubit rotations (Q5272497) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Efficient Fully-Simulatable Oblivious Transfer (Q5458932) (← links)
- An Efficient Protocol for Fair Secure Two-Party Computation (Q5458934) (← 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)
