Secure computation, I/O-efficient algorithms and distributed signatures

DOI10.1007/978-3-642-27954-6_18MaRDI QIDQ2890013zbMATH OpenOpenAlexFDO

Authors Jonas Kölker, Tomas Toft, Ivan B. Damgård

Publication date 8 June 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-27954-6_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
• Secure computation of the median (and other elements of specified ranks)
• Advances in Cryptology - EUROCRYPT 2004
• Towards efficient private distributed computation on unbounded input streams
• Efficient computations over encrypted data blocks

Cites work

• Atomic Secure Multi-party Multiplication with Low Communication
• Efficient signature generation by smart cards
• How to share a secret
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1759770 (Why is no real title available?)
• Optimally efficient multi-valued byzantine agreement
• Perfectly-Secure MPC with Linear Communication Complexity
• Randomized Shellsort, a simple oblivious sorting algorithm
• Secure computation, I/O-efficient algorithms and distributed signatures
• Secure multi-party computation without agreement
• Security of Ramp Schemes
• Theory of Cryptography

Cited in

(2)

• Secure computation, I/O-efficient algorithms and distributed signatures
• Techniques for Efficient Secure Computation Based on Yao’s Protocol

This page was built for publication: Secure computation, I/O-efficient algorithms and distributed signatures

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