Information Theoretical Analysis of Two-Party Secret Computation

Lecture Notes in Computer Science - Germany
doi 10.1007/11805588_22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Efficiently Making Secure Two-Party Computation Fair

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Secure Two-Party Computation Over Unreliable Channels

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Fundamental Two-Party Quantum Secret Sharing Protocol Without Quantum Entanglement

International Journal of Security and its Applications
Computer Science
2015English

Faster Secure Two-Party Computation With Less Memory

2013English

Efficient Secure Two-Party Computation Against Malicious Adversaries

English

Hiding the Input-Size in Secure Two-Party Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Towards Characterizing Complete Fairness in Secure Two-Party Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The All-Or-Nothing Nature of Two-Party Secure Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Fast and Maliciously Secure Two-Party Computation Using the GPU

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy