Pages that link to "Item:Q1976007"
From MaRDI portal
The following pages link to Security and composition of multiparty cryptographic protocols (Q1976007):
Displaying 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)
- An optimally fair coin toss (Q315542) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- Partial fairness in secure two-party computation (Q421046) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← 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)
- Secure computation without computers (Q517015) (← links)
- Electronic jury voting protocols (Q596143) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Secure computation without authentication (Q656923) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- An integrated hierarchical dynamic quantum secret sharing protocol (Q747847) (← links)
- A note on the Chen-Morrissey-Smart DAA scheme (Q763534) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← 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)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Secure multiplication of shared secrets in the exponent (Q1044710) (← links)
- On the security of p-party protocols (Q1102922) (← links)
- Composition of secure multi-party protocols. A comprehensive study. (Q1407493) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Perfect secure computation in two rounds (Q1629404) (← 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)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Private set-intersection with common set-up (Q1783703) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- On private computation in incomplete networks (Q1954202) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- MPC with friends and foes (Q2096545) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- FAST: fair auctions via secret transactions (Q2096643) (← links)
- Coin-based multi-party fair exchange (Q2117033) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Proof-of-reputation blockchain with Nakamoto fallback (Q2152017) (← links)
