scientific article
From MaRDI portal
Publication:4035733
zbMath0789.68044MaRDI QIDQ4035733
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reliabilitysecure multiparty computationzero-knowledge proof systemsbyzantine agreementsecure protocolsinteractive computationsrelative resiliencetwo-party oblivious circuit evaluation
Related Items (54)
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 ⋮ Anonymous Communication and Anonymous Cash ⋮ 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 ⋮ Compact and Efficient UC Commitments Under Atomic-Exchanges ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ Correction to: ``Topology-hiding communication from minimal assumptions ⋮ Sok: vector OLE-based zero-knowledge protocols ⋮ Lower bounds and impossibility results for concurrent self composition ⋮ Concurrently composable non-interactive secure computation ⋮ Oblivious transfer with constant computational overhead ⋮ Partial fairness in secure two-party computation ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ Composable Security in the Bounded-Quantum-Storage Model ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Cryptography and cryptographic protocols ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Scalable Multi-party Private Set-Intersection ⋮ Constant-round maliciously secure two-party computation in the RAM model ⋮ What security can we achieve within 4 rounds? ⋮ Obfuscation for cryptographic purposes ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Oblivious Transfer Is Symmetric ⋮ Information-Theoretic Conditions for Two-Party Secure Function Evaluation ⋮ 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 ⋮ GNUC: a new universal composability framework ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ 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 ⋮ Private multiparty sampling and approximation of vector combinations ⋮ A proof of security of Yao's protocol for two-party computation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ General composition and universal composability in secure multiparty computation ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Secure multiplication of shared secrets in the exponent ⋮ Distributed anonymous data perturbation method for privacy-preserving data mining ⋮ Statistical Security Conditions for Two-Party Secure Function Evaluation ⋮ MPC with friends and foes ⋮ Reverse firewalls for actively secure MPCs ⋮ Robust threshold DSS signatures ⋮ Conditional Reactive Simulatability ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries
This page was built for publication:
