Filters








56,144 Hits in 3.5 sec

Communication Protocols for Secure Distributed Computation of Binary Functions

Eytan Modiano, Anthony Ephremides
<span title="">2000</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
In this paper we develop communication protocols which allow for such computation to take place while maintaining the value of the function secret to an eavesdropper.  ...  A common task in parallel processing is the distributed computation of a function by a number of processors, each of which possesses partial information relevant to the value of that function.  ...  INTRODUCTION This paper examines the communication complexity of secure distributed computation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/inco.2000.2865">doi:10.1006/inco.2000.2865</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5af6l27pvffndlrbbxvmogblyy">fatcat:5af6l27pvffndlrbbxvmogblyy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080610190650/http://www.mit.edu/~modiano/papers/J12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5d/ab/5dab3b579b7a4c5add6e32446f0f01864b5963a8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/inco.2000.2865"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Secure Extraction of Association Rule from Distributed Database

Mahale MohiniV, Shaikh I.R.
<span title="2015-05-20">2015</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
Which offers enhanced privacy with respect to the protocol in [1] Also, it is more simple and significantly more effective in terms of communication rounds, communication cost and computational cost.  ...  The proposed system given here provides a secure and efficient solution for the problem stated above.  ...  We propose here an alternative protocol for the secure computation of the union of private subsets.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/20536-2896">doi:10.5120/20536-2896</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/obprdvxztnallpfonbtmxermh4">fatcat:obprdvxztnallpfonbtmxermh4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922213404/http://research.ijcaonline.org/volume117/number3/pxc3902896.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e2/c4/e2c4c685cbae6ccf21f10b6658207347bd8a3537.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/20536-2896"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Scalable and Secure Polling in Dynamic Distributed Networks

Sebastien Gambs, Rachid Guerraoui, Hamza Harkous, Florian Huc, Anne-Marie Kermarrec
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vb3ehoarofgm5p24f2dqjxmp3a" style="color: black;">2012 IEEE 31st Symposium on Reliable Distributed Systems</a> </i> &nbsp;
Whereas previous distributed solutions had a communication cost of O(n 2 ) in an n nodes system, we present SPP (Secure and Private Polling), the first distributed polling protocol requiring only a communication  ...  Our protocol ensures perfect security against a computationally-bounded adversary, tolerates ( 1 2 − )n Byzantine nodes for any constant 1 2 > > 0 (not depending on n), and outputs the exact value of the  ...  In [2] , a polling protocol (a specific case of secure multiparty computation) was proposed that computes the outcome of an electronic election while providing cryptographic security for a global communication  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/srds.2012.63">doi:10.1109/srds.2012.63</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/srds/GambsGHHK12.html">dblp:conf/srds/GambsGHHK12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7hnjsjmcbjdetcivlnf6g4jy5m">fatcat:7hnjsjmcbjdetcivlnf6g4jy5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170816033107/https://infoscience.epfl.ch/record/180536/files/SRDS-camera-ready.pdf?version=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ba/6e/ba6ece43ef32ca8f82cbfc623a8eb1675636546d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/srds.2012.63"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

How to securely compute the modulo-two sum of binary sources

Deepesh Data, Bikash K. Dey, Manoj Mishra, Vinod M. Prabhakaran
<span title="">2014</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jyfj6ubbwzcqdb2m3vg7epe6tu" style="color: black;">2014 IEEE Information Theory Workshop (ITW 2014)</a> </i> &nbsp;
In secure multiparty computation, mutually distrusting users in a network want to collaborate to compute functions of data which is distributed among the users.  ...  For concreteness and simplicity, we consider a secure version of the function computation problem of K\"orner and Marton (1979) where two users observe a doubly symmetric binary source with parameter p  ...  ACKNOWLEDGMENT The work was supported in part by the Bharti Centre for Communication, IIT Bombay, a grant from the Information Technology Research Academy, Media Lab Asia, to IIT Bombay and TIFR, a grant  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/itw.2014.6970881">doi:10.1109/itw.2014.6970881</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/itw/DataDMP14.html">dblp:conf/itw/DataDMP14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oec67n65q5edln3dfzj22sd3ca">fatcat:oec67n65q5edln3dfzj22sd3ca</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200906023415/https://arxiv.org/pdf/1405.2555v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/dd/51/dd516254933ca1a26519e683f45d12fdbbc3ffa4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/itw.2014.6970881"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Computation and Communication Efficient Key Distribution Protocol for Secure Multicast Communication

<span title="2013-04-30">2013</span> <i title="Korean Society for Internet Information (KSII)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hupfbobgkvepdnt5g32qxkypsy" style="color: black;">KSII Transactions on Internet and Information Systems</a> </i> &nbsp;
Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications.  ...  The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided.  ...  The main objective of this work is to reduce the computation complexity as well as the communication complexity in the design of the new key distribution protocol.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3837/tiis.2013.04.016">doi:10.3837/tiis.2013.04.016</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tbjf4qf7gndjpg3g5nqe5w6sle">fatcat:tbjf4qf7gndjpg3g5nqe5w6sle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220225021729/http://itiis.org/digital-library/manuscript/file/20290/TIISVol7No4-16.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/55/11/5511efd1aa56242871aabc5f39e2809b928d97f4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3837/tiis.2013.04.016"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

An elementary completeness proof for secure two-party computation primitives

Ye Wang, Prakash Ishwar, Shantanu Rane
<span title="">2014</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jyfj6ubbwzcqdb2m3vg7epe6tu" style="color: black;">2014 IEEE Information Theory Workshop (ITW 2014)</a> </i> &nbsp;
For semi-honest parties and informationtheoretic security guarantees, it is well-known that, if only noiseless communication is available, only a limited set of functions can be securely computed; however  ...  In the secure two-party computation problem, two parties wish to compute a (possibly randomized) function of their inputs via an interactive protocol, while ensuring that neither party learns more than  ...  secure computation objective of the protocol. functions can be securely computed by two parties (see [1] for example).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/itw.2014.6970886">doi:10.1109/itw.2014.6970886</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/itw/WangIR14.html">dblp:conf/itw/WangIR14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/axnbifdpuzhqpdvajo54q24bye">fatcat:axnbifdpuzhqpdvajo54q24bye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809160008/http://msw3.stanford.edu/~srane/docs/wang14itw.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e6/b8/e6b8f46d9cf01b9808ec3652846d53397739fc86.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/itw.2014.6970886"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Can Ternary Computing Improve Information Assurance?

Bertrand Cambou, Paul Flikkema, James Palmer, Donald Telesca, Christopher Philabaum
<span title="2018-03-02">2018</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ld7penalpndgxesxlh3sf425ee" style="color: black;">Cryptography</a> </i> &nbsp;
encryption scheme between a computer and smartcard based on public key exchange through non-secure communication channels to demonstrate the value of balanced ternary systems.  ...  The concurrent generation of private keys by the computer and the smartcard uses ternary schemes and cryptographic primitives such as ternary physical unclonable functions.  ...  We also thank the professionals of the Air Force Research Lab, Rome, NY, and Alion Science and Technology, who supported this effort.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/cryptography2010006">doi:10.3390/cryptography2010006</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5pxyflzvsffglggmjvmk2kjovu">fatcat:5pxyflzvsffglggmjvmk2kjovu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727134219/https://res.mdpi.com/def502003316f290645a92f586de4016ba11caf6bb7ee4274a7ffe96de1443073ef382144328ce2bfd8c4225cedb4bf7b8a2c1c8a1071ef8b819e2f2cb852966882f669f7abe0b8127177b0316de1767a69b56af6f8898959e43c2dee0dfb0f5a52259b88d7cd2c06af6d3478ab952847f9e2191fb919f8d930e1f11c99f4edff8b3028848b843aacad8434c2f2d72796024dca7e58d9f3f23562a66e8dbd3?filename=&amp;attachment=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/13/f9/13f9cceb2f866482d98b06d807b4c1f317be2b18.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/cryptography2010006"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

CrypTen: Secure Multi-Party Computation Meets Machine Learning [article]

Brian Knott and Shobha Venkataraman and Awni Hannun and Shubho Sengupta and Mark Ibrahim and Laurens van der Maaten
<span title="2021-09-02">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We hope that CrypTen will spur adoption of secure MPC in the machine-learning community.  ...  Secure multi-party computation (MPC) allows parties to perform computations on data while keeping that data private.  ...  We thank Mark Tygert, Anderson Nascimento, Amrita Roy Chowdhury, and anonymous reviewers for helpful discussions and feedback on early versions of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.00984v1">arXiv:2109.00984v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vozpjrqnknanjnevo2tkxsttni">fatcat:vozpjrqnknanjnevo2tkxsttni</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210905135421/https://arxiv.org/pdf/2109.00984v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f9/24/f9244f132e90ab558f19016f1cb6f7d19e75c368.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2109.00984v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

On the Authentication of RFID Systems with Bitwise Operations

Basel Alomair, Radha Poovendran
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/eos2wcrsbjefzfl5cuyiqhvwj4" style="color: black;">2008 New Technologies, Mobility and Security</a> </i> &nbsp;
Our work aims to provide guidelines for protocol designers in order to avoid pitfalls that can dangerously undermine the security of the designed protocols.  ...  Due to the stringent computational capabilities of low-cost RFID tags, many lightweight authentication protocols have been proposed recently aiming to achieve secure authentication via bitwise operations  ...  Communication Model At the heart of any entity authentication or secure key exchange protocol there is a MAC.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ntms.2008.ecp.74">doi:10.1109/ntms.2008.ecp.74</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ntms/AlomairP08.html">dblp:conf/ntms/AlomairP08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bvzlzuzbxjgnrfabhe64h4jaye">fatcat:bvzlzuzbxjgnrfabhe64h4jaye</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090115230851/http://www.ee.washington.edu/research/nsl/papers/NTMS-08.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d3/bc/d3bc00835b89bb1efd32d3bd0cedd2d5d62f0501.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ntms.2008.ecp.74"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation [article]

Ye Wang, Prakash Ishwar
<span title="2009-02-04">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We propose an information theoretic framework for the secure two-party function computation (SFC) problem and introduce the notion of SFC capacity.  ...  Finally, leveraging our OT protocol, we construct a protocol for SFC and establish a general lower bound on SFC capacity of the binary erasure channel and source.  ...  Secure Two-Party Function Computation Two parties, Alice and Bob, each have k samples of a jointly distributed source on the finite alphabets A × B, where Alice possesses A k {A 1 , . . . , A k } ∈ A k  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0902.0822v1">arXiv:0902.0822v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qmdxmkctefbubdpvzmpjyirfge">fatcat:qmdxmkctefbubdpvzmpjyirfge</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0902.0822/0902.0822.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0902.0822v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Theory and application of trapdoor functions

Andrew C. Yao
<span title="">1982</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v4uclqixrrhlnk5pbw4wii6cfq" style="color: black;">23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)</a> </i> &nbsp;
More formally, Alice uses the randomization protocol to provide value Y E y when asked for the value X E X , given a posteriori probability distribution function (pdf) P(Y1X).  ...  For this problem, however, the channel view gives access to a number of major theorems in communication and coding theory that have implications for attacks and the security of randomization.  ...  More formally, Alice uses the randomization protocol to provide value Y E y when asked for the value X E X , given a posteriori probability distribution function (pdf) P(Y1X).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sfcs.1982.45">doi:10.1109/sfcs.1982.45</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/focs/Yao82a.html">dblp:conf/focs/Yao82a</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fl4yruxgrne6hccuc5z5qb7mki">fatcat:fl4yruxgrne6hccuc5z5qb7mki</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100616063203/http://www.seas.gwu.edu/~poorvi/isit03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bd/f3/bdf3dc7f2988ec5bf0e740ab6f11331438e81844.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/sfcs.1982.45"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Building Oblivious Transfer on Channel Delays [chapter]

