Encrypting Problem Instances: Or …, Can You Take Advantage of Someone Without Having to Trust Him?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 218 LNCS, Issue , 1986, Pages 477-488

  Feigenbaum, Joan ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ENCRYPTED DATA; PROBLEM INSTANCES;

CRYPTOGRAPHY;

EID: 85034638281     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39799-X_38     Document Type: Conference Paper

References (5)

1. Berman. Len and Juris Hartmanis. “On Isomorphisms and Density of NP- and otber Complete Sets”, SIAM J. on CompuL, 6 (2), 1977, 305-322.
2. Coppersmith, Don and Joan Feigenbaum. “Finite Graphs with Two Inequivalent Factorizations Under the Composition Operator”, IBM Research Report RC11149, 1985, submitted to Journal of Combinatorial Theory, Series B.
3. Feigenbaum, Joan and Alejandro A. Schäffer, “Recognizing Composite Graphs is Equivalent to Testing Graph Isomorphism”, to appear in SIAM J. on Comput.
4. Mahaney K, Stephen R. “On the Number of p-isomorphism Classes of NP- complete Sets”, Proc. 22nd Annual IEEE Symposium on the Foundations of Computer Science, 22, 1981, 271-278.
5. Plaisted, David. “Some Polynomial and Integer Divisibility Problems are NP-hard”, Proc. 17th Annual IEEE Symposium on the Foundations of Computer Sciencc, 17, 1976, 264-267.