메뉴 건너뛰기




Volumn , Issue , 2002, Pages 12-21

A fault-tolerant approach to secure information retrieval

Author keywords

Distributed database systems; Fault tolerance; Malicious faults; Private information retrieval; Secret sharing; Security

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; DATA STORAGE EQUIPMENT; DISTRIBUTED DATABASE SYSTEMS; INFORMATION RETRIEVAL; PROBABILISTIC LOGICS; SECURITY OF DATA; SERVERS;

EID: 0036446274     PISSN: 10609857     EISSN: None     Source Type: Journal    
DOI: 10.1109/RELDIS.2002.1180169     Document Type: Article
Times cited : (8)

References (23)
  • 1
    • 84951063457 scopus 로고    scopus 로고
    • Upper bound on the communication complexity of private information retrieval
    • th Int'l Colloquium on Automata, Languages and Programming (ICALP'97), Springer-Verlag, Bologna, Italy, July
    • th Int'l Colloquium on Automata, Languages and Programming (ICALP'97), LNCS, vol. 1256, Springer-Verlag, Bologna, Italy, July 1997, pp. 401-407.
    • (1997) LNCS , vol.1256 , pp. 401-407
    • Ambainis, A.1
  • 2
    • 33745511846 scopus 로고
    • Hiding instances in multioracle queries
    • th Ann. Symposium on Theoretical Aspects of Computer Science (STACS'90), Rouen, France, Springer-Verlag, Feb
    • th Ann. Symposium on Theoretical Aspects of Computer Science (STACS'90), Rouen, France, LNCS, vol. 415, Springer-Verlag, Feb. 1990, pp. 37-48.
    • (1990) LNCS , vol.415 , pp. 37-48
    • Beaver, D.1    Feigenbaum, J.2
  • 3
    • 84879524288 scopus 로고    scopus 로고
    • Information-theoretic private information retrieval: A unified construction
    • th Int'l Colloquium on Automata, Languages and Programming (ICALP 2001), Crete, Greece, Springer-Verlag, July
    • th Int'l Colloquium on Automata, Languages and Programming (ICALP 2001), Crete, Greece, LNCS, vol. 2076, Springer-Verlag, July 2001, pp. 912-926.
    • (2001) LNCS , vol.2076 , pp. 912-926
    • Beimel, A.1    Ishai, Y.2
  • 4
    • 1642602228 scopus 로고    scopus 로고
    • Computationally private information retrieval with polylogarithmic communication
    • Proc. Advances in Cryptology (EUROCRYPT '99), Prague, Czech Republic, Springer-Verlag, May
    • C. Cachin, S. Micali, and M. Stadler, "Computationally Private Information Retrieval with Polylogarithmic Communication", Proc. Advances in Cryptology (EUROCRYPT '99), Prague, Czech Republic, LNCS, vol. 1592, Springer-Verlag, May 1999, pp. 402-414.
    • (1999) LNCS , vol.1592 , pp. 402-414
    • Cachin, C.1    Micali, S.2    Stadler, M.3
  • 6
    • 0003785721 scopus 로고    scopus 로고
    • tech. report MIT/LCS/TR-817, Laboratory for Computer Science, MIT, Cambridge, MA, USA, Jan
    • M. Castro. Practical Byzantine Fault Tolerance, tech. report MIT/LCS/TR-817, Laboratory for Computer Science, MIT, Cambridge, MA, USA, Jan. 2001.
    • (2001) Practical Byzantine Fault Tolerance
    • Castro, M.1
  • 8
    • 0032201622 scopus 로고    scopus 로고
    • th Annual Symposium on Foundations of Computer Science (FOCS'95), Milwaukee, Wisconsin, USA, 23-25 Oct. 1995, pp. 41-51. Journal version: J. of the ACM, vol. 45, no. 6, 1998, pp. 965-981.
    • (1998) Journal version: J. of the ACM , vol.45 , Issue.6 , pp. 965-981
  • 16
    • 84948954750 scopus 로고    scopus 로고
    • One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval
    • Proc. Advances in Cryptology (EUROCRYPT 2000), Springer-Verlag
    • E. Kushilevitz and R. Ostrovsky, "One-way Trapdoor Permutations are Sufficient for Non-Trivial Single-Server Private Information Retrieval", Proc. Advances in Cryptology (EUROCRYPT 2000), LNCS, vol. 1807, Springer-Verlag, 2000, pp. 104-121.
    • (2000) LNCS , vol.1807 , pp. 104-121
    • Kushilevitz, E.1    Ostrovsky, R.2
  • 19
    • 0018545449 scopus 로고
    • How to share a secret
    • A. Shamir, "How to Share a Secret", Communications of the ACM, vol. 22, no. 11, 1979, pp. 612-613.
    • (1979) Communications of the ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1
  • 20
    • 0024141971 scopus 로고
    • How to share a secret with cheaters
    • M. Tompa and H. Woll, "How to Share a Secret with Cheaters", J. of Cryptography, vol. 1, no. 2, 1988, pp. 133-138.
    • (1988) J. of Cryptography , vol.1 , Issue.2 , pp. 133-138
    • Tompa, M.1    Woll, H.2


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