Pages that link to "Item:Q1976007"
From MaRDI portal
The following pages link to Security and composition of multiparty cryptographic protocols (Q1976007):
Displaying 42 items.
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Efficient perfectly secure computation with optimal resilience (Q5925697) (← links)
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)
- Secure computation of the median (and other elements of specified ranks) (Q5962224) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- Semi-quantum key agreement protocol using W states (Q6069565) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Anonymous quantum conference key agreement using the W state (Q6073966) (← links)
- Gossiping for communication-efficient broadcast (Q6108990) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- On the power of an honest majority in three-party computation without broadcast (Q6109073) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Fast large-scale honest-majority MPC for malicious adversaries (Q6110373) (← links)
- Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
- High-throughput secure three-party computation with an honest majority (Q6110385) (← links)
- Asymptotically free broadcast in constant expected time via packed VSS (Q6114239) (← links)
- Secure non-interactive simulation from arbitrary joint distributions (Q6114278) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Fast two-party signature for upgrading ECDSA to two-party scenario easily (Q6138829) (← links)
- \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s (Q6164395) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness (Q6169419) (← links)
- Optimally-fair multi-party exchange without trusted parties (Q6550628) (← links)
- Secure approximate nearest neighbor search with locality-sensitive hashing (Q6558611) (← links)
- OptORAMa: Optimal oblivious RAM (Q6567264) (← links)
- Secure multi-party SM2 signature based on SPDZ protocol (Q6573655) (← links)
- Towards topology-hiding computation from oblivious transfer (Q6581794) (← links)
- 3-party secure computation for RAMs: optimal and concretely efficient (Q6581802) (← links)
- Three party secure computation with friends and foes (Q6582170) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
- R3PO: reach-restricted reactive program obfuscation and its applications (Q6635820) (← links)
- Ordering transactions with bounded unfairness: definitions, complexity and constructions (Q6637324) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
- Approximate lower bound arguments (Q6637520) (← links)
- Constant-round simulation-secure coin tossing extension with guaranteed output (Q6637540) (← links)
- Perfect (parallel) broadcast in constant expected rounds via statistical VSS (Q6637549) (← links)
- Universal composable transaction serialization with order fairness (Q6648204) (← links)
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably (Q6653024) (← links)
- Towards achieving asynchronous MPC with linear communication and optimal resilience (Q6653027) (← links)
- Linear-communication asynchronous complete secret sharing with optimal resilience (Q6653035) (← links)
- Privacy-preserving Dijkstra (Q6653041) (← links)
- Scalable agreement protocols with optimal optimistic efficiency (Q6660395) (← links)
