Guessing Two Secrets with Small Queries

Daniele Micciancio and Nathan Segerlind
CS2001-0687
November 14, 2001

We present an adaptice strategy to recover two secrets from an adversary which uses linear size queries and is computationally efficient. To obtain an intersecting family containing the two n bit secrets, 4n+3 queries are made, and time O(n^2) and space O(n) are consumed.


How to view this document


The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, techreports@cs.ucsd.edu.


[ Search ]


NCSTRL
This server operates at UCSD Computer Science and Engineering.
Send email to webmaster@cs.ucsd.edu