Perfectly Secure Oblivious RAM without Random Oracles

Ivan Bjerre Damgård, Sigurd Torkel Meldgaard, Jesper Buus Nielsen

    Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisKonferenceartikelForskningpeer review

    108 Citationer (Scopus)

    Abstract

    We present an algorithm for implementing a secure oblivious RAM where the access pattern is perfectly hidden in the information theoretic sense, without assuming that the CPU has access to a random oracle. In addition we prove a lower bound on the amount of randomness needed for implementing an information theoretically secure oblivious RAM.
    OriginalsprogEngelsk
    BogserieLecture Notes in Computer Science
    Vol/bind6597
    Sider (fra-til)144-163
    Antal sider20
    ISSN0302-9743
    DOI
    StatusUdgivet - 2011
    Begivenhed8th Theory of Cryptography Conference. TCC 2011 - Providence, RI, USA
    Varighed: 28 mar. 201130 mar. 2011

    Konference

    Konference8th Theory of Cryptography Conference. TCC 2011
    Land/OmrådeUSA
    ByProvidence, RI
    Periode28/03/201130/03/2011

    Fingeraftryk

    Dyk ned i forskningsemnerne om 'Perfectly Secure Oblivious RAM without Random Oracles'. Sammen danner de et unikt fingeraftryk.

    Citationsformater