Secure multiparty computation of approximations (extended abstract)

DOI10.1007/3-540-48224-5_75MaRDI QIDQ4535073zbMATH OpenFDO

Authors Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, M. Strauss

Publication date 12 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2076/20760927

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed algorithms (68W15) Approximation algorithms (68W25)

Recommendations

• Secure multiparty computation of approximations
• Efficient secure multi-party computation. (Extended Abstract)
• A new approach to round-optimal secure multiparty computation
• Secure multiparty computation with sublinear preprocessing
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• Tight bounds on the randomness complexity of secure multiparty computation
• The bottleneck complexity of secure multiparty computation
• Generalizing efficient multiparty computation

Cited in

(22)

• Private multiparty sampling and approximation of vector combinations
• Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
• Preface (to the special issue on general secure multiparty computation)
• A note on secure multiparty computation via higher residue symbols
• Multi-value private information retrieval with colluding databases via trace functions
• Secure multiparty computation with sublinear preprocessing
• Computer science and decision theory
• Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems
• Breaking the circuit size barrier for secure computation under DDH
• Secure multiparty computation of approximations
• An equational approach to secure multi-party computation
• Responses of Duffing oscillator with fractional damping and random phase
• Communication Locality in Secure Multi-party Computation
• Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
• Brief announcement: Zero-knowledge protocols for search problems
• Perfect \(L_p\) sampling in a data stream
• Theory of Cryptography
• Secure computation of the median (and other elements of specified ranks)
• Secure sampling with sublinear communication
• \textsf{Through the looking-glass}: benchmarking secure multi-party computation comparisons for \textsf{ReLU}'s
• On the security and privacy of CKKS-based homomorphic evaluation protocols
• On the privacy of sublinear-communication Jaccard index estimation via min-hash

This page was built for publication: Secure multiparty computation of approximations (extended abstract)

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