Pages that link to "Item:Q2267365"
From MaRDI portal
The following pages link to Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365):
Displaying 27 items.
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← links)
- Fairness versus guaranteed output delivery in secure multiparty computation (Q1698398) (← links)
- Stealthy protocols: metrics and open problems (Q1708705) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load (Q2218487) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract) (Q2819552) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries (Q2849382) (← links)
- Impracticality of Efficient PVSS in Real Life Security Standard (Poster) (Q3013015) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- From Passive to Covert Security at Low Cost (Q3408191) (← links)
- Simple, Black-Box Constructions of Adaptively Secure Protocols (Q3611778) (← links)
- Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption (Q4975186) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- Optimal Secret Protections in Discrete-Event Systems (Q5092185) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- A new approach to efficient and secure fixed-point computation (Q6547972) (← links)
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead (Q6595685) (← links)
- Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
