2000 character limit reached
The Impossibility Of Secure Two-Party Classical Computation
Published 21 Aug 2007 in quant-ph and cs.CR | (0708.2843v2)
Abstract: We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the impossibility of oblivious transfer.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.