Pages that link to "Item:Q5428116"
From MaRDI portal
The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428116):
Displaying 50 items.
- Optimal extension protocols for Byzantine broadcast and agreement (Q2657277) (← links)
- Adaptively code-correlation robustness functions and its applications to private set intersection (Q2682918) (← links)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Secret-shared shuffle (Q2691590) (← links)
- Oblivious pseudorandom functions from isogenies (Q2692394) (← links)
- On derandomizing Yao's weak-to-strong OWF construction (Q2697871) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- An Efficient Protocol for Oblivious DFA Evaluation and Applications (Q2890023) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- The Simplest Protocol for Oblivious Transfer (Q2946440) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection (Q2975818) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- Secure Multiparty RAM Computation in Constant Rounds (Q3179368) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Improved Private Set Intersection Against Malicious Adversaries (Q5738879) (← links)
- SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates (Q5854428) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)
- Secure computation of the median (and other elements of specified ranks) (Q5962224) (← links)
- Structure-aware private set intersection, with applications to fuzzy matching (Q6097267) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model (Q6155273) (← links)
- Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation (Q6157518) (← links)
- Batching base oblivious transfers (Q6157552) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols (Q6488032) (← links)
- Constant-round multiparty private function evaluation with (quasi-)linear complexities (Q6535112) (← links)
- Predicate private set intersection with linear complexity (Q6535113) (← links)
- Secure approximate nearest neighbor search with locality-sensitive hashing (Q6558611) (← links)
- Private computations on set intersection (Q6613361) (← links)
- Improved circuit-based PSI via equality preserving compression (Q6619845) (← links)
- Composable oblivious pseudo-random functions via garbled circuits (Q6619935) (← links)
- New proof systems and an OPRF from CSIDH (Q6635825) (← links)
- Private set operations from multi-query reverse private membership test (Q6635832) (← links)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
