Advertisement

On Generating Solved Instances of Computational Problems

  • Martín Abadi
  • Eric Allendert
  • Andrei Broder
  • Joan Feigenbaum
  • Lane A. Hemachandra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 403)

Abstract

We consider the efficient generation of solved instances of computational problems. In particular, we consider invulnerable generators. Let S be a subset of 0,1* and M be a Turing Machine that accepts S; an accepting computation w of M on input x is called a “witness” that xS. Informally, a program is an α-invulnerable generator if, on input 1n, it produces instance-witness pairs <x, w>, with |x| = n, according to a distribution under which any polynomial-time adversary who is given x fails to find a witness that xS, with probability at least α, for infinitely many lengths n.

Keywords

Constant Fraction Kolmogorov Complexity Satisfying Assignment Construction Problem Hard Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    M. Blum and S. Micali. “How to Generate Cryptographically Strong Sequences of Pseudo-random Bits,” SIAM J. on Comput. (13), 1984, 850–864.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [2]
    R. Boppana and R. Hirschfeld. “Pseudorandom Generators and Complexity Classes,” to appear in Advances in Computer Research, Silvio Micali (ed.), JAI Press (pub.), 1987.Google Scholar
  3. [3]
    G. Brassard and C. Crépeau. “Non-transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond,” Proceedings of the 27th FOCS, IEEE, 1986, 188–195.Google Scholar
  4. [4]
    G. Brassard and C. Crépeau. “Zero-Knowledge Simulation of Boolean Circuits,” Advances in Cryptology — CRYPTO86 Proceedings, Andrew Odlyzko (ed.), Springer-Verlag (pub.), 1987, 223–233.Google Scholar
  5. [5]
    G. Brassard, D. Chaum, and C. Crépeau. “Minimum Disclosure Proofs of Knowledge,” to appear.Google Scholar
  6. [6]
    U. Feige, A. Fiat, and A. Shamir. “Zero Knowledge Proofs of Identity,” Proceedings of the 19th STOC, ACM, 1987, 210–217.Google Scholar
  7. [7]
    Z. Galil, S. Haber, and M. Yung. “Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model,” Advances in Crytology — CRYPTO87 Proceedings, Carl Pomerance (ed.), Springer-Verlag (pub.), 1988, 135–155.Google Scholar
  8. [8]
    M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.Google Scholar
  9. [9]
    S. Goldwasser and S. Micali. “Probabilistic Encryption,” JCSS (28), 1984, 270–299.zbMATHMathSciNetGoogle Scholar
  10. [10]
    S. Goldwasser, S. Micali, and C. Rackoff. “The Knowledge Complexity of Interactive Proof Systems,” to appear in SIAM J. on Comput.Google Scholar
  11. [11]
    O. Goldreich, S. Micali, and A. Wigderson. “Proofs that Yield Nothing but their Validity and a Method of Cryptographic Protocol Design,” Proceedings of the 27 th FOCS, IEEE, 1986, 174–187.Google Scholar
  12. [12]
    Y. Gurevich. “Complete and Incomplete Randomized NP Problems,” Proceedings of the 28th FOCS, IEEE, 1987, 111–117.Google Scholar
  13. [13]
    J. Hartmanis. “Generalized Kolmogorov Complexity and the Structure of Feasible Computations,” Proceedings of the 24th FOCS, IEEE, 1983, 439–445.Google Scholar
  14. [14]
    M. Jerrum, L. Valiant, and V. Vazirani. “Random Generation of Combinatorial Structures from a Uniform Distribution,” TCS (43), 1986, 169–188.CrossRefzbMATHMathSciNetGoogle Scholar
  15. [15]
    D. Johnson. “The NP-Completeness Column, An Ongoing Guide,” JOA (5), 1984, 284–299.zbMATHGoogle Scholar
  16. [16]
    J. Lagarias and A. Oldlyzko. “Solving Low-Density Subset Sum Problems,” JACM (32), 1985, 229–246.CrossRefzbMATHGoogle Scholar
  17. [17]
    L. Levin. “Average Case Complete Problems,” SIAM J. on Comput. (15), 1986, 285–286.CrossRefzbMATHGoogle Scholar
  18. [18]
    R. Rardin, C. Tovey, and M. Pilcher. “Polynomial Constructability and Traveling Salesman Problems of Intermediate Complexity,” ONR-URI Computational Combinatorics Report CC-88-2, Purdue University, November, 1988.Google Scholar
  19. [19]
    S. Rudich, private communication.Google Scholar
  20. [20]
    L. Sanchis and M. Fulk. “Efficient Language Instance Generation”, University of Rochester Computer Science Department TR 235, 1988.Google Scholar
  21. [21]
    L. Sanchis. “Test Instance Construction for NP-hard Problems,” University of Rochester Computer Science Department TR 206, 1987.Google Scholar
  22. [22]
    R. Venkatesan and L. Levin. “Random Instances of a Graph Coloring Problem axe Hard,” Proceedings of the 20th STOC, ACM, 1988, 217–222.Google Scholar
  23. [23]
    A. C. Yao. “Theory and Applications of Trapdoor Functions,” Proceedings of the 23rd FOCS, IEEE, 1982, 80–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Martín Abadi
    • 1
  • Eric Allendert
    • 2
  • Andrei Broder
    • 1
  • Joan Feigenbaum
    • 3
  • Lane A. Hemachandra
    • 4
  1. 1.Columbia UniversityNew York
  2. 2.DEC Systems Research CenterPalo Alto
  3. 3.Rutgers UniversityNew Brunswick
  4. 4.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations