Skip to main content
Download PDF
- Main
Guessing Two Secrets with Small Queries
Abstract
We present an adaptive 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.
Pre-2018 CSE ID: CS2001-0687
Main Content
For improved accessibility of PDF content, download the file to your device.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%