A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture

Authors:
Jeff Kahn;Michael Saks;Cliff Smyth
Affiliations:
-;-;-
Venue:
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
Year:
2000

Citing 0
Cited 11

Reimer's inequality and tardos' conjecture

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Lower bounds on the efficiency of encryption and digital signature schemes

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Towards a separation of semantic and CCA security for public key encryption

TCC'07 Proceedings of the 4th conference on Theory of cryptography
The dual bkr inequality and rudich's conjecture

Combinatorics, Probability and Computing
On black-box separations among injective one-way functions

TCC'11 Proceedings of the 8th conference on Theory of cryptography
The equivalence of the random oracle model and the ideal cipher model, revisited

Proceedings of the forty-third annual ACM symposium on Theory of computing
Approximate Query Complexity

ACM Transactions on Computation Theory (TOCT)
On hardness amplification of one-way functions

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Limits on the usefulness of random oracles

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove a dual version of the celebrated inequality of D. Reimer (a.k.a. the van den Berg-Kesten conjecture). We use the dual inequality to prove a combinatorial conjecture of S. Rudich motivated by questions in cryptographic complexity. One consequence of Rudich's Conjecture is that there is an oracle relative to which one-way functions exist but one-way permutations do not. The dual inequality has another combinatorial consequence which allows R. Impagliazzo and S. Rudich to prove that if P = NP then NP intersect coNP is a subset of i.o.AvgP relative to a random oracle.