Two-Party Computing with Encrypted Data

DOI10.1007/978-3-540-76900-2_18MaRDI QIDQ5387106zbMATH OpenOpenAlexFDO

Authors Seung Geol Choi, Ariel Elbaz, Ari Juels, Tal Malkin, Moti Yung

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_18

zbMATH Keywords

Computing with Encrypted DataCryptoComputingoblivious transferSecure Two-Party Computation

Mathematics Subject Classification ID

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

Recommendations

• Secure multi-party computation minimizing online rounds
• Efficient computations over encrypted data blocks
• scientific article; zbMATH DE number 3952653
• Secure computation on the web: computing without simultaneous interaction
• A minimal model for secure computation (extended abstract)

Cited in

(4)

• Generic plaintext equality and inequality proofs
• On black-box extension of a non-interactive zero-knowledge proof system for secret equality
• scientific article; zbMATH DE number 4191075 (Why is no real title available?)
• Covert two-party computation

This page was built for publication: Two-Party Computing with Encrypted Data

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