Statistical Security Conditions for Two-Party Secure Function Evaluation

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-85093-9_9
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

A Full Characterization of Completeness for Two-Party Randomized Function Evaluation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

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

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

Secure Certificateless Two-Party Key Agreement With Short Message

Information Technology and Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2016English

Towards Characterizing Complete Fairness in Secure Two-Party Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Secure Equality Testing Protocols in the Two-Party Setting

2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy