Private Information Retrieval from MDS Coded Data in Distributed Storage Systems
|
|
- Sheena Fields
- 5 years ago
- Views:
Transcription
1 Private Information Retrieval from MDS Coded Data in Distributed Storage Systems Joint work with Razane Tajeddine Salim El Rouayheb ECE Department Illinois Institute of Technology
2 Motivation 1
3 Secure Multiparty Computation Differential privacy Anonymity Privacy Cryptography Private Information Retrieval (PIR) 2
4 Private Information Retrieval (PIR) User wants to retrieve a file from a database without revealing the identity of this file. This problem was first introduced by Chor et. al in [Chor, Goldreich, Kuchilevitz and Sudan 95].... User wants to watch a video on North Korean Revolution Server 3
5 Toy Example Database replicated on two non colluding servers. KX + K =X K + E 5 KX + E 5 X User wants file X 5 E 5 = [Chor et al. 1995] 4
6 Computational vs. Info Theoretic Privacy Relaxation: Computational PIR Can achieve privacy on one server without downloading whole database. [Kushilevitz and Ostrovsky, 97], [Chor and Gilboa, 97], [Cachin, Micali, and Stadler, 99], High computational complexity. [Sion and Carbunar, 07] 5
7 PIR Computational Information Theoretic This Talk Replication Coded 6
8 Model A distributed storage system with n nodes storing files X 1,, X m (n,k) MDS code is given and not design parameter. b passive spy nodes Goal: Design PIR scheme with min download cost Perfect privacy: H(f queries to b servers) = H(f), (n,k) MDS code n nodes, b spies User wants X f chosen uniformly at random 7
9 Related work: Replicated Data PIR scheme on replicated non-colluding nodes with total, upload and download, communication cost of O((n 2 log n)m 1/n ) and O(m 1/3 ) for the case when n=2 [Chor, Goldreich, Kuchilevitz and Sudan 95] PIR scheme on replicated non-colluding nodes with communication cost O(m 1/(2n 1) c log log n ) [Ambainis, 97] and O(m [Beimel et al, 02] n log n ) PIR protocols with total communication cost that is subpolynomial in the size of the database [Yekhanin 08], [Efremenko 12] and [Dvir and Gopi 15] Fundamental limits and achievable schemes on download cost for replication. [Sun and Jafar 16]
10 Related Work on Coded PIR Batch codes [Ishai et al. 04] One extra bit of download is sufficient to achieve PIR. [Shah, Rashmi, and Ramchandran, ISIT 14] Methods for transforming a replication-based PIR scheme into a coded-based PIR scheme with the same communication cost [Fazeli, Vardy, and Yaakobi, ISIT 15] Bounds on the the tradeoff between storage and download communication cost. [Chan, Ho, and Yamamoto, ISIT 15] PIR array codes [Blackburn & Etzion 16] 9
11 Our Results: Single Spy Theorem 1: Consider a DSS using an MDS code over, with b =1spy node. Then, there is an explicit linear PIR scheme for any number of files m over with download communication cost (price of privacy): Achieves the information theoretic optimum given in [Chan et al, ISIT 15] for linear PIR scheme. Achieve the bound given in [Sun et. al, ISIT 16] when applying replication.* (0.5, 2) (0.8, 5) The PIR scheme is universal, i.e. does not depend on the MDS code. 10
12 Our Results: Multiple Spies Theorem 2: Consider a DSS using an MDS code over, with spy nodes. Then, there is an explicit linear PIR scheme over with download communication cost, Impossible 11
13 Example on Theorem 1 Consider a (5,2) MDS code with b =1spy node. Goal is to achieve PoP = n. n k = 5 3 File1 File2 File m a 1 a... 2 a m Server 1 b 1 b 2... b m Server 2 a 1 + b 1 a 2 + b 2... a m + b m Server 3 a 1 +2b 1 a 2 +2b 2 a m +2b m... Server 4 a 1 +3b 1 a 2 +3b 2... a m +3b m Server 5 12
14 First Attempt Generate an iid random vector U = u 1 u 2... u m. a 1 a 2 a m A T... b 1 b 2 b m B T... User wants file 1 E 1 = a 1 + b 1 a 2 + b 2... a 1 +2b 1 a 2 +2b 2 a 1 +3b 1 a 2 +3b a m + b m a m +2b m a m +3b m P op =2 P op = This achieves instead of.
15 Subdivision Divide each part into 3, a 11 a 12 1 a 13 2 subqueries. 2 random vectors U and V apple u1 +1 u Q 1 = 2 u 3... v 1 v 2 v 3... apple u1 u Q 2 = 2 u 3... v 1 +1 v 2 v 3... apple u1 u Q 3 = Q 4 = 2 +1 u 3... v 1 v 2 v apple u1 u Q 5 = 2 u 3... v 1 v 2 v 3... Q 1 U.A + a 11 Q 2 U.B Q 3 U.A + U.B + a 12 + b 12 Q 4 U.A +2U.B + a 12 +2b 12 U.A +3U.B Q 5... File 1 a 11 a 12 a 13 b 11 b 12 b a 11 + b 11 a 12 + b 12 a 13 + b a 11 +2b 11 a 12 +2b 12 a 13 +2b a 11 +3b 11 a 12 +3b 12 a 13 +3b
16 Proof of Theorem 1 Scheme: We divide each file into n k stripes. k sub-queries are made to each node (dimension of code is d). We write n k = k + r. Conditions: Decode n k parts in each sub-query. Parts not on same node. Different parts in each sub-query Retrieval pattern 15
17 Retrieval pattern for (15,4) MDS
18 Querying U + E 1 U + E 2 U + E r U E i Where the s are matrices with 1s at the positions we want to decode. U + E r+1 U + E r+ k U kequations to decode interference. r equations from systematic nodes to decode parts of the first r stripes. k equations from parity nodes to decode k complete stripes. In total, k + r parts decoded. 17
19 Querying 18
20 Response and Decoding 19
21 Decoding 20
22 Part 3 Privacy Privacy: Since b = 1, the only way a node l can learn information about f is from its own query matrix Q i. By, construction Q i is statistically independent of f and this scheme achieves perfect privacy. cpop: Every node responds with d = k symbols. Therefore, the total number of symbols downloaded by the user is kn. Therefore, cp op = kn k(n k) = 1 1 R
23 Example on Theorem 2 Assume a (5,3) MDS code. Consider b = 2 colluding nodes. W.L.O.G. user wants file 1. File 1 File 2 File m a 1 a 2 a... m b 1 b 2... b m c 1 c 2 c m... a 1 + b 1 + c 1 a 2 + b 2 + c 2... a m + b m + c m a 1 +2b 1 +3c 1 a 2 +2b 2 +3c 2... a m +2b m +3c m 22
24 Example on Theorem 2 User generates 2 random vectors Uand V. UA+ VA+ a 1 U + V + E 1 UB +2VB U +2V UC +3VC U +3V UA+ UB + UC a 1 a 2... a m b 1 b 2... b m c 1 c 2 c... m A T B T C T User wants X 1 VA+2VB+3VC V U a 1 + b 1 + c 1 a 2 + b 2 + c 2... a m + b m + c m 5 equations, 7 unknowns: UA, VA, UB, VB, UC, VC, a 1 a 1 +2b 1 +3c 1 a 2 +2b 2 +3c 2... a m +2b m +3c m 23
25 Proof of Theorem 2 Theorem 2: Consider a DSS using an MDS code over, with spy nodes. Then, there is an explicit linear PIR scheme over with download communication cost, Consider an (n,k) MDS code with the following generator matrix: 24
26 Decodability 1 n U 1,...,U b : b random vectors 25
27 Open Problems Fundamental information theoretical bounds of the communication cost (cpop). Is joint design of MDS code and PIR scheme necessary to achieve fundamental bounds? Partial retrieval of parts of the file. Beyond MDS codes, general linear codes, regenerating codes, Locally Recoverable codes, etc. General collusion patterns Malicious nodes etc 26
28 27
Tutorial on Coded Private Information Retrieval
Tutorial on Coded Private Information Retrieval Camilla Hollanti Aalto University, Finland 5th ICMCTA, Vihula, August 2017 Based on joint work with Salim El Rouayheb, Ragnar Freij-Hollanti, Oliver Gnilke,
More informationPrivate Information Retrieval from Coded Databases
Private Information Retrieval from Coded Databases arim Banawan Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 20742 kbanawan@umdedu ulukus@umdedu
More informationReport on PIR with Low Storage Overhead
Report on PIR with Low Storage Overhead Ehsan Ebrahimi Targhi University of Tartu December 15, 2015 Abstract Private information retrieval (PIR) protocol, introduced in 1995 by Chor, Goldreich, Kushilevitz
More informationThe Capacity of Private Information Retrieval from Coded Databases
The Capacity of Private Information Retrieval from Coded Databases Karim Banawan Sennur Ulukus arxiv:6090838v [csit] 6 Sep 06 Department of Electrical and Computer Engineering University of Maryland, College
More informationPrivate Information Retrieval from Coded Databases with Colluding Servers
SIAM J APPL ALGEBRA GEOMETRY Vol 1, pp 647 664 c 2017 Society for Industrial and Applied Mathematics Private Information Retrieval from Coded Databases with Colluding Servers Ragnar Freij-Hollanti, Oliver
More informationQuantum Symmetrically-Private Information Retrieval
Quantum Symmetrically-Private Information Retrieval Iordanis Kerenidis UC Berkeley jkeren@cs.berkeley.edu Ronald de Wolf CWI Amsterdam rdewolf@cwi.nl arxiv:quant-ph/0307076v 0 Jul 003 Abstract Private
More informationt-private Information Retrieval Schemes Using
1 t-private Information Retrieval Schemes Using Transitive Codes Ragnar Frei-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Member, IEEE, Anna-Lena Horlemann-Trautmann, David Karpuk, Ivo Kubas arxiv:1712.02850v1
More informationPrivate Information Retrieval from Transversal Designs
1 Private Information Retrieval from Transversal Designs Julien LAVAUZELLE Laboratoire LIX, École Polytechnique, Inria & CNRS UMR 7161 Université Paris-Saclay arxiv:1709.0795v [cs.it] 4 Sep 018 Abstract
More informationPrivate Information Retrieval from MDS Coded Databases with Colluding Servers under Several Variant Models
1 Private Information Retrieval from MDS Coded Databases with Colluding Servers under Several Variant Models Yiwei Zhang and Gennian Ge arxiv:170503186v2 [csit] 11 Oct 2017 Abstract Private information
More informationBatch and PIR Codes and Their Connections to Locally Repairable Codes
Batch and PIR Codes and Their Connections to Locally Repairable Codes Vitaly Skachek Abstract Two related families of codes are studied: batch codes and codes for private information retrieval. These two
More informationSecurity in Locally Repairable Storage
1 Security in Locally Repairable Storage Abhishek Agarwal and Arya Mazumdar Abstract In this paper we extend the notion of locally repairable codes to secret sharing schemes. The main problem we consider
More informationDistributed storage systems from combinatorial designs
Distributed storage systems from combinatorial designs Aditya Ramamoorthy November 20, 2014 Department of Electrical and Computer Engineering, Iowa State University, Joint work with Oktay Olmez (Ankara
More informationBreaking the O(n 1/(2k 1) ) Barrier for Information-Theoretic Private Information Retrieval
Breaking the O(n 1/(2k 1) ) Barrier for Information-Theoretic Private Information Retrieval Amos Beimel Yuval Ishai Eyal Kushilevitz Jean-François Raymond Abstract Private Information Retrieval (PIR) protocols
More informationIndex Coding & Caching in Wireless Networks. Salim El Rouayheb. ECE IIT, Chicago
Index Coding & Caching in Wireless Networks Salim El Rouayheb ECE IIT, Chicago Big Data vs. Wireless Exabytes per month [Cisco] Meanwhile, Storage is Getting Cheaper Storage cost per GB (USD) http://www.mkomo.com/cost-per-gigabyte-update
More informationarxiv: v1 [cs.it] 23 Jan 2019
Single-Server Single-Message Online Private Information Retrieval with Side Information Fatemeh azemi, Esmaeil arimi, Anoosheh Heidarzadeh, and Alex Sprintson arxiv:90.07748v [cs.it] 3 Jan 09 Abstract
More informationOn the Cryptographic Complexity of the Worst Functions
On the Cryptographic Complexity of the Worst Functions Amos Beimel 1, Yuval Ishai 2, Ranjit Kumaresan 2, and Eyal Kushilevitz 2 1 Dept. of Computer Science, Ben Gurion University of the Negev, Be er Sheva,
More informationDistributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient Viveck R Cadambe, Syed A Jafar, Hamed Maleki Electrical Engineering and
More informationStaircase Codes for Secret Sharing with Optimal Communication and Read Overheads
1 Staircase Codes for Secret Sharing with Optimal Communication and Read Overheads Rawad Bitar, Student Member, IEEE and Salim El Rouayheb, Member, IEEE Abstract We study the communication efficient secret
More informationComputationally Private Information Retrieval With Polylogarithmic Communication
Computationally Private Information Retrieval With Polylogarithmic Communication Christian Cachin Silvio Micali Markus Stadler August 9, 1999 Abstract We present a single-database computationally private
More informationA Geometric Approach to Information-Theoretic Private Information Retrieval
A Geometric Approach to Information-Theoretic Private Information Retrieval David Woodruff MIT dpwood@mit.edu Sergey Yekhanin MIT yekhanin@mit.edu Abstract A t-private private information retrieval PIR
More informationOn the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage
On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage Changho Suh Kannan Ramchandran Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report
More informationCan Linear Minimum Storage Regenerating Codes be Universally Secure?
Can Linear Minimum Storage Regenerating Codes be Universally Secure? Sreechakra Goparaju University of California, San Diego La Jolla, CA, USA Email: sgoparaju@ucsd.edu Salim El Rouayheb Illinois Institute
More informationarxiv: v1 [cs.it] 9 Jan 2019
Private Information Retrieval from Locally Repairable Databases with Colluding Servers Umberto Martínez-Peñas 1 1 Dept. of Electrical & Computer Engineering, University of Toronto, Canada arxiv:1901.02938v1
More informationRegenerating Codes and Locally Recoverable. Codes for Distributed Storage Systems
Regenerating Codes and Locally Recoverable 1 Codes for Distributed Storage Systems Yongjune Kim and Yaoqing Yang Abstract We survey the recent results on applying error control coding to distributed storage
More informationBreaking the O(n 1/(2k 1) ) Barrier for Information-Theoretic Private Information Retrieval
Breaking the O(n 1/(2k 1) ) Barrier for Information-Theoretic Private Information Retrieval Amos Beimel Yuval Ishai Eyal Kushilevitz Jean-François Raymond April 24, 2006 Abstract Private Information Retrieval
More informationA Lattice-Based Computationally-Efficient Private Information Retrieval Protocol
A Lattice-Based Computationally-Efficient Private Information Retrieval Protocol (Extended version of WEWORC paper, presented in July 2007, in Bochum, Germany) Carlos Aguilar-Melchor and Philippe Gaborit
More informationSecure RAID Schemes from EVENODD and STAR Codes
Secure RAID Schemes from EVENODD and STAR Codes Wentao Huang and Jehoshua Bruck California Institute of Technology, Pasadena, USA {whuang,bruck}@caltechedu Abstract We study secure RAID, ie, low-complexity
More informationarxiv: v1 [cs.it] 5 Aug 2016
A Note on Secure Minimum Storage Regenerating Codes Ankit Singh Rawat arxiv:1608.01732v1 [cs.it] 5 Aug 2016 Computer Science Department, Carnegie Mellon University, Pittsburgh, 15213. E-mail: asrawat@andrew.cmu.edu
More informationMinimum Repair Bandwidth for Exact Regeneration in Distributed Storage
1 Minimum Repair andwidth for Exact Regeneration in Distributed Storage Vivec R Cadambe, Syed A Jafar, Hamed Malei Electrical Engineering and Computer Science University of California Irvine, Irvine, California,
More informationSingle-Database Private Information Retrieval
MTAT.07.006 Research Seminar in Cryptography 07.11.2005 Tartu University a g@ut.ee 1 Overview of the Lecture CMS - first single database private information retrieval scheme Gentry-Ramzan PBR Lipmaa Oblivious
More informationDistributed Point Functions and their Applications
Distributed Point Functions and their Applications Niv Gilboa 1 and Yuval Ishai 2 1 Dept. of Communication Systems Eng., Ben-Gurion University, Beer-Sheva, Israel gilboan@bgu.ac.il 2 Dept. of Computer
More informationEfficient Private Information Retrieval
IEICE TRANS FUNDAMENTALS, VOL E8 A, NO JANUARY 999 PAPER Special Section on Cryptography and Information Security Efficient Private Information Retrieval Toshiya ITOH, Member SUMMARY Informally, private
More informationProgress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes
Progress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes Ankit Singh Rawat CS Department Carnegie Mellon University Pittsburgh, PA 523 Email: asrawat@andrewcmuedu O Ozan Koyluoglu Department
More informationOptimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction K V Rashmi, Nihar B Shah, and P Vijay Kumar, Fellow, IEEE Abstract Regenerating codes
More informationCorrecting Localized Deletions Using Guess & Check Codes
55th Annual Allerton Conference on Communication, Control, and Computing Correcting Localized Deletions Using Guess & Check Codes Salim El Rouayheb Rutgers University Joint work with Serge Kas Hanna and
More informationFractional Repetition Codes For Repair In Distributed Storage Systems
Fractional Repetition Codes For Repair In Distributed Storage Systems 1 Salim El Rouayheb, Kannan Ramchandran Dept. of Electrical Engineering and Computer Sciences University of California, Berkeley {salim,
More informationOn the Bringer Chabanne EPIR protocol for polynomial evaluation
J. Math. Cryptol. 5 (2011), 277 301 DOI 10.1515/jmc-2012-0001 de Gruyter 2012 On the Bringer Chabanne EPIR protocol for polynomial evaluation Yeow Meng Chee, Huaxiong Wang and Liang Feng Zhang Communicated
More informationPerfect Secure Computation in Two Rounds
Perfect Secure Computation in Two Rounds Benny Applebaum Tel Aviv University Joint work with Zvika Brakerski and Rotem Tsabary Theory and Practice of Multiparty Computation Workshop, Aarhus, 2018 The MPC
More informationLatency analysis for Distributed Storage
Latency analysis for Distributed Storage Parimal Parag Archana Bura Jean-François Chamberland Electrical Communication Engineering Indian Institute of Science Electrical and Computer Engineering Texas
More informationEfficient Computationally Private Information Retrieval From Anonymity or Trapdoor Groups
Efficient Computationally Private Information Retrieval From Anonymity or Trapdoor Groups Jonathan Trostle and Andy Parrish Johns Hopkins University Applied Physics Laboratory 11100 Johns Hopkins Rd. Laurel,
More informationTechnion - Computer Science Department - Ph.D. Thesis PHD
Topics in Private Information Retrieval Niv Gilboa Topics in Private Information Retrieval Research Thesis Submitted in partial fulllment of the requirements for the degree of Doctor of Philosophy Niv
More informationProduct-matrix Construction
IERG60 Coding for Distributed Storage Systems Lecture 0-9//06 Lecturer: Kenneth Shum Product-matrix Construction Scribe: Xishi Wang In previous lectures, we have discussed about the minimum storage regenerating
More informationDistributed Storage Systems with Secure and Exact Repair - New Results
Distributed torage ystems with ecure and Exact Repair - New Results Ravi Tandon, aidhiraj Amuru, T Charles Clancy, and R Michael Buehrer Bradley Department of Electrical and Computer Engineering Hume Center
More informationPrivate Access to Distributed. Information. Eran Mann
Private Access to Distributed Information Eran Mann 1 Private Access to Distributed Information Research Thesis Submitted in partial fulllment of the requirements for the degree of Master of Science in
More informationarxiv: v1 [cs.cr] 16 Dec 2014
A Storage-efficient and Robust Private Information Retrieval Scheme allowing few servers Daniel Augot 1,2, Françoise Levy-dit-Vehel 1,2,3, Abdullatif Shikfa 4 arxiv:1412.5012v1 [cs.cr] 16 Dec 2014 1 INRIA
More informationPrivate Data Transfer over a Broadcast Channel
Private Data Transfer over a Broadcast Channel Manoj Mishra, Tanmay Sharma, Bikash K Dey Indian Institute of Technology Bombay, Mumbai {mmishra, tanmaysharma53, bikash}@eeiitbacin Vinod M Prabhakaran Tata
More informationLinear Exact Repair Rate Region of (k + 1, k, k) Distributed Storage Systems: A New Approach
Linear Exact Repair Rate Region of (k + 1, k, k) Distributed Storage Systems: A New Approach Mehran Elyasi Department of ECE University of Minnesota melyasi@umn.edu Soheil Mohajer Department of ECE University
More informationKeyword Search and Oblivious Pseudo-Random Functions
Keyword Search and Oblivious Pseudo-Random Functions Mike Freedman NYU Yuval Ishai, Benny Pinkas, Omer Reingold 1 Background: Oblivious Transfer Oblivious Transfer (OT) [R], 1-out-of-N [EGL]: Input: Server:
More informationCorrecting Bursty and Localized Deletions Using Guess & Check Codes
Correcting Bursty and Localized Deletions Using Guess & Chec Codes Serge Kas Hanna, Salim El Rouayheb ECE Department, Rutgers University serge..hanna@rutgers.edu, salim.elrouayheb@rutgers.edu Abstract
More informationBandwidth Efficient PIR from NTRU
Bandwidth Efficient PIR from NTRU Yarkın Doröz 1, Berk Sunar 1 and Ghaith Hammouri 2 1 Worcester Polytechnic Institute 2 Crags Inc. Abstract. We present a private information retrieval (PIR) scheme based
More informationImproved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval Stephanie Wehner and Ronald de Wolf CWI, Kruislaan 43, 098 SJ, Amsterdam, the Netherlands. {wehner, rdewolf}@cwi.nl Abstract.
More informationOblivious Keyword Search
Oblivious Keyword Search Wakaha Ogata 1 Kaoru Kurosawa 2 1 Tokyo Institute of Technology, 2-12-1 O-okayama, Meguro-ku, Tokyo 152-8552, Japan wakaha@ss.titech.ac.jp 2 Ibaraki University, 4-12-1 Nakanarusawa,
More informationPrivate Secure Coded Computation
Private Secure Coded Computation Minchul Kim and Jungwoo Lee Seoul National University Department of Electrical and Computer Engineering 08826 Seoul, Korea Email: kmc1222@cml.snu.ac.kr, junglee@snu.ac.kr
More informationKey words: Batch codes, error-correcting codes, computationally-private information retrieval, load balancing, distributed storage.
Linear Batch Codes Helger Lipmaa and Vitaly Skachek Abstract In an application, where a client wants to obtain many symbols from a large database, it is often desirable to balance the load. Batch codes
More informationA Study of Computational Private Information Retrieval Schemes and Oblivious Transfer
MASTER ALGANT University of Padova and University of Bordeaux 1 Master Thesis in Mathematics A Study of Computational Private Information Retrieval Schemes and Oblivious Transfer Valentina Settimi Supervisor:
More informationarxiv: v2 [cs.it] 4 Mar 2019
Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost Chao Tian Hua Sun Jun Chen arxiv:1808.07536v2 [cs.it] 4 Mar 2019 March 6, 2019 Abstract We propose a new
More informationAn Overview of Homomorphic Encryption
An Overview of Homomorphic Encryption Alexander Lange Department of Computer Science Rochester Institute of Technology Rochester, NY 14623 May 9, 2011 Alexander Lange (RIT) Homomorphic Encryption May 9,
More informationPrivate Information Retrieval Based on the Subgroup Membership Problem
Private Information Retrieval Based on the Subgroup Membership Problem Akihiro Yamamura 1 and Taiichi Saito 2 1 Communications Research Laboratory, 4-2-1, Nukui-Kitamachi, Koganei, Tokyo 184-8795, Japan
More informationSTAIRCASE CODES FOR FAST AND SECURE DISTRIBUTED COMPUTING
SIP Seminar of INSPIRE Lab, Rutgers New Jersey STAIRCASE CODES FOR FAST AND SECURE DISTRIBUTED COMPUTING Rawad Bitar Illinois Ins/tute of Technology Rutgers University Collaborators Parimal Parag and Salim
More informationA Piggybacking Design Framework for Read- and- Download- efficient Distributed Storage Codes. K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran
A Piggybacking Design Framework for Read- and- Download- efficient Distributed Storage Codes K V Rashmi, Nihar B Shah, Kannan Ramchandran Outline IntroducGon & MoGvaGon Measurements from Facebook s Warehouse
More informationOn MBR codes with replication
On MBR codes with replication M. Nikhil Krishnan and P. Vijay Kumar, Fellow, IEEE Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore. Email: nikhilkrishnan.m@gmail.com,
More informationOptimal Locally Repairable and Secure Codes for Distributed Storage Systems
Optimal Locally Repairable and Secure Codes for Distributed Storage Systems Ankit Singh Rawat, O. Ozan Koyluoglu, Natalia Silberstein, and Sriram Vishwanath arxiv:0.6954v [cs.it] 6 Aug 03 Abstract This
More informationSecure Modulo Zero-Sum Randomness as Cryptographic Resource
Secure Modulo Zero-Sum Randomness as Cryptographic Resource Masahito Hayashi 12 and Takeshi Koshiba 3 1 Graduate School of Mathematics, Nagoya University masahito@math.nagoya-u.ac.jp 2 Centre for Quantum
More informationLectures 1&2: Introduction to Secure Computation, Yao s and GMW Protocols
CS 294 Secure Computation January 19, 2016 Lectures 1&2: Introduction to Secure Computation, Yao s and GMW Protocols Instructor: Sanjam Garg Scribe: Pratyush Mishra 1 Introduction Secure multiparty computation
More informationProbabilistically Checkable Arguments
Probabilistically Checkable Arguments Yael Tauman Kalai Microsoft Research yael@microsoft.com Ran Raz Weizmann Institute of Science ran.raz@weizmann.ac.il Abstract We give a general reduction that converts
More informationSecret Key Generation and Secure Computing
Secret Key Generation and Secure Computing Himanshu Tyagi Department of Electrical and Computer Engineering and Institute of System Research University of Maryland, College Park, USA. Joint work with Prakash
More informationEfficient 3-Party Distributed ORAM
Efficient 3-Party Distributed ORAM Paul Bunn 1, Jonathan Katz 2, Eyal Kushilevitz 3, and Rafail Ostrovsky 4 1 Stealth Software Technologies, Inc. 2 Department of Computer Science, University of Maryland
More informationExplicit MBR All-Symbol Locality Codes
Explicit MBR All-Symbol Locality Codes Govinda M. Kamath, Natalia Silberstein, N. Prakash, Ankit S. Rawat, V. Lalitha, O. Ozan Koyluoglu, P. Vijay Kumar, and Sriram Vishwanath 1 Abstract arxiv:1302.0744v2
More informationSynchronizing Edits in Distributed Storage Networks
Synchronizing Edits in Distributed Storage Networks Salim El Rouayheb, Sreechakra Goparaju, Han Mao Kiah, Olgica Milenkovic Department of Electrical and Computer Engineering, Illinois Institute of Technology,
More informationSingle Database Private Information Retrieval with Logarithmic Communication
Single Database Private Information Retrieval with Logarithmic Communication Yan-Cheng Chang Harvard University ycchang@eecs.harvard.edu February 10, 2004 Abstract In this paper, we study the problem of
More informationEliminating Quadratic Slowdown in Two-Prime RSA Function Sharing
International Journal of Network Security, Vol.7, No.1, PP.107 114, July 2008 107 Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing Maged Hamada Ibrahim Department of Electronics, Communications
More informationBeyond the MDS Bound in Distributed Cloud Storage
Beyond the MDS Bound in Distributed Cloud Storage Jian Li Tongtong Li Jian Ren Department of ECE, Michigan State University, East Lansing, MI 48824-1226 Email: {lijian6, tongli, renjian}@msuedu Abstract
More informationThe Computational Complexity Column
The Computational Complexity Column by Lance Fortnow Department of Computer Science, University of Chicago 1100 East 58th St., Chicago, IL 60637 USA fortnow@cs.uchicago.edu http://www.cs.uchicago.edu/~fortnow/beatcs
More informationA Zero-One Law for Secure Multi-Party Computation with Ternary Outputs
A Zero-One Law for Secure Multi-Party Computation with Ternary Outputs Gunnar Kreitz KTH Royal Institute of Technology gkreitz@kth.se Abstract. There are protocols to privately evaluate any function in
More informationGuess & Check Codes for Deletions, Insertions, and Synchronization
Guess & Check Codes for Deletions, Insertions, and Synchronization Serge Kas Hanna, Salim El Rouayheb ECE Department, Rutgers University sergekhanna@rutgersedu, salimelrouayheb@rutgersedu arxiv:759569v3
More informationMulti-Party Computation with Conversion of Secret Sharing
Multi-Party Computation with Conversion of Secret Sharing Josef Pieprzyk joint work with Hossein Ghodosi and Ron Steinfeld NTU, Singapore, September 2011 1/ 33 Road Map Introduction Background Our Contribution
More informationHW #4. (mostly by) Salim Sarımurat. 1) Insert 6 2) Insert 8 3) Insert 30. 4) Insert S a.
HW #4 (mostly by) Salim Sarımurat 04.12.2009 S. 1. 1. a. 1) Insert 6 2) Insert 8 3) Insert 30 4) Insert 40 2 5) Insert 50 6) Insert 61 7) Insert 70 1. b. 1) Insert 12 2) Insert 29 3) Insert 30 4) Insert
More informationAn approach from classical information theory to lower bounds for smooth codes
An approach from classical information theory to lower bounds for smooth codes Abstract Let C : {0, 1} n {0, 1} m be a code encoding an n-bit string into an m-bit string. Such a code is called a (q, c,
More informationTutorial: Locally decodable codes. UT Austin
Tutorial: Locally decodable codes Anna Gál UT Austin Locally decodable codes Error correcting codes with extra property: Recover (any) one message bit, by reading only a small number of codeword bits.
More informationFast Three-Party Shared Generation of RSA Keys Without Distributed Primality Tests
Fast Three-Party Shared Generation of RSA Keys Without Distributed Primality Tests Maged H. Ibrahim I. I. Ibrahim A. H. El-Sawy Telecommunications Department, Faculty of Engineering, Helwan University
More informationExplicit Code Constructions for Distributed Storage Minimizing Repair Bandwidth
Explicit Code Constructions for Distributed Storage Minimizing Repair Bandwidth A Project Report Submitted in partial fulfilment of the requirements for the Degree of Master of Engineering in Telecommunication
More informationWeakly Secure Regenerating Codes for Distributed Storage
Weakly Secure Regenerating Codes for Distributed Storage Swanand Kadhe and Alex Sprintson 1 arxiv:1405.2894v1 [cs.it] 12 May 2014 Abstract We consider the problem of secure distributed data storage under
More informationA Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
A Piggybacing Design Framewor for Read-and Download-efficient Distributed Storage Codes K V Rashmi, Nihar B Shah, Kannan Ramchandran, Fellow, IEEE Department of Electrical Engineering and Computer Sciences
More informationVie privée en pratique : que changent les réseaux euclidiens
Vie privée en pratique : que changent les réseau euclidiens Bringing PETs to life : what ideal lattices change in practice Marc-Olivier KILLIJIAN UQAM 10/2017 Who am I? 2 Directeur de Recherche CNRS Affecté
More informationAnonymous Credential Schemes with Encrypted Attributes
Anonymous Credential Schemes with Encrypted Attributes Bart Mennink (K.U.Leuven) joint work with Jorge Guajardo (Philips Research) Berry Schoenmakers (TU Eindhoven) Conference on Cryptology And Network
More informationConstant-Round Private Database Queries
Constant-Round Private Database Queries Nenad Dedic and Payman Mohassel Abstract. We consider several private database query problems. The starting point of this work is the element rank problem: the server
More informationLocal correctability of expander codes
Local correctability of expander codes Brett Hemenway Rafail Ostrovsky Mary Wootters IAS April 4, 24 The point(s) of this talk Locally decodable codes are codes which admit sublinear time decoding of small
More informationLinear Programming Bounds for Robust Locally Repairable Storage Codes
Linear Programming Bounds for Robust Locally Repairable Storage Codes M. Ali Tebbi, Terence H. Chan, Chi Wan Sung Institute for Telecommunications Research, University of South Australia Email: {ali.tebbi,
More informationLocally Decodable Codes and Private Information Retrieval Schemes. Sergey Yekhanin
Locally Decodable Codes and Private Information Retrieval Schemes by Sergey Yekhanin Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements
More informationA Multi-dimensional Yao s Millionaire Protocol
CERIAS Tech Report 2001-09 A Multi-dimensional Yao s Millionaire Protocol Mikhail Atallah, Wenliang Du Center for Education and Research in Information Assurance and Security & Department of Computer Sciences,
More informationNotes on Zero Knowledge
U.C. Berkeley CS172: Automata, Computability and Complexity Handout 9 Professor Luca Trevisan 4/21/2015 Notes on Zero Knowledge These notes on zero knowledge protocols for quadratic residuosity are based
More informationNon-Interactive Secure Multiparty Computation
Non-Interactive Secure Multiparty Computation Amos Beimel 1, Ariel Gabizon 2, Yuval Ishai 2, Eyal Kushilevitz 2, Sigurd Meldgaard 3, and Anat Paskin-Cherniavsky 4 1 Dept. of Computer Science, Ben Gurion
More informationMulti-Party Computation of
Multi-Party Computation of Polynomials & Branching Programs without Simultaneous Interaction Hoeteck Wee (ENS) + Dov Gordon (ACS) Tal Malkin (Columbia) Mike Rosulek (OSU) multi-party computation x x 2
More informationInterference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions Nihar B Shah, K V Rashmi, P Vijay Kumar, Fellow, IEEE, and Kannan Ramchandran, Fellow, IEEE Abstract
More informationExtending Oblivious Transfers Efficiently
Extending Oblivious Transfers Efficiently Yuval Ishai Technion Joe Kilian Kobbi Nissim Erez Petrank NEC Microsoft Technion Motivation x y f(x,y) How (in)efficient is generic secure computation? myth don
More informationConstraining Pseudorandom Functions Privately
Constraining Pseudorandom Functions Privately Dan Boneh, Kevin Lewi, and David J. Wu Stanford University {dabo,klewi,dwu4}@cs.stanford.edu Abstract In a constrained pseudorandom function (PRF), the master
More informationPublic Key Encryption with keyword Search
Public Key Encryption with keyword Search Dan Boneh 1 Giovanni Di Crescenzo 2 Rafail Ostrovsky 3 Giuseppe Persiano 4 1 Stanford University. dabo@cs.stanford.edu 2 Telcordia. giovanni@research.telcordia.com
More informationInteractive PCP. Yael Tauman Kalai Georgia Institute of Technology Ran Raz Weizmann Institute of Science
Interactive PCP Yael Tauman Kalai Georgia Institute of Technology yael@csail.mit.edu Ran Raz Weizmann Institute of Science ran.raz@weizmann.ac.il Abstract A central line of research in the area of PCPs
More informationarxiv: v1 [cs.it] 18 Jun 2011
On the Locality of Codeword Symbols arxiv:1106.3625v1 [cs.it] 18 Jun 2011 Parikshit Gopalan Microsoft Research parik@microsoft.com Cheng Huang Microsoft Research chengh@microsoft.com Sergey Yekhanin Microsoft
More informationDistributed Oblivious RAM for Secure Two-Party Computation
Seminar in Distributed Computing Distributed Oblivious RAM for Secure Two-Party Computation Steve Lu & Rafail Ostrovsky Philipp Gamper Philipp Gamper 2017-04-25 1 Yao s millionaires problem Two millionaires
More information