What security can we achieve within 4 rounds?

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
How to share a secret
A public key cryptosystem and a signature scheme based on discrete logarithms
Security and composition of multiparty cryptographic protocols
Efficient oblivious transfer protocols
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
Multiparty Computation from Somewhat Homomorphic Encryption
A New Approach to Practical Active-Secure Two-Party Computation
On the Composition of Zero-Knowledge Proof Systems
A Framework for Efficient and Composable Oblivious Transfer
Security against covert adversaries: Efficient protocols for realistic adversaries
Semi-homomorphic Encryption and Multiparty Computation
Foundations of Cryptography
Advances in Cryptology – CRYPTO 2004
Partial Fairness in Secure Two-Party Computation
An Optimally Fair Coin Toss
Smooth projective hashing and two-message oblivious transfer
New notions of security
The Exact Round Complexity of Secure Computation
Zero-Knowledge Proofs from Secure Multiparty Computation
Fast distributed RSA key generation for semi-honest and malicious adversaries
Low cost constant round MPC combining BMR and oblivious transfer
A “Paradoxical” Solution to The Signature Problem
How to Use Bitcoin to Design Fair Protocols
Black-Box Constructions of Two-Party Protocols from One-Way Functions
Two-round multiparty secure computation from minimal assumptions
\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
Four round secure computation without setup
Round-optimal secure two-party computation from trapdoor permutations
Round optimal concurrent MPC via strong simulation
Promise zero knowledge and its applications to round optimal MPC
Adaptive hardness and composable security in the plain model from standard assumptions
Efficient Non-interactive Secure Computation
Round-Optimal Black-Box Two-Party Computation
Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
Round-optimal secure multi-party computation
A new approach to round-optimal secure multiparty computation
Black-Box Constructions of Protocols for Secure Computation
How fair is your protocol? A utility-based approach to protocol optimality
From Weak to Strong Zero-Knowledge and Applications

Cited In (1)

What Security Can We Achieve Within 4 Rounds?

Recommendations

4-Round Resettably-Sound Zero Knowledge 👍 👎
Which Languages Have 4-Round Zero-Knowledge Proofs? 👍 👎
Which languages have 4-round zero-knowledge proofs? 👍 👎
Four round secure computation without setup 👍 👎
What Security Can We Achieve Within 4 Rounds? 👍 👎
Is Your Security Protocol on Time ? 👍 👎

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)