A New Efficient All-Or-Nothing Disclosure of Secrets Protocol

By Julien P. Stern. 1998

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

PIR with Compressed Queries and Amortized Query Processing (2018, methodology): “The downside of Stern’s approach is that it comes at an exponential increase in the size of the response (§3.4).”
XPIR : Private Information Retrieval for Everyone (2016, methodology): “In this paper, we use a simple cPIR protocol based on [33], described hereafter.”
A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol (2007, background): “Stern presented in 1998 a generic construction [5] using group-homomorphic encryption schemes which led to the first protocols with acceptable communication performance.”
A Fast Single Server Private Information Retrieval Protocol with Low Communication Cost (2014, methodology): “This homomorphic approach is then generalised by Stern [5], Chang [8] and Lipmaa [10, 17] .”
Robust Information-Theoretic Private Information Retrieval (2002, background): “Essentially the same construction can be based on any homomorphic encryption scheme [47], [60], [66].”
A Survey on Private Information Retrieval (Column: Computational Complexity) (2004, background): “1. Stern [ 57 ] and Mann [49] have shown that any homomorphic encryption scheme implies n (any > 0) 1-DB PIR schemes exist.”
Scalable and Private Media Consumption with Popcorn (2016, background): “Figure 1 depicts a CPIR protocol, due to Stern [98], that meets the three properties (§2.”
Revisiting the Computational Practicality of Private Information Retrieval (2011, methodology): “These include schemes based on group-homomorphic encryption [43], length-flexible additive homomorphic public-key cryptosystems [29], Φ-Hiding Assumption (ΦHA) trapdoor predicates (the hardness of deciding if a small prime is a factor of the totient of a composite integer of unknown factorization) [”
On the Computational Practicality of Private Information Retrieval (2006, background): “Lipmaa [49] extends the work of Stern [ 71 ] to provide a PIR scheme withO(log2(n)) communication complexity.”
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups (2010, background): “The work in [3] [15] [12] [6] demonstrated schemes with polylogarithmic communication complexity.”
Private Searching on Streaming Data (2005, result): “Our work is most closely related to the notion of single-database PIR, that was introduced by Kushilevitz and Ostrovsky [20] and has received a lot of subsequent attention in the literature [20], [9], [14], [24], [21], [8], [28], [22], [16].”
Distributed Point Functions and Their Applications (2014, unknown): “[24,29,10,25,17]).”
Optimal Rate Private Information Retrieval from Homomorphic Encryption (2015, background): “There exists a long line of works that improve on communication efficiency aspects of CPIR protocols [3, 18, 19, 25, 26, 37].”