What security can we achieve within 4 rounds?

DOI10.1007/S00145-019-09323-1MaRDI QIDQ2010586zbMATH OpenOpenAlexFDO

Authors Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

Publication date 27 November 2019

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-019-09323-1

zbMATH Keywords

round complexitysecure computationcoin-tossingoblivious-transfer

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

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

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)

• From privacy-only to simulatable OT: black-box, round-optimal, information-theoretic
• Round-optimal secure two-party computation from trapdoor permutations
• What Security Can We Achieve Within 4 Rounds?
• On secure two-party computation in three rounds

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)