Pages that link to "Item:Q2914295"
From MaRDI portal
The following pages link to A New Approach to Practical Active-Secure Two-Party Computation (Q2914295):
Displaying 50 items.
- On various nonlinearity measures for Boolean functions (Q276554) (← links)
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Oblivious TLS via multi-party computation (Q826241) (← links)
- Information-theoretic broadcast with dishonest majority for long messages (Q1629421) (← links)
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- An efficient structural attack on NIST submission DAGS (Q1633442) (← links)
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost (Q1694723) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) (Q1710665) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Blazing fast OT for three-round UC OT extension (Q2055696) (← links)
- Going beyond dual execution: MPC for functions with efficient verification (Q2055697) (← links)
- Constant-overhead unconditionally secure multiparty computation over binary fields (Q2056769) (← links)
- Large scale, actively secure computation from LPN and free-XOR garbled circuits (Q2056780) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
- Guaranteed output delivery comes free in honest majority MPC (Q2096542) (← links)
- Improved primitives for MPC over mixed arithmetic-binary circuits (Q2096551) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- The price of active security in cryptographic protocols (Q2119012) (← links)
- ATLAS: efficient and scalable MPC in the honest majority setting (Q2128563) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Full-threshold actively-secure multiparty arithmetic circuit garbling (Q2146106) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Secure non-interactive simulation: feasibility and rate (Q2170112) (← links)
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security (Q2179391) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- New cryptanalysis of LowMC with algebraic techniques (Q2701509) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- Better Preprocessing for Secure Multiparty Computation (Q2822679) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- On the Communication Required for Unconditionally Secure Multiplication (Q2829225) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation (Q2849397) (← links)
- The Simplest Protocol for Oblivious Transfer (Q2946440) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
