Multi-party Indirect Indexing and Applications

DOI10.1007/978-3-540-76900-2_17MaRDI QIDQ5387105zbMATH OpenOpenAlexFDO

Authors Matthew Franklin, Mark Gondree, Payman Mohassel

Publication date 15 May 2008

Published in Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-76900-2_17

zbMATH Keywords

communication complexityoblivious RAM machineprivacy-preserving protocolssecure multiparty computation

Mathematics Subject Classification ID

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

Recommendations

• Secure multiparty RAM computation in constant rounds
• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Secure multiparty computation with free branching
• scientific article; zbMATH DE number 1808209
• Multi-party computation of polynomials and branching programs without simultaneous interaction

Cited in

(2)

• Private multiparty sampling and approximation of vector combinations
• Communication-Efficient Private Protocols for Longest Common Subsequence

This page was built for publication: Multi-party Indirect Indexing and Applications

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