Publication:4035733
From MaRDI portal
zbMath0789.68044MaRDI QIDQ4035733
Publication date: 18 May 1993
reliability; secure multiparty computation; zero-knowledge proof systems; byzantine agreement; secure protocols; interactive computations; relative resilience; two-party oblivious circuit evaluation
Related Items
Cryptography and cryptographic protocols, Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries, Efficient Fully-Simulatable Oblivious Transfer, Statistical Security Conditions for Two-Party Secure Function Evaluation, Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model, Scalable Multi-party Private Set-Intersection, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, Conditional Reactive Simulatability, Fast large-scale honest-majority MPC for malicious adversaries, Must the communication graph of MPC protocols be an expander?, Correction to: ``Topology-hiding communication from minimal assumptions, Sok: vector OLE-based zero-knowledge protocols, Concurrently composable non-interactive secure computation, 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, Partial fairness in secure two-party computation, Impossibility results for universal composability in public-key models and with fixed inputs, A full proof of the BGW protocol for perfectly secure multiparty computation, Computationally secure pattern matching in the presence of malicious adversaries, Private multiparty sampling and approximation of vector combinations, A proof of security of Yao's protocol for two-party computation, General composition and universal composability in secure multiparty computation, Secure multiplication of shared secrets in the exponent, Distributed anonymous data perturbation method for privacy-preserving data mining, Fairness versus guaranteed output delivery in secure multiparty computation, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, Robust threshold DSS signatures, Secure two-party computation via cut-and-choose oblivious transfer, Constant-round maliciously secure two-party computation in the RAM model, What security can we achieve within 4 rounds?, Abstractions of non-interference security: probabilistic versus possibilistic, MPC with friends and foes, Reverse firewalls for actively secure MPCs, Obfuscation for cryptographic purposes, Security against covert adversaries: Efficient protocols for realistic adversaries, On black-box complexity of universally composable security in the CRS model, An efficient protocol for secure two-party computation in the presence of malicious adversaries, Lower bounds and impossibility results for concurrent self composition, GNUC: a new universal composability framework, Simplified Universal Composability Framework, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, What Security Can We Achieve Within 4 Rounds?, Compact and Efficient UC Commitments Under Atomic-Exchanges, Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity, Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions, Constant-Round Maliciously Secure Two-Party Computation in the RAM Model, Anonymous Communication and Anonymous Cash, Composable Security in the Bounded-Quantum-Storage Model, Oblivious Transfer Is Symmetric, Information-Theoretic Conditions for Two-Party Secure Function Evaluation, Adaptively Secure Two-Party Computation with Erasures, Local Sequentiality Does Not Help for Concurrent Composition
