scientific article; zbMATH DE number 503243
From MaRDI portal
Publication:4279565
zbMath0800.68459MaRDI QIDQ4279565
Publication date: 20 September 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (51)
Efficient set intersection with simulation-based security ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Toward a game theoretic view of secure computation ⋮ Concurrent signatures from a variety of keys ⋮ Practical and provably secure release of a secret and exchange of signatures ⋮ On fully secure MPC with solitary output ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ Concurrently composable non-interactive secure computation ⋮ Partial fairness in secure two-party computation ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ Universally composable symbolic security analysis ⋮ Adaptive security of multi-party protocols, revisited ⋮ Communication-efficient distributed oblivious transfer ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Resource fairness and composability of cryptographic protocols ⋮ Cryptography and cryptographic protocols ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Task-structured probabilistic I/O automata ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Abstractions of non-interference security: probabilistic versus possibilistic ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ Simplified Universal Composability Framework ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ Legally-Enforceable Fairness in Secure Two-Party Computation ⋮ Adaptively Secure Two-Party Computation with Erasures ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ A proof of security of Yao's protocol for two-party computation ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Legally Fair Contract Signing Without Keystones ⋮ General composition and universal composability in secure multiparty computation ⋮ How to fairly reconstruct a shared secret ⋮ How to obtain full privacy in auctions ⋮ On Complete Primitives for Fairness ⋮ Statistical Security Conditions for Two-Party Secure Function Evaluation ⋮ Quantum verifiable protocol for secure modulo zero-sum randomness ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles ⋮ Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
This page was built for publication:
