315 Hits in 3.9 sec

Exploring the Boundaries of Topology-Hiding Computation [chapter]

Marshall Ball, Elette Boyle, Tal Malkin, Tal Moran
2018 Lecture Notes in Computer Science  
Topology-hiding computation (THC) is a form of multi-party computation over an incomplete communication graph that maintains the privacy of the underlying graph topology.  ...  CRYPTO'17], THC protocols for securely computing any function in the semi-honest setting have been constructed.  ...  We present a protocol for semi-honest secure 2-party computation of the OR functionality given such a semi-honest topology-hiding broadcast protocol for n = 4 parties.  ... 
doi:10.1007/978-3-319-78372-7_10 fatcat:fscgavczjrbchplibu3fcjqrwu

Topology-Hiding Computation Beyond Logarithmic Diameter [chapter]

Adi Akavia, Tal Moran
2017 Lecture Notes in Computer Science  
A distributed computation in which nodes are connected by a partial communication graph is called topology-hiding if it does not reveal information about the graph (beyond what is revealed by the output  ...  Previous results [Moran, Orlov, Richelson; TCC'15] have shown that topology-hiding computation protocols exist for graphs of logarithmic diameter (in the number of nodes), but the feasibility question  ...  The situation is better in the computational setting. Moran, Orlov and Richelson showed that topology-hiding computation is possible against static, semi-honest adversaries [12] .  ... 
doi:10.1007/978-3-319-56617-7_21 fatcat:thyqywrm5rhjtbpptherebulee

Outsourcing computation for private function evaluation

Henry Carter, Patrick Traynor
2019 International Journal of Information and Computer Security  
In addition, we assume this party to be semi-honest for all protocols.  ...  Assuming a semi-honest function holder, we build on the most efficient two-party PFE constructions to develop outsourced protocols that are secure against a semi-honest, covert, or malicious Cloud server  ...  stronger than a semi-honest adversary.  ... 
doi:10.1504/ijics.2019.10024485 fatcat:bbyt2wyqubg5dkpikwxqmu6u5u

Asynchronous Provably-Secure Hidden Services [chapter]

Philippe Camacho, Fernando Krell
2018 Lecture Notes in Computer Science  
The more general problem of hiding the topology of a network has been solved recently in the secure multi-party computation setting [1, 19, 14] .  ...  Our initial protocol is secure in the semi-honest model against any number of colluding participants, and has linear communication complexity.  ...  Conclusion We have introduced a new protocol that enables to hide a server in a network in the semi-honest model.  ... 
doi:10.1007/978-3-319-76953-0_10 fatcat:4lm3dqjxpbg2nawevdgy2mznje

Topology-Hiding Computation on All Graphs [chapter]

Adi Akavia, Rio LaVigne, Tal Moran
2017 Lecture Notes in Computer Science  
A distributed computation in which nodes are connected by a partial communication graph is called topology-hiding if it does not reveal information about the graph beyond what is revealed by the output  ...  Previous results have shown that topology-hiding computation protocols exist for graphs of constant degree and logarithmic diameter in the number of nodes [Moran-Orlov-Richelson, TCC'15; Hirt et al., Crypto  ...  This resolution completes a line of works on the feasibility of topology hiding computation against a static semi-honest adversary [25, 18, 1] .  ... 
doi:10.1007/978-3-319-63688-7_15 fatcat:kjo2bxskzbdxpm33e74cdhh5ay

How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation [chapter]

Payman Mohassel, Saeed Sadeghian
2013 Lecture Notes in Computer Science  
Similar to the previous work we only consider semi-honest adversaries in this paper.  ...  We put forth a general framework for designing PFE where the task of hiding the circuit and securely evaluating its gates are addressed independently: First, we reduce the task of hiding the circuit topology  ...  semi-honest adversaries.  ... 
doi:10.1007/978-3-642-38348-9_33 fatcat:gqkxxocuyvcepc5j2sllxmfx64

AToM: Active Topology Monitoring for the Bitcoin Peer-to-Peer Network [article]

Federico Franzoni, Xavier Salleras, Vanesa Daza
2021 arXiv   pre-print
However, adversaries can bypass this limitation by inferring connections through side channels.  ...  In this paper, we thoroughly review network-level attacks and empirically show that topology obfuscation is not an effective countermeasure.  ...  To that purpose the adversary can try to hide or fake nodes, and to hide or fake connections. To hide a node, the adversary needs to avoid all connections from the monitors (whose ID is known).  ... 
arXiv:2107.12912v1 fatcat:txb4e3p6gzejtjw746spwhnhqi

Hiding in the Crowd: A Massively Distributed Algorithm for Private Averaging with Malicious Adversaries [article]

Pierre Dellenbach, Aurélien Bellet, Jan Ramon
2018 arXiv   pre-print
Our protocol can find a solution of arbitrary accuracy, does not rely on a third party and preserves the privacy of users throughout the execution in both the honest-but-curious and malicious adversary  ...  In this paper, we propose a massively distributed protocol for a large set of users to privately compute averages over their joint data, which can then be used to learn predictive models.  ...  The results clearly illustrate one of our key result: beyond the noise variance and the number of honest neighbors, the total number of honest users has a strong influence on how much variance is preserved  ... 
arXiv:1803.09984v1 fatcat:jjqbt36y6vaolp7zmlh4x6w67a

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
Our protocol is (simulation-based) secure in the presence of semi-honest adversaries, and achieves privacy in the client/server model in the presence of malicious adversaries.  ...  In this paper, we describe a new information-theoretic protocol (and a computationally-secure variant) for secure threeparty computation with an honest majority.  ...  Perfect security in the presence of semi-honest adversaries.  ... 
doi:10.1145/2976749.2978331 dblp:conf/ccs/ArakiFLNO16 fatcat:h5tasgt7mzefrocw2zzq7jvgey

A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design

Vladimir Kolesnikov, Ahmad-Reza Sadeghi, Thomas Schneider
2013 Journal of Computer Security  
General two-party Secure Function Evaluation (SFE) allows mutually distrusting parties to correctly compute any function on their private input data, without revealing the inputs.  ...  Acknowledgments The authors would like to thank Juan Garay and the anonymous reviewers of the Journal of Computer Security for their helpful comments.  ...  Consideration of semi-honest adversaries, however, is important in many typical practical settings.  ... 
doi:10.3233/jcs-130464 fatcat:h3e2udfufrcetpf2pbzz6z6mru

Secure Computation on the Web: Computing without Simultaneous Interaction [chapter]

Shai Halevi, Yehuda Lindell, Benny Pinkas
2011 Lecture Notes in Computer Science  
All our protocols are based on standard assumptions, and we achieve security both in the semi-honest and malicious adversary models.  ...  Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees.  ...  for computing f , in the presence of semi-honest adversaries.  ... 
doi:10.1007/978-3-642-22792-9_8 fatcat:b2na3m7h2rhv7c6wjo24fbjkci

Malicious-Client Security in Blind Seer: A Scalable Private DBMS

Ben A. Fisch, Binh Vo, Fernando Krell, Abishek Kumarasubramanian, Vladimir Kolesnikov, Tal Malkin, Steven M. Bellovin
2015 2015 IEEE Symposium on Security and Privacy  
Our approach also involves a novel technique for a semi-private function secure function evaluation (SPF-SFE) that may have independent applications.  ...  These properties are proved with respect to a malicious client adversary and a semi-honest index server adversary.  ...  A standard simulation argument in the semi-honest static adversary model attests that Blind Seer securely realizes F db .  ... 
doi:10.1109/sp.2015.31 dblp:conf/sp/FiscVKKKMB15 fatcat:hdgm5tzrxzcrxo5eovrx6a2b3i

Privacy-Preserving Interdomain Routing at Internet Scale

Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner
2017 Proceedings on Privacy Enhancing Technologies  
On an empirically derived dataset that approximates the topology of today's Internet (55 809 nodes), our protocols take as little as 6 s of topology-independent precomputation and only 3 s of online time  ...  The Border Gateway Protocol (BGP) computes routes between the organizational networks that make up today's Internet.  ...  Π 2 ) privately computes Alg. 1 (resp. Alg. 2) in the presence of a semi-honest adversary, corrupting at most n − 1 out of n computational parties in addition to all but one ASes.  ... 
doi:10.1515/popets-2017-0033 dblp:journals/popets/AsharovDSSSSZ17 fatcat:tl4xqlm4vjdhpasdih6ozdm4du

Efficient, Constant-Round and Actively Secure MPC

Nishanth Chandran, Juan A. Garay, Payman Mohassel, Satyanarayana Vusirikala
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
These are exciting times for secure multi-party computation (MPC).  ...  and without revealing any information beyond what can be inferred from the outcome of the computation.  ...  Our code built upon the code for n−party semi-honest secure computation provided by Ben-Efraim et al. [BLO16a] .  ... 
doi:10.1145/3133956.3134100 dblp:conf/ccs/ChandranGMV17 fatcat:ievphc2w3fhlxkkwgayyv4ia2y


Seny Kamara, Payman Mohassel, Ben Riva
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
their computational resources available to the parties.  ...  Early work on SFE-and the more general notion of multi-party computation (MPC)-focused on feasibility results; that is, demonstrating that every function can be computed securely [57, 58, 24, 10] .  ...  The most efficient 2SFE implementation for semi-honest adversaries is the one of [29] , which can securely compute AES in 0.2s.  ... 
doi:10.1145/2382196.2382280 dblp:conf/ccs/KamaraMR12 fatcat:x3ilk5w7crhn3lbu5n7lsc4zcm
« Previous Showing results 1 — 15 out of 315 results