scientific article; zbMATH DE number 176562
From MaRDI portal
Publication:4035733
Recommendations
Cited in
(67)- 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
- A theoretical and empirical evaluation of an algorithm for self-healing computation
- 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
- Security and composition of multiparty cryptographic protocols
- 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
- Efficient set intersection with simulation-based security
- Simplified universal composability framework
- Adaptive hardness and composable security in the plain model from standard assumptions
- What Security Can We Achieve Within 4 Rounds?
- Automata evaluation and text search protocols with simulation-based security
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Compact and efficient UC commitments under atomic-exchanges
- Executable proofs, input-size hiding secure computation and a new ideal world
- Innovations in computer science -- ICS 2010, Tsinghua University, Beijing, China, January 7--9, 2011. Proceedings
- 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
- scientific article; zbMATH DE number 4191076 (Why is no real title available?)
- Anonymous communication and anonymous cash
- Composable Security in the Bounded-Quantum-Storage Model
- An Architecture for Provably Secure Computation
- 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
- Partial fairness in secure two-party computation
- scientific article; zbMATH DE number 1304184 (Why is no real title available?)
- Impossibility results for universal composability in public-key models and with fixed inputs
- scientific article; zbMATH DE number 1406798 (Why is no real title available?)
- scientific article; zbMATH DE number 1418292 (Why is no real title available?)
- Cryptography and cryptographic protocols
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Secure computation on the web: computing without simultaneous interaction
- 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
- Conditional reactive simulatability
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Correction to: ``Topology-hiding communication from minimal assumptions
- Sok: vector OLE-based zero-knowledge protocols
- Fast large-scale honest-majority MPC for malicious adversaries
- Must the communication graph of MPC protocols be an expander?
- Concurrently composable non-interactive secure computation
- Oblivious transfer with constant computational overhead
- Security in Asynchronous Interactive Systems
- Improved black-box constructions of composable secure computation
- Peeking into the future: MPC resilient to super-rushing adversaries
- Computationally secure pattern matching in the presence of malicious adversaries
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035733)