Paolo Palmieri, Olivier Pereira
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We analyze the security of our construction in the semi-honest setting, showing that our realization of OT substantially decreases the protocol sensitivity to the user's knowledge of the channel compared  ...  In order to have a model for the delays that is both general and comparable to the channels usually used for OT -such as the Binary Symmetric Channel (BSC) -we introduce a new noisy channel, the Binary  ...  Olivier Pereira is a Research Associate of the F.R.S.-FNRS. We also want to thank Abdellatif Zaidi and Luc Vandendorpe for interesting discussions on the subject.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-21518-6_10">doi:10.1007/978-3-642-21518-6_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rcueiyksynfi3bbc4wqi4eo4b4">fatcat:rcueiyksynfi3bbc4wqi4eo4b4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809090427/https://uclouvain.be/crypto/services/download/publications.pdf.abff2911710bcf40.4f542d6469736f726465722e706466.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fb/31/fb31ba2dee98543b2b35c174449c943906793e18.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-21518-6_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models based on Pre-Computation

Martine De Cock, Rafael Dowsley, Caleb Horst, Raj Katti, Anderson Nascimento, Wing-Sea Poon, Stacey Truex
<span title="">2017</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/okrr6mjegfbtbjrfrxtci54s6i" style="color: black;">IEEE Transactions on Dependable and Secure Computing</a> </i> &nbsp;
We show that our protocols for privacy-preserving classification lead to more efficient results from the point of view of computational and communication complexities.  ...  Our solutions is composed out of building blocks, namely a secure comparison protocol, a protocol for obliviously selecting inputs, and a protocol for multiplication.  ...  In the case a trusted authority is not available or desirable, Alice and Bob can pre-compute this data by themselves, during a setup phase, with the help of wellknown computationally secure schemes.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tdsc.2017.2679189">doi:10.1109/tdsc.2017.2679189</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lj2xqvetwfbtfl4w4524er4xsi">fatcat:lj2xqvetwfbtfl4w4524er4xsi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170517162217/http://eprint.iacr.org:80/2016/736.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f2/e7/f2e72b20da50ce05fc4a65d6edfab3af34f3f36c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tdsc.2017.2679189"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Key Agreement with Modified Batch Rekeying for Distributed Group in Cognitive Radio Networks [chapter]

N. Renugadevi, C. Mala
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
A key distribution protocol which uses parametric OWF and Euler's totient function [15] for achieving high level of security with reduced computation time was developed for secure multicast communication  ...  The security of proposed TKTOFT protocol is based on one way property of hash function.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-24315-3_16">doi:10.1007/978-3-319-24315-3_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/caxbkprypfeq3k7ob3iapedrwm">fatcat:caxbkprypfeq3k7ob3iapedrwm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501192349/https://hal.inria.fr/hal-01466215/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/c2/d4c27826ef2dc5b0de2669918be8f8e80f62d36d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-24315-3_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Secure Computation to Hide Functions of Inputs [article]

Gowtham R. Kurri, Vinod M. Prabhakaran
<span title="2020-05-11">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
For the distribution-free setting, i.e., when the protocol must be correct and private for any joint input distribution, we completely characterize the set of all securely computable functions.  ...  We consider a two-user secure computation problem in which Alice and Bob communicate interactively in order to compute some deterministic functions of the inputs.  ...  With this input distribution, there does not exist a secure protocol since the problem reduces to twouser secure computation of binary AND function (as Y = Y ) which is impossible [9] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.05111v1">arXiv:2005.05111v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ez6dz7rwerbvhl7bagc62lms4e">fatcat:ez6dz7rwerbvhl7bagc62lms4e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200528013645/https://arxiv.org/pdf/2005.05111v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2005.05111v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 56,144 results