scientific article; zbMATH DE number 503243
From MaRDI portal
Publication:4279565
Cited in
(56)- A proof of security of Yao's protocol for two-party computation
- General composition and universal composability in secure multiparty computation
- Fairness versus guaranteed output delivery in secure multiparty computation
- Task-structured probabilistic I/O automata
- Practical and provably secure release of a secret and exchange of signatures
- Secure two-party computation via cut-and-choose oblivious transfer
- Abstractions of non-interference security: probabilistic versus possibilistic
- Quantum verifiable protocol for secure modulo zero-sum randomness
- Concurrent signatures from a variety of keys
- On fully secure MPC with solitary output
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Security against covert adversaries: Efficient protocols for realistic adversaries
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Lower bounds and impossibility results for concurrent self composition
- Universally composable symbolic security analysis
- The reactive simulatability (RSIM) framework for asynchronous systems
- Unifying simulatability definitions in cryptographic systems under different timing assumptions
- Adaptive security of multi-party protocols, revisited
- Efficient set intersection with simulation-based security
- Simplified universal composability framework
- 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
- 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
- On complete primitives for fairness
- Adaptively Secure Two-Party Computation with Erasures
- Local Sequentiality Does Not Help for Concurrent Composition
- Partial fairness in secure two-party computation
- Communication-efficient distributed oblivious transfer
- Impossibility results for universal composability in public-key models and with fixed inputs
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Cryptography and cryptographic protocols
- A full proof of the BGW protocol for perfectly secure multiparty computation
- How to fairly reconstruct a shared secret
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Efficient Fully-Simulatable Oblivious Transfer
- Legally-Enforceable Fairness in Secure Two-Party Computation
- How to obtain full privacy in auctions
- Statistical Security Conditions for Two-Party Secure Function Evaluation
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- Soundness of Formal Encryption in the Presence of Key-Cycles
- 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)
- 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
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Resource fairness and composability of cryptographic protocols
- Can Alice and Bob guarantee output to Carol?
- Improved black-box constructions of composable secure computation
- On concrete security treatment of signatures based on multiple discrete logarithms
- Secure computation with penalties, revisited: how to handle coins with various colors
- Computationally secure pattern matching in the presence of malicious adversaries
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
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 Q4279565)
