메뉴 건너뛰기




Volumn , Issue , 2006, Pages 719-728

On the compressibility of N P instances and cryptographic applications

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DECISION MAKING; NETWORK PROTOCOLS; PROBLEM SOLVING;

EID: 38749087238     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.54     Document Type: Conference Paper
Times cited : (26)

References (44)
  • 1
    • 26844436507 scopus 로고    scopus 로고
    • NP-complete problems and physical reality
    • S. Aaronson. NP-complete problems and physical reality. SIGACTNews, 36(1):30-52, 2005.
    • (2005) SIGACTNews , vol.36 , Issue.1 , pp. 30-52
    • Aaronson, S.1
  • 3
    • 0035166072 scopus 로고    scopus 로고
    • How to go beyond the black-box simulation barrier
    • B. Barak. How to go beyond the black-box simulation barrier. In 42nd FOCS, pages 106-115, 2001.
    • (2001) 42nd FOCS , pp. 106-115
    • Barak, B.1
  • 4
    • 35048832490 scopus 로고    scopus 로고
    • An uninstantiable random-oracle-model scheme for a hybrid-encryption problem
    • EUROCRYPT, Springer
    • M. Bellare, A. Boldyreva, and A. Palacio. An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In EUROCRYPT ' 2004, LNCS, volume 3027, pages 171-188. Springer, 2004.
    • (2004) LNCS , vol.3027 , pp. 171-188
    • Bellare, M.1    Boldyreva, A.2    Palacio, A.3
  • 5
    • 4243180376 scopus 로고    scopus 로고
    • The random oracle methodology, revisited
    • R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. Journal of the ACM, 51(4):557-594, 2004.
    • (2004) Journal of the ACM , vol.51 , Issue.4 , pp. 557-594
    • Canetti, R.1    Goldreich, O.2    Halevi, S.3
  • 6
    • 85059770931 scopus 로고
    • The complexity of theorem-proving procedures
    • S. Cook. The complexity of theorem-proving procedures. In 3rd STOC, pages 151-158, 1971.
    • (1971) 3rd STOC , pp. 151-158
    • Cook, S.1
  • 7
    • 84981199109 scopus 로고
    • A design principle for hash functions
    • CRYPTO '89, Springer
    • I. Damgård. A design principle for hash functions. In CRYPTO '89, LNCS, volume 435, pages 416-421. Springer, 1989.
    • (1989) LNCS , vol.435 , pp. 416-421
    • Damgård, I.1
  • 8
    • 85016692748 scopus 로고
    • On the existence of statistically hiding bit commitment schemes and fail-stop signatures
    • CRYPTO '93, Springer
    • I. Damgård, T Pedersen, and B. Pfitzmann. On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In CRYPTO '93, LNCS, volume 773, pages 250-265. Springer, 1993.
    • (1993) LNCS , vol.773 , pp. 250-265
    • Damgård, I.1    Pedersen, T.2    Pfitzmann, B.3
  • 10
    • 84937431717 scopus 로고    scopus 로고
    • Hyper-encryption and everlasting security
    • Y Ding and M. Rabin. Hyper-encryption and everlasting security. In STACS, LNCS, volume 2285, pages 1-26, 2002.
    • (2002) STACS, LNCS , vol.2285 , pp. 1-26
    • Ding, Y.1    Rabin, M.2
  • 11
    • 33748103149 scopus 로고    scopus 로고
    • The PCP theorem by gap amplification
    • I. Dinur. The PCP theorem by gap amplification. In 38th STOC, pages 241-250, 2006.
    • (2006) 38th STOC , pp. 241-250
    • Dinur, I.1
  • 13
    • 33748094970 scopus 로고    scopus 로고
    • On the randomness complexity of efficient sampling
    • B. Dubrov and Y Ishai. On the randomness complexity of efficient sampling. In 38th STOC, pages 711-720, 2006.
    • (2006) 38th STOC , pp. 711-720
    • Dubrov, B.1    Ishai, Y.2
  • 14
    • 0029720071 scopus 로고    scopus 로고
    • Digital signets: Self-enforcing protection of digital information
    • C. Dwork, J. Lotspiech, and M. Naor. Digital signets: Self-enforcing protection of digital information. In 28th STOC, pages 489-498, 1996.
    • (1996) 28th STOC , pp. 489-498
    • Dwork, C.1    Lotspiech, J.2    Naor, M.3
  • 15
    • 38749125316 scopus 로고    scopus 로고
    • On the forward-secure storage. To appear in
    • S. Dziembowski. On the forward-secure storage. To appear in CRYPTO, 2006.
    • (2006) CRYPTO
    • Dziembowski, S.1
  • 16
    • 35048832981 scopus 로고    scopus 로고
    • On generating the initial key in the bounded-storage model
    • EUROCRYPT, Springer
    • S. Dziembowski and U. Maurer. On generating the initial key in the bounded-storage model. In EUROCRYPT ' 2004, LNCS, volume 3027, pages 126-137. Springer, 2004.
    • (2004) LNCS , vol.3027 , pp. 126-137
    • Dziembowski, S.1    Maurer, U.2
  • 18
    • 0344550529 scopus 로고    scopus 로고
    • On the (in)security of the Fiat-Shamir paradigm
    • S. Goldwasser and Y. Tauman Kalai. On the (in)security of the Fiat-Shamir paradigm. In 44th FOCS, pages 102-111, 2003.
    • (2003) 44th FOCS , pp. 102-111
    • Goldwasser, S.1    Tauman Kalai, Y.2
  • 19
    • 24944462872 scopus 로고    scopus 로고
    • Reducing complexity assumptions for statistically-hiding commitment
    • EUROCRYPT, Springer
    • I. Haitner, O. Horvitz, J. Katz, C. Koo, R. Morselli, and R. Shaltiel. Reducing complexity assumptions for statistically-hiding commitment. In EUROCRYPT ' 2005, LNCS, volume 3494, pages 58-77. Springer, 2005.
    • (2005) LNCS , vol.3494 , pp. 58-77
    • Haitner, I.1    Horvitz, O.2    Katz, J.3    Koo, C.4    Morselli, R.5    Shaltiel, R.6
  • 20
    • 33746364208 scopus 로고    scopus 로고
    • On everlasting security in the hybrid bounded storage model
    • 33rd ICALP 2006, Part II, Springer
    • D. Harnik and M. Naor. On everlasting security in the hybrid bounded storage model. In 33rd ICALP 2006, Part II, LNCS, volume 4052, pages 192-203. Springer, 2006.
    • (2006) LNCS , vol.4052 , pp. 192-203
    • Harnik, D.1    Naor, M.2
  • 21
    • 38749110570 scopus 로고    scopus 로고
    • D. Harnik and M. Naor. On the compressibility of NP instances and cryptographic applications. In ECCC, TR06-022, 2006.
    • D. Harnik and M. Naor. On the compressibility of NP instances and cryptographic applications. In ECCC, TR06-022, 2006.
  • 23
    • 33745848493 scopus 로고    scopus 로고
    • Finding collisions on a public road, or do secure hash functions need secret coins?
    • CRYPTO '04, Springer
    • C. Hsiao and L. Reyzin. Finding collisions on a public road, or do secure hash functions need secret coins? In CRYPTO '04, LNCS, volume 3152, pages 92-105. Springer, 2004.
    • (2004) LNCS , vol.3152 , pp. 92-105
    • Hsiao, C.1    Reyzin, L.2
  • 25
    • 0032308058 scopus 로고    scopus 로고
    • Which problems have strongly exponential complexity?
    • R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? In 39th FOCS, pages 653-663, 1998.
    • (1998) 39th FOCS , pp. 653-663
    • Impagliazzo, R.1    Paturi, R.2    Zane, F.3
  • 26
    • 0024866742 scopus 로고
    • Limits on the provable consequences of one-way permutations
    • R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In 21st STOC, pages 44-61, 1989.
    • (1989) 21st STOC , pp. 44-61
    • Impagliazzo, R.1    Rudich, S.2
  • 27
    • 24144497043 scopus 로고    scopus 로고
    • Sufficient conditions for collision-resistant hashing
    • TCC '05, of
    • Y. Ishai, E. Kushilevitz, and R. Ostrovsky:. Sufficient conditions for collision-resistant hashing. In TCC '05, volume 3378 of LNCS, pages 445-456, 2005.
    • (2005) LNCS , vol.3378 , pp. 445-456
    • Ishai, Y.1    Kushilevitz, E.2    Ostrovsky, R.3
  • 28
    • 0026963441 scopus 로고
    • A note on efficient zero-knowledge proofs and arguments
    • J. Kilian. A note on efficient zero-knowledge proofs and arguments. In 24th STOC, pages 723-732, 1992.
    • (1992) 24th STOC , pp. 723-732
    • Kilian, J.1
  • 29
    • 0002716212 scopus 로고
    • Refining nondeterminism in relativized polynomial-time bounded computations
    • C. Kintala and P. Fischer. Refining nondeterminism in relativized polynomial-time bounded computations. SIAM Journal of Computing, 9(1):46-53, 1980.
    • (1980) SIAM Journal of Computing , vol.9 , Issue.1 , pp. 46-53
    • Kintala, C.1    Fischer, P.2
  • 31
    • 0026698501 scopus 로고
    • Conditionally-perfect secrecy and a provablysecure randomized cipher
    • U. Maurer. Conditionally-perfect secrecy and a provablysecure randomized cipher. Journal of Cryptology, 5(1):53-66, 1992.
    • (1992) Journal of Cryptology , vol.5 , Issue.1 , pp. 53-66
    • Maurer, U.1
  • 32
    • 0002597886 scopus 로고
    • CS proofs
    • S. Micali. CS proofs. In 35th FOCS, pages 436-453, 1994.
    • (1994) 35th FOCS , pp. 436-453
    • Micali, S.1
  • 33
    • 0001448484 scopus 로고
    • Bit commitment using pseudorandomness
    • M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
    • (1991) Journal of Cryptology , vol.4 , Issue.2 , pp. 151-158
    • Naor, M.1
  • 34
    • 35248818856 scopus 로고    scopus 로고
    • On cryptographic assumptions and challenges
    • CRYPTO '03, Springer
    • M. Naor. On cryptographic assumptions and challenges. In CRYPTO '03, LNCS, volume 2729, pages 96-109. Springer, 2003.
    • (2003) LNCS , vol.2729 , pp. 96-109
    • Naor, M.1
  • 35
    • 0141544069 scopus 로고    scopus 로고
    • Perfect zero-knowledge arguments for NP using any one-way permutation
    • M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology, 11(2):87-108, 1998.
    • (1998) Journal of Cryptology , vol.11 , Issue.2 , pp. 87-108
    • Naor, M.1    Ostrovsky, R.2    Venkatesan, R.3    Yung, M.4
  • 36
    • 0024867751 scopus 로고
    • Universal one-way hash functions and their cryptographic applications
    • M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st STOC, pages 33-43, 1989.
    • (1989) 21st STOC , pp. 33-43
    • Naor, M.1    Yung, M.2
  • 37
    • 84937420653 scopus 로고    scopus 로고
    • Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case
    • CRYPTO '02, Springer
    • J. Nielsen. Separating random oracle proofs from complexity theoretic proofs: The non-committing encryption case. In CRYPTO '02, LNCS, volume 2442, pages 111-126. Springer, 2002.
    • (2002) LNCS , vol.2442 , pp. 111-126
    • Nielsen, J.1
  • 39
    • 84898928682 scopus 로고
    • Optimization, approximation, and complexity classes
    • C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. In 20th STOC, pages 229-234, 1988.
    • (1988) 20th STOC , pp. 229-234
    • Papadimitriou, C.1    Yannakakis, M.2
  • 40
    • 0030262302 scopus 로고    scopus 로고
    • On limited nondeterminism and the complexity of the V-C dimension
    • C. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. JCSS, 53(2):161-170, 1996.
    • (1996) JCSS , vol.53 , Issue.2 , pp. 161-170
    • Papadimitriou, C.1    Yannakakis, M.2
  • 41
    • 84957690790 scopus 로고    scopus 로고
    • Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?
    • EUROCRYPT, Springer
    • D. Simon. Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In EUROCRYPT ' 1998, LNCS, volume 1403, pages 334-345. Springer, 1998.
    • (1998) LNCS , vol.1403 , pp. 334-345
    • Simon, D.1
  • 44
    • 33745541383 scopus 로고    scopus 로고
    • On obfuscating point functions
    • H. Wee. On obfuscating point functions. In 37th STOC, pages 523-532, 2005.
    • (2005) 37th STOC , pp. 523-532
    • Wee, H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.