On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions

Journal of Cryptology- United States

doi 10.1007/s00145-005-0419-9

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Nature

Related search

Universally Composable Undeniable Signature

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Universally Composable Key-Evolving Signature

2007English

On the Boundedness of the Feasible Set Without Convexity Assumptions

International Economic Review
EconomicsEconometrics
1973English

Universally Composable Notions of Key Exchange and Secure Channels

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Secure Two-Party Computation Over Unreliable Channels

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Efficiently Making Secure Two-Party Computation Fair

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Information Theoretical Analysis of Two-Party Secret Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Hiding the Input-Size in Secure Two-Party Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy