Pages that link to "Item:Q1976004"

The following pages link to Player simulation and general adversary structures in perfect multiparty computation (Q1976004):

Displaying 40 items.

• \(d\)-dimensional quantum state sharing with adversary structure (Q291513) (← links)
• Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission (Q391242) (← links)
• Recursive hiding of biometrics-based secret sharing scheme using adversary structure (Q456087) (← links)
• On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
• On \(d\)-multiplicative secret sharing (Q604627) (← links)
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
• Efficient robust secret sharing from expander graphs (Q680925) (← links)
• Round-efficient perfectly secure message transmission scheme against general adversary (Q766245) (← links)
• On cryptographic anonymity and unpredictability in secret sharing (Q783702) (← links)
• Information security protocol based system identification with binary-valued observations (Q1621182) (← links)
• Best possible information-theoretic MPC (Q1631330) (← links)
• On the (in)efficiency of non-interactive secure multiparty computation (Q1650437) (← links)
• On private computation in incomplete networks (Q1954202) (← links)
• Random probing security: verification, composition, expansion and new constructions (Q2096491) (← links)
• Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
• Broadcast-optimal two-round MPC (Q2119034) (← links)
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract) (Q2152066) (← links)
• Two quantum secret sharing schemes with adversary structure (Q2165333) (← links)
• Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
• The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
• Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
• Secure multi-party computation made simple (Q2489932) (← links)
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
• Secret-Sharing Schemes: A Survey (Q3005578) (← links)
• Secure Outsourced Computation (Q3011899) (← links)
• Generic Constant-Round Oblivious Sorting Algorithm for MPC (Q3092362) (← links)
• Byzantine Agreement Using Partial Authentication (Q3095344) (← links)
• Secure Message Transmission in Asynchronous Directed Graphs (Q3104754) (← links)
• How to deal with malicious users in privacy‐preserving distributed data mining (Q3497744) (← links)
• Secure Protocols with Asymmetric Trust (Q3498386) (← links)
• MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
• Cryptanalysis of Secure Message Transmission Protocols with Feedback (Q4931676) (← links)
• Symmetric Authentication within a Simulatable Cryptographic Library (Q5030211) (← links)
• Strong Separations Between Broadcast and Authenticated Channels (Q5090929) (← links)
• Cryptography and cryptographic protocols (Q5138490) (← links)
• On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
• Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
• Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience (Q6204550) (← links)