Decompositions of graphs of functions and fast iterations of lookup tables
Discrete Applied Mathematics
Feistel Networks Made Public, and Applications
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Implementing Huge Sparse Random Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Efficiently constructible huge graphs that preserve first order properties of random graphs
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Upper and lower bounds on black-box steganography
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
| Hi-index | 0.00 |
We initiate a general study of pseudo-random implementations ofhuge random objects, and apply it to a few areas in which randomobjects occur naturally. For example, a random object beingconsidered may be a random connected graph, a random bounded-degreegraph, or a random error-correcting code with good distance. Apseudo-random implementation of such type T objects must generateobjects of type T that can not be distinguished from random ones,rather than objects that can not be distinguished from typeTobjects (although they are not type T at all). We will model a typeT object as a function, and access objects by queries into thesefunctions. We investigate supporting both standard queries thatonly evaluates the primary function at locations of the user'schoice (e.g., edge queries in a graph), and complex queries thatmay ask for the result of a computation on the primary function,where this computation is infeasible to perform with a polynomialnumber of standard queries (e.g., providing the next vertex along aHamiltonian path in the graph).