Filters








402 Hits in 4.8 sec

Private Evaluation of Decision Trees using Sublinear Cost

Anselme Tueno, Florian Kerschbaum, Stefan Katzenbeisser
2019 Proceedings on Privacy Enhancing Technologies  
In this paper, we address the problem of privately evaluating a decision tree on private data.  ...  Using ORAM, this results in the first protocol with sub-linear cost in the size of the tree. We implemented and evaluated our solution using the different array indexing procedures mentioned above.  ...  This work has received funding from the European Union's Horizon 2020 Research and Innovation Programme under grant agreement No. 644579 of ESCUDO-CLOUD project.  ... 
doi:10.2478/popets-2019-0015 dblp:journals/popets/TuenoKK19 fatcat:3cbbw5i3ijarzce5obthny2jda

Non-Interactive Private Decision Tree Evaluation [article]

Anselme Tueno, Yordan Boev, Florian Kerschbaum
2019 arXiv   pre-print
In this paper, we, therefore, address the problem of privately evaluating a decision tree on private data.  ...  This scenario consists of a server holding a private decision tree model and a client interested in classifying its private attribute vector using the server's private model.  ...  In this paper, we, therefore, address the problem of privately evaluating a decision tree on private data.  ... 
arXiv:1909.08362v1 fatcat:qkk3s4qzmnfavawqcsml4gkvsq

First CPIR Protocol with Data-Dependent Computation [chapter]

Helger Lipmaa
2010 Lecture Notes in Computer Science  
In the case of multiple servers, [3] constructed several sublinear-computation information-theoretically private information retrieval protocols.  ...  The security of BddCpir can be based on the well-known Decisional Composite Residuosity assumption.  ...  A BDD is a decision tree if the underlying graph is a tree.  ... 
doi:10.1007/978-3-642-14423-3_14 fatcat:ywzli62lgzeefihenypprf4gj4

Non-interactive Private Decision Tree Evaluation [chapter]

Anselme Tueno, Yordan Boev, Florian Kerschbaum
2020 Lecture Notes in Computer Science  
In this paper, we address the problem of privately evaluating a decision tree on private data.  ...  This scenario consists of a server holding a private decision tree model and a client interested in classifying its private attribute vector using the server's private model.  ...  This scenario consists of a server holding a private decision tree model and a client wanting to classify its private attribute vector using the server's private model.  ... 
doi:10.1007/978-3-030-49669-2_10 fatcat:wzomzihvwjdqxlznwezejwar6u

Communication Complexity and Secure Function Evaluation [article]

Moni Naor, Kobbi Nissim
2001 arXiv   pre-print
In one methodology we utilize the communication complexity tree (or branching for f and transform it into a secure protocol.  ...  In other words, "any function f that can be computed using communication complexity c can be can be computed securely using communication complexity that is polynomial in c and a security parameter".  ...  Acknowledgments We thank Madhu Sudan for a discussion of the reversibility of PCP constructions and pointing [33] , Yehuda Lindell for discussions regarding handling malicious parties, and Yuval Ishai  ... 
arXiv:cs/0109011v1 fatcat:fs2of35xenbyxhlpjabcmfwroe

Blind Seer: A Scalable Private DBMS

Vasilis Pappas, Fernando Krell, Binh Vo, Vladimir Kolesnikov, Tal Malkin, Seung Geol Choi, Wesley George, Angelos Keromytis, Steve Bellovin
2014 2014 IEEE Symposium on Security and Privacy  
In this work, we address a major open problem in private DB: efficient sublinear search for arbitrary Boolean queries.  ...  We design, build, and evaluate the performance of a rich DBMS system, suitable for real-world deployment on today medium-to large-scale DBs.  ...  , of IARPA, DoI/NBC, or the U.S.  ... 
doi:10.1109/sp.2014.30 dblp:conf/sp/PappasKVKMCGKB14 fatcat:muuma54ttnhktbsf3fakm2soom

Function Secret Sharing

Elette Boyle, Niv Gilboa, Yuval Ishai
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
We present an efficient PRG-based 2-party FSS scheme for the family of decision trees, leaking only the topology of the tree and the internal node labels.  ...  FSS schemes are useful for applications that involve privately reading from or writing to distributed databases while minimizing the amount of communication.  ...  Compared with the solution based on decision trees, we will get better efficiency (linear in the bit-length of the input instead of quadratic) at the cost of using a larger number of parties.  ... 
doi:10.1145/2976749.2978429 dblp:conf/ccs/BoyleGI16 fatcat:hrny53hbkrgujgmgt4w6nrvezq

Communication Locality in Secure Multi-party Computation [chapter]

Elette Boyle, Shafi Goldwasser, Stefano Tessaro
2013 Lecture Notes in Computer Science  
We then focus on the particularly interesting setting in which the function to be computed is a sublinear algorithm: An evaluation of f depends on the inputs of at most q = o(n) of the parties, where the  ...  While the sublinear query complexity of f makes it possible in principle to dramatically reduce the communication complexity of our general protocol, the challenge is to achieve this while maintaining  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA  ... 
doi:10.1007/978-3-642-36594-2_21 fatcat:4app2lqdhnh3doehcg5z7qcprq

Finding equilibria in large sequential games of imperfect information

Andrew Gilpin, Tuomas Sandholm
2006 Proceedings of the 7th ACM conference on Electronic commerce - EC '06  
It is no larger than the game tree, and on nontrivial games it is drastically smaller, so GameShrink has time and space complexity sublinear in the size of the game tree.  ...  We present an algorithm, GameShrink, for abstracting the game using our isomorphism exhaustively. Its complexity isÕ(n 2 ), where n is the number of nodes in a structure we call the signal tree.  ...  The algorithm often runs in sublinear time (and space) in the size of the game tree because the signal tree is significantly smaller than the game tree in most nontrivial games.  ... 
doi:10.1145/1134707.1134725 dblp:conf/sigecom/GilpinS06 fatcat:2jtllaugyjdfxpvuzxfgefl7ga

Secure two-party computation in sublinear (amortized) time

S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov, Fernando Krell, Tal Malkin, Mariana Raykova, Yevgeniy Vahlis
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
Because of the cost of our basic steps, our solution is slower than Yao on small inputs.  ...  We present an optimized version of our protocol using Yao's garbled-circuit approach and a recent ORAM construction of Shi et al.  ...  , of IARPA, DoI/NBC, or the U.S.  ... 
doi:10.1145/2382196.2382251 dblp:conf/ccs/GordonKKKM0V12 fatcat:jb3gri5gqrd6jfl6wuzq2t3dai

Privacy-Preserving Classifier Learning [chapter]

Justin Brickell, Vitaly Shmatikov
2009 Lecture Notes in Computer Science  
We present an efficient protocol for the privacy-preserving, distributed learning of decision-tree classifiers.  ...  Our protocol uses several novel techniques to enable oblivious classifier construction.  ...  Using oblivious decision-tree evaluation, the user and the server can then learn shares of |T k (n : i, j)| without either revealing his private inputs.  ... 
doi:10.1007/978-3-642-03549-4_8 fatcat:ljlgtzlbtvfhvcc6o2ry5jbnlm

Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games [article]

Gabriele Farina, Tuomas Sandholm
2021 arXiv   pre-print
Most regret-minimization algorithms for tree-form sequential decision making, including CFR, require (i) an exact model of the player's decision nodes, observation nodes, and how they are linked, and (  ...  Regret minimization has proved to be a versatile tool for tree-form sequential decision making and extensive-form games.  ...  their valuable feedback while preparing our manuscript, and to Marc Lanctot and Vinicius Zambaldi for their help in tuning the hyperparameters and running experiments for the policy gradient algorithm of  ... 
arXiv:2103.04539v1 fatcat:3s5z2crajvamplbizn65dwn5ky

Verifiable Oblivious Storage [chapter]

Daniel Apon, Jonathan Katz, Elaine Shi, Aishwarya Thiruvengadam
2014 Lecture Notes in Computer Science  
This allows us to achieve sublinear server computation. In VC-RAM, a client outsources a large memory array to a server in a preprocessing step.  ...  VC-RAM allows a client to verify the result of these RAM computations, and meanwhile, the server's computation overhead is sublinear (in the data size) for sublinear-time queries.  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the US Army Research Laboratory,  ... 
doi:10.1007/978-3-642-54631-0_8 fatcat:i36n6hbozjhztacet4yxn42mte

A Survey on Differentially Private Machine Learning [Review Article]

Maoguo Gong, Yu Xie, Ke Pan, Kaiyuan Feng, A.K. Qin
2020 IEEE Computational Intelligence Magazine  
[28] pioneered the first differentially private decision tree algo rithm that performs on the SubLinear Queries (SuLQ) interface and preserves the privacy by adding noise to the information gain.  ...  The differentially private random decision tree can be generated from the noisy leaf vector.  ... 
doi:10.1109/mci.2020.2976185 fatcat:72lxqnelszctfghmhdhdi3bk44

On Acceleration and Scalability of Number Theoretic Private Information Retrieval

Ecem Unal, Erkay Savas
2016 IEEE Transactions on Parallel and Distributed Systems  
In the proposed schemes, instead of binary decision diagrams utilized in the original CPIR, we employ an octal tree based approach, in which non-sink nodes have eight child nodes.  ...  Using octal trees offers two advantages: i) a serial implementation of the proposed scheme in software is faster than the original scheme and ii) its bandwidth usage becomes less than the original scheme  ...  Octal Trees: For performance reasons, instead of the binary decision diagrams, we propose using octal trees in our protocol.  ... 
doi:10.1109/tpds.2015.2456021 fatcat:jcralr44ojfbvac6cjktng354a
« Previous Showing results 1 — 15 out of 402 results