Secure computation from millionaire

DOI10.1007/978-3-662-48797-6_30MaRDI QIDQ2811153zbMATH OpenOpenAlexFDO

Authors Abhi Shelat, Muthuramakrishnan Venkitasubramaniam

Publication date 10 June 2016

Published in Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48797-6_30

zbMATH Keywords

greedy algorithmssecure computationsemi-honestcovert security

Mathematics Subject Classification ID

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

Recommendations

• Communication preserving protocols for secure function evaluation
• Secure computation of the median (and other elements of specified ranks)
• Information Security and Cryptology
• Techniques for Efficient Secure Computation Based on Yao’s Protocol
• Secure multiparty computation without one-way functions

Cited in

(7)

• Theory of Cryptography
• Scalable multi-party private set-intersection
• Secure computation of the \(k^{\text{th}}\)-ranked element in a star network
• Information Security and Cryptology
• Secure computation on the web: computing without simultaneous interaction
• Advances in Cryptology - EUROCRYPT 2004
• Secure computation of the median (and other elements of specified ranks)

This page was built for publication: Secure computation from millionaire

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811153)