A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations

DOI10.1007/978-3-319-21356-9_11zbMath1401.94144MaRDI QIDQ2947113

Özgür Dagdelen, Daniele Venturi

Publication date: 21 September 2015

Published in: Cryptography and Information Security in the Balkans (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21356-9_11

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Rate-limited secure function evaluation, A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations

Cites Work

• Unnamed Item
• Secure distributed key generation for discrete-log based cryptosystems
• Efficient secure two-party protocols. Techniques and constructions
• Oblivious transfer and polynomial evaluation
• Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
• Semi-homomorphic Encryption and Multiparty Computation
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• A Framework for Efficient and Composable Oblivious Transfer
• Scalable and Unconditionally Secure Multiparty Computation
• Rate-Limited Secure Function Evaluation: Definitions and Constructions
• Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Advances in Cryptology - CRYPTO 2003
• Scalable Secure Multiparty Computation