New Monotones and Lower Bounds in Unconditional Two-Party Computation

• Published in: IEEE transactions on information theory Vol. 54; no. 6; pp. 2792 - 2797
• Main Authors: Wolf, S., Wullschleger, J.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-06-2008; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Computation; Computer science; Computer security; Information; Information security; Information theory; Lower bounds; Mathematics; monotones; oblivious transfer; Protocol; Public key; Public key cryptography; Reduction; Secure storage; two-party computation; unconditional security
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2008.921674

Since oblivious transfer, a primitive of paramount importance in secure two- and multiparty computation, cannot be realized in an unconditionally secure way for both parties from scratch, reductions to weak information-theoretic primitives as well as between different variants of the functionality are of great interest. In this context, various monotones-quantities that cannot be increased by any protocol-are introduced and then used to derive lower bounds on the possibility and efficiency of such reductions.