What security can we achieve within 4 rounds?
From MaRDI portal
(Redirected from Publication:2010586)
Recommendations
Cites work
- scientific article; zbMATH DE number 4057443 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1842491 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A new approach to practical active-secure two-party computation
- A new approach to round-optimal secure multiparty computation
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A “Paradoxical” Solution to The Signature Problem
- Adaptive hardness and composable security in the plain model from standard assumptions
- Advances in Cryptology – CRYPTO 2004
- An Optimally Fair Coin Toss
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Black-box constructions of protocols for secure computation
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient non-interactive secure computation
- Efficient oblivious transfer protocols
- Fast distributed RSA key generation for semi-honest and malicious adversaries
- Foundations of Cryptography
- Four round secure computation without setup
- From weak to strong zero-knowledge and applications
- How fair is your protocol? A utility-based approach to protocol optimality
- How to share a secret
- How to use bitcoin to design fair protocols
- Low cost constant round MPC combining BMR and oblivious transfer
- Multiparty Computation from Somewhat Homomorphic Encryption
- New notions of security: achieving universal composability without trusted setup
- On the Composition of Zero-Knowledge Proof Systems
- Partial fairness in secure two-party computation
- Promise zero knowledge and its applications to round optimal MPC
- Round optimal concurrent MPC via strong simulation
- Round-optimal black-box two-party computation
- Round-optimal secure multi-party computation
- Round-optimal secure two-party computation from trapdoor permutations
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Security and composition of multiparty cryptographic protocols
- Semi-homomorphic encryption and multiparty computation
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Smooth projective hashing and two-message oblivious transfer
- The Exact Round Complexity of Secure Computation
- Two-round multiparty secure computation from minimal assumptions
- Zero-knowledge proofs from secure multiparty computation
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
Cited in
(4)
This page was built for publication: What security can we achieve within 4 rounds?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010586)
