-
21
A Secure Face Verification Scheme Based on Fully Homomorphic Encryption with Anonymity
Published 2024-02-01Subjects: Get full text
Article -
22
Privacy Preserving Shortest Path Queries on Directed Graph
Published 2018-05-01Subjects: Get full text
Article -
23
The Techniques for Arbitrary Secure Quering to Encrypted Cloud Database Using Fully Homomorphic Encryption
Published 2017-06-01Subjects: Get full text
Article -
24
-
25
Efficient Fully Homomorphic Encryption from (Standard) LWE
Published 2018“…Key words. cryptology, public-key encryption, fully homomorphic encryption, learning with errors, private information retrieval…”
Get full text
Get full text
Article -
26
Some Open Problems in Information-Theoretic Cryptography
Published 2021“…We will describe several such problems that arise in the study of private information retrieval, secure multi-party computation, secret sharing, private simultaneous messages (PSM) and conditional disclosure of secrets (CDS). …”
Get full text
Article -
27
Some Open Problems in Information-Theoretic Cryptography
Published 2021“…We will describe several such problems that arise in the study of private information retrieval, secure multi-party computation, secret sharing, private simultaneous messages (PSM) and conditional disclosure of secrets (CDS). …”
Get full text
Article -
28
Deceptive Information Retrieval
Published 2024-03-01“…Conceptually, DIR is an extension of private information retrieval (PIR). In PIR, a user downloads a required file without revealing its index to any of the databases. …”
Get full text
Article -
29
A Shannon-Theoretic Approach to the Storage–Retrieval Trade-Off in PIR Systems
Published 2023-01-01“…We consider the storage–retrieval rate trade-off in private information retrieval (PIR) systems using a Shannon-theoretic approach. …”
Get full text
Article -
30
Splinter: Practical Private Queries on Public Data
Published 2021“…Splinter uses and extends a new cryptographic primitive called Function Secret Sharing (FSS) that makes it up to an order of magnitude more efficient than prior systems based on Private Information Retrieval and garbled circuits. We develop protocols extending FSS to new types of queries, such as MAX and TOPK queries. …”
Get full text
Article -
31
Low Communication-Cost PSI Protocol for Unbalanced Two-Party Private Sets
Published 2024-01-01“…The queries are implemented by private information retrieval which is constructed with trapdoor hash function. …”
Get full text
Article -
32
Riffle: An Efficient Communication System With Strong Anonymity
Published 2020“…Riffle uses a new hybrid verifiable shuffle technique and private information retrieval for bandwidth- and computation-efficient anonymous communication. …”
Get full text
Article -
33
Conditional Disclosure of Secrets via Non-linear Reconstruction
Published 2021“…To obtain these results, we draw upon techniques for non-linear reconstruction developed in the context of information-theoretic private information retrieval. We further extend our results to the setting of private simultaneous messages (PSM), and provide applications such as an improved attribute-based encryption (ABE) for quadratic polynomials.…”
Get full text
Article -
34
On the Bringer–Chabanne EPIR protocol for polynomial evaluation
Published 2013“…Extended private information retrieval (EPIR) was defined by Bringer, Chabanne, Pointcheval and Tang at CANS 2007 and generalized by Bringer and Chabanne at AFRICACRYPT 2009. …”
Get full text
Get full text
Journal Article -
35
Riffle : an efficient communication system with strong anonymity
Published 2015Get full text
Thesis -
36
-
37
Towards breaking the exponential barrier for general secret sharing
Published 2020“…Our construction draws upon a rich interplay amongst old and new problems in information-theoretic cryptography: from secret-sharing, to multi-party computation, to private information retrieval. Along the way, we also construct the first multi-party conditional disclosure of secrets (CDS) protocols for general functions F: {0, 1}[superscript n]→ {0, 1} with communication complexity 2[superscript O(√ n log n)].…”
Get full text
Article -
38
Query-efficient locally decodable codes of subexponential length
Published 2012“…We also obtain new efficient private information retrieval (PIR) schemes from the new query-efficient LDCs.…”
Get full text
Get full text
Journal Article -
39
New Bounds and a Generalization for Share Conversion for 3-Server PIR
Published 2022-04-01“…Private Information Retrieval (PIR) protocols, which allow the client to obtain data from servers without revealing its request, have many applications such as anonymous communication, media streaming, blockchain security, advertisement, etc. …”
Get full text
Article