Batch codes and their applications
暂无分享,去创建一个
Rafail Ostrovsky | Yuval Ishai | Eyal Kushilevitz | Amit Sahai | R. Ostrovsky | A. Sahai | E. Kushilevitz | Y. Ishai
[1] Yuval Ishai,et al. Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[2] Moni Naor,et al. Communication preserving protocols for secure function evaluation , 2001, STOC '01.
[3] Noga Alon,et al. Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.
[4] Yuval Ishai,et al. Protecting data privacy in private information retrieval schemes , 1998, STOC '98.
[5] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[6] Moni Naor,et al. Oblivious Transfer with Adaptive Queries , 1999, CRYPTO.
[7] Moni Naor,et al. Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..
[8] Yuval Ishai,et al. Reducing the Servers’ Computation in Private Information Retrieval: PIR with Preprocessing , 2004, Journal of Cryptology.
[9] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[10] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudorandom generator , 2005, JACM.
[11] Amnon Ta-Shma,et al. Extractors from Reed-Muller Codes , 2001, Electron. Colloquium Comput. Complex..
[12] Yuval Ishai,et al. Breaking the Barrier for Information-Theoretic Private Information Retrieval , 2002 .
[13] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma (extended abstract) , 1999, STOC '99.
[14] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[15] Omer Reingold,et al. Randomness Conductors and Constant-Degree Expansion Beyond the Degree / 2 Barrier , 2001 .
[16] Avi Wigderson,et al. Extractors: optimal up to constant factors , 2003, STOC '03.
[17] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[18] Rafail Ostrovsky,et al. Single Database Private Information Retrieval Implies Oblivious Transfer , 2000, EUROCRYPT.
[19] Joan Feigenbaum,et al. Secure multiparty computation of approximations , 2001, TALG.
[20] Yuval Ishai,et al. Selective private function evaluation with applications to private statistics , 2001, PODC '01.
[21] Amnon Ta-Shma,et al. Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.
[22] Noga Alon,et al. Testing Low-Degree Polynomials over , 2004 .
[23] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[24] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[25] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudo-random generator , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[26] Andrew Chi-Chih Yao,et al. Should tables be sorted? , 1981, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[27] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[28] Tal Malkin,et al. A Random Server Model for Private Information Retrieval or How to Achieve Information Theoretic PIR Avoiding Database Replication , 1998, RANDOM.
[29] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[30] Silvio Micali,et al. Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.
[31] Jonathan Katz,et al. On the efficiency of local decoding procedures for error-correcting codes , 2000, STOC '00.
[32] Joan Feigenbaum,et al. Hiding Instances in Multioracle Queries , 1990, STACS.
[33] János Komlós,et al. Deterministic simulation in LOGSPACE , 1987, STOC.
[34] R. Impagliazzo,et al. P=BPP unless E has sub-exponential circuits: Derandomizing the XOR Lemma , 2002 .
[35] Joe Kilian,et al. A note on efficient zero-knowledge proofs and arguments (extended abstract) , 1992, STOC '92.
[36] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[37] Michael O. Rabin,et al. Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.
[38] Avi Wigderson,et al. Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.