Security against covert adversaries: Efficient protocols for realistic adversaries

DOI10.1007/S00145-009-9040-7zbMath1181.94091OpenAlexW2118179522MaRDI QIDQ2267365

Yonatan Aumann, Yehuda Lindell

Publication date: 1 March 2010

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

Full work available at URL: https://doi.org/10.1007/s00145-009-9040-7

zbMATH Keywords

secure two-party computationsimulation paradigmcovert adversariesefficient constructions

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (16)

Fast cut-and-choose-based protocols for malicious and covert adversaries ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ More efficient oblivious transfer extensions ⋮ Secure two-party computation via cut-and-choose oblivious transfer ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ High Performance, Low Energy, and Trustworthy Blockchains Using Satellites ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load ⋮ What security can we achieve within 4 rounds? ⋮ From fairness to full security in multiparty computation ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ What Security Can We Achieve Within 4 Rounds?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Session-key generation using human passwords only
• A proof of security of Yao's protocol for two-party computation
• Quantifying knowledge complexity
• Security and composition of multiparty cryptographic protocols
• Secure multi-party computation without agreement
• Secure computation with honest-looking parties (extended abstract)
• Authenticated Algorithms for Byzantine Agreement
• Covert two-party computation
• A Framework for Efficient and Composable Oblivious Transfer
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Advances in Cryptology - CRYPTO 2003
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Efficient Two-Party Secure Computation on Committed Inputs

This page was built for publication: Security against covert adversaries: Efficient protocols for realistic adversaries