Title :
Constructive separation of classes of indistinguishable ensembles
Author_Institution :
Fachbereich 14 Inf., Saarlandes Univ., Saarbrucken, Germany
fDate :
28 Jun- 1 Jul 1994
Abstract :
We construct ensembles that separate the classes of algorithmically, circuit, statistically, and perfect indistinguishable ensembles without cryptographic assumptions and present a generally usable technique for efficient deterministic simulation of resource bounded probabilistic Turing machines
Keywords :
Turing machines; computational complexity; cryptography; probabilistic logic; theorem proving; algorithmic; circuit; cryptographic assumptions; deterministic simulation; indistinguishable ensembles; resource bounded probabilistic Turing machines; statistically; theorem proving; Circuit simulation; Computational modeling; Cryptographic protocols; Cryptography; Distributed computing; Information security; Integrated circuit modeling; Turing machines;
Conference_Titel :
Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual
Conference_Location :
Amsterdam
Print_ISBN :
0-8186-5670-0
DOI :
10.1109/SCT.1994.315804
