Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"Private Information Retrieval"”.

  1. Efficient Private Information Retrieval

    … can reveal significant and possibly sensitive information about her. Private Information Retrieval (PIR) algorithms can be leveraged for providing perfect privacy to users' queries, though at a restrictive computational cost. In this work, we consider today's highly distributed computing …

    cuny-grad Repository record for Efficient Private Information Retrieval (opens in a new tab)

  2. Distributional Private Information Retrieval

    A private-information-retrieval (PIR) scheme lets a client fetch a record from a remote database without revealing which record it has fetched. Classic PIR schemes treat all database records the same but, in practice, some database records are much more popular (i.e., commonly fetched) than others. …

    mit Repository record for Distributional Private Information Retrieval (opens in a new tab)

  3. Practical protocols for private information retrieval

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2026-05-01

    uiuc Repository record for Practical protocols for private information retrieval (opens in a new tab)

  4. Private Information Retrieval with Access Control

    Private Information Retrieval (PIR) allows a user to query for a record from a remote database without revealing the query to the database server. However, PIR does not provide access control guarantees, allowing any user access to any record. Moreover, the database server cannot check access …

    mit Repository record for Private Information Retrieval with Access Control (opens in a new tab)

  5. On basing private information retrieval on NP-hardness

    … that the security of single-server single-round private information retrieval schemes cannot be based on NP-hardness, unless the polynomial hierarchy collapses. Our main technical contribution is in showing how to break the security of a PIR protocol given an SZK oracle. Our result is tight in …

    mit Repository record for On basing private information retrieval on NP-hardness (opens in a new tab)

  6. Locally Decodable Codes and Private Information Retrieval Schemes

    … namely Locally Decodable Codes (LDCs) and Private Information Retrieval Schemes (PIRs). Locally decodable codes are error-correcting codes that allow extremely efficient, "sublinear-time" decoding procedures. More formally, a k-query locally decodable code encodes n-bit messages x in such a …

    mit Repository record for Locally Decodable Codes and Private Information Retrieval Schemes (opens in a new tab)

  7. Single-Server Private Information Retrieval with Sublinear Amortized Time

    We construct new private-information-retrieval protocols in the singleserver setting. Our schemes allow a client to privately fetch a sequence of database records from a server, while the server answers each query in average time sublinear in the database size. Specifically, we introduce the first …

    mit Repository record for Single-Server Private Information Retrieval with Sublinear Amortized Time (opens in a new tab)

  8. Private Information Retrieval in an Anonymous Peer-to-Peer Environment

    Private Information Retrieval (PIR) protocols enable a client to access data from a server without revealing what data was accessed. The study of Computational Private Information Retrieval (CPIR) protocols, an area of PIR protocols focusing on computational security, has been a recently …

    uno Repository record for Private Information Retrieval in an Anonymous Peer-to-Peer Environment (opens in a new tab)

  9. OnionChopper: A Modular Arithmetic Hardware Accelerator for Private Information Retrieval

    Private information retrieval (PIR) is a protocol which allows a user to retrieve data from a database on a server without the server being able to deduce which records were retrieved. Due to the homomorphic cryptography systems required to make these protocols work and large amount of data …

    mit Repository record for OnionChopper: A Modular Arithmetic Hardware Accelerator for Private Information Retrieval (opens in a new tab)

  10. Single-server client preprocessing private information retrieval with tight space-time trade-off

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2026-12-01

    uiuc Repository record for Single-server client preprocessing private information retrieval with tight space-time trade-off (opens in a new tab)

  11. Secure communication : CDS, PIR, PSM

    Private Information Retrieval is the problem of querying two servers to nd a value in a database, while keeping the index private. We extend this problem to Generalized Wildcard PIR, where we instead query an aggregate of the entries whose indices match a pattern, called a generalized wildcard, …

    mit Repository record for Secure communication : CDS, PIR, PSM (opens in a new tab)

  12. PROTECTING PRIVACY AND SECURING DATABASES WITH QUANTUM NETWORKS

    We investigate information-theoretic (IT) secure three-party symmetric private information retrieval (SPIR) protocols, which provide user and data privacy when a user retrieves an entry from a database. We propose the use of a quantum key distribution (QKD) network to supply the necessary IT-secure …

    nus Repository record for PROTECTING PRIVACY AND SECURING DATABASES WITH QUANTUM NETWORKS (opens in a new tab)

  13. Implementing Direct Anonymous Attestation on TPM 2.0

    … published in the last decade on topics such as private information retrieval and anonymous authentication and the Trusted Computing Group (TCG) has released a version 2.0 standard for Trusted Platform Modules (TPM). Adoption and implementation of these techniques, however, has been lacking. …

    vt Repository record for Implementing Direct Anonymous Attestation on TPM 2.0 (opens in a new tab)

  14. Exploring Techniques for Providing Privacy in Location-Based Services Nearest Neighbor Query

    … with the size of the neighborhood. To retrieve information secretly and allow the database to expose only requested information, private information retrieval protocols are executed twice on the data. Our study of the implementation shows that the concept of a single object neighborhood is able …

    ucf

  15. Maliciously Secure Computation, Theory and Practice

    … over joint inputs, where both inputs remain private while still delivering the correct output? This thesis focuses on answering these questions by constructing secure computation protocols with low communication & computation overhead. The protocols in this thesis include several concretely …

    mit Repository record for Maliciously Secure Computation, Theory and Practice (opens in a new tab)

  16. Riffle : an efficient communication system with strong anonymity

    … a new hybrid verifiable shuffle technique and private information retrieval for bandwidth- and computation-efficient anonymous communication. We have evaluated Riffle in two different applications: file sharing and microblogging. Our evaluation shows that Riffle can achieve a bandwidth of over …

    mit Repository record for Riffle : an efficient communication system with strong anonymity (opens in a new tab)

  17. Breaking barriers in secret sharing

    … the secret if F(T) = 1, and should have no information about the secret if F(T) = 0. One of the major long-standing questions in information-theoretic cryptography is to determine the minimum size of the shares in a secret-sharing scheme for an access function F. There is an exponential gap …

    mit Repository record for Breaking barriers in secret sharing (opens in a new tab)

  18. Succinct Cryptography via Propositional Proofs

    … of fully homomorphic encryption and private information retrieval from standard, cryptographic assumptions which achieve the ideal levels of succinctness. However, there are still some tasks in cryptography where achieving the “ideal” efficiency from standard assumptions has evaded …

    mit Repository record for Succinct Cryptography via Propositional Proofs (opens in a new tab)

  19. Argos: Verifiable FHE Using Commodity Hardware

    … used for real-world applications of FHE, such as private information retrieval (PIR) and private set intersection (PSI), where providing verifiability is imperative. By demonstrating how to combine cryptography with trusted hardware, Argos paves the way for widespread deployment of FHE-based …

    mit Repository record for Argos: Verifiable FHE Using Commodity Hardware (opens in a new tab)

  20. Location Privacy In Emerging Network-Based Applications

    … In a cloud-based navigation system, the location information of a sensitive itinerary is disclosed. Those scenarios have shown that privacy protection is a far-reaching problem that could span many different aspects of a computer/network system, especially on a diversified landscape of such …

    wayne-thes Repository record for Location Privacy In Emerging Network-Based Applications (opens in a new tab)