Player simulation and general adversary structures in perfect multiparty computation
From MaRDI portal
Publication:1976004
DOI10.1007/s001459910003zbMath0988.94019OpenAlexW2098487689WikidataQ127473016 ScholiaQ127473016MaRDI QIDQ1976004
Publication date: 25 June 2002
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001459910003
Related Items
Information security protocol based system identification with binary-valued observations, YOSO: You only speak once. Secure MPC with stateless ephemeral roles, \(d\)-dimensional quantum state sharing with adversary structure, Best possible information-theoretic MPC, Perfectly-secure asynchronous MPC for general adversaries (extended abstract), On the (in)efficiency of non-interactive secure multiparty computation, Two quantum secret sharing schemes with adversary structure, Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols, On locally decodable codes, self-correctable codes, and \(t\)-private PIR, On \(d\)-multiplicative secret sharing, Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission, How to deal with malicious users in privacy‐preserving distributed data mining, Secure Protocols with Asymmetric Trust, Public randomness extraction with ephemeral roles and worst-case corruptions, Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries, Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries, Perfect MPC over layered graphs, Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience, Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?, On private computation in incomplete networks, Recursive hiding of biometrics-based secret sharing scheme using adversary structure, Cryptography and cryptographic protocols, Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures, Secret-Sharing Schemes: A Survey, The reactive simulatability (RSIM) framework for asynchronous systems, Secure Outsourced Computation, Efficient robust secret sharing from expander graphs, On the Computational Overhead of MPC with Dishonest Majority, Unifying simulatability definitions in cryptographic systems under different timing assumptions, Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation, Secure multi-party computation made simple, Cryptanalysis of Secure Message Transmission Protocols with Feedback, MPC vs. SFE : Unconditional and Computational Security, Generic Constant-Round Oblivious Sorting Algorithm for MPC, Strong Separations Between Broadcast and Authenticated Channels, Byzantine Agreement Using Partial Authentication, Round-efficient perfectly secure message transmission scheme against general adversary, Secure Message Transmission in Asynchronous Directed Graphs, On cryptographic anonymity and unpredictability in secret sharing, Random probing security: verification, composition, expansion and new constructions, Black-box transformations from passive to covert security with public verifiability, Symmetric Authentication within a Simulatable Cryptographic Library, Broadcast-optimal two-round MPC
