10,940 Hits in 5.1 sec

The Adversarial Noise Threshold for Distributed Protocols [article]

William M. Hoza, Leonard J. Schulman
2015 arXiv   pre-print
We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology.  ...  Next we investigate adversarial per-edge error rates, where the adversary is given an error budget on each edge of the network.  ...  The paper closest to our work is [JKL15], which initiated the study of adversarial noise in protocols among n > 2 parties.  ... 
arXiv:1412.8097v2 fatcat:kll72avwxzakrpznqyr3iylwum

The Adversarial Noise Threshold for Distributed Protocols

William M. Hoza, Leonard J. Schulman
2015 Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms  
We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology.  ...  However, the construction that approaches this limit has exponential round complexity, so we give another compiler, which transforms T -round protocols into O(mT )-round simulations, and prove that for  ...  Introduction We consider the problem of protecting distributed protocols from channel noise.  ... 
doi:10.1137/1.9781611974331.ch18 dblp:conf/soda/HozaS16 fatcat:zwxdbkfe7fdt3m7hgm6nvfvvam

Towards jamming-resistant and competitive medium access in the SINR model

Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
2011 Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students - S3 '11  
These MAC protocols exploit the remaining ε-fraction optimally in the sense that a significant part is used for successful transmissions.  ...  plus noise ratio (SINR) at the receiver.  ...  In our network, nodes are distributed on a square grid (i.e., the number of nodes is n = a × a for some parameter a), and we allow the simplistic adversary to evenly allocate its jamming budget (B = 200  ... 
doi:10.1145/2030686.2030697 dblp:conf/mobicom/RichaSSZ11 fatcat:l5l6cnp5vrdu7gh2pmi57dt27y

Private Similarity Computation in Distributed Systems: From Cryptography to Differential Privacy [chapter]

Mohammad Alaggan, Sébastien Gambs, Anne-Marie Kermarrec
2011 Lecture Notes in Computer Science  
More specifically, we design several differentially private variants of the exact and threshold protocols that rely on the addition of random noise tailored to the sensitivity of the considered similarity  ...  First, we introduce a two-party protocol for privately computing a threshold version of the similarity and apply it to well-known similarity measures such as the scalar product and the cosine similarity  ...  Acknowledgements We are very grateful to the anonymous reviewers for their constructive comments that have help us to improve the quality of this paper.  ... 
doi:10.1007/978-3-642-25873-2_25 fatcat:frtihvrscjc4ti4cqipmv57saa

Tripartite Quantum State Sharing

Andrew M. Lance, Thomas Symul, Warwick P. Bowen, Barry C. Sanders, Ping Koy Lam
2004 Physical Review Letters  
We characterize this (2,3) threshold quantum state sharing scheme in terms of fidelity, signal transfer and reconstruction noise.  ...  We demonstrate a multipartite protocol to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players.  ...  Similarly, Fig. 5 shows the points for the f2; 3g protocol for a range of gains together with the corresponding adversary structure f1g.  ... 
doi:10.1103/physrevlett.92.177903 pmid:15169193 fatcat:7t7msdw2dnayzml4lbozjdgezq

Modeling Enlargement Attacks Against UWB Distance Bounding Protocols

Alberto Compagno, Mauro Conti, Antonio Alberto D'Amico, Gianluca Dini, Pericle Perazzo, Lorenzo Taponecco
2016 IEEE Transactions on Information Forensics and Security  
The contribution of this paper is to provide a probabilistic model for the success of an enlargement attack against a distance bounding protocol realized with the IEEE 802.15.4a UWB standard.  ...  The model captures several variables, like the propagation environment, the signal-to-noise ratio, and the time-of-arrival (TOA) estimation algorithm.  ...  The lower the adversarial signal-to-noise ratio is, the longer T shft , because the malicious pulse passes the noise threshold later in time.  ... 
doi:10.1109/tifs.2016.2541613 fatcat:etpy7m4mobd7vh5rjdscasiif4

Quantum state sharing

Andrew M. Lance, Thomas Symul, Warwick P. Bowen, Barry C. Sanders, Ping Koy Lam, Peter Heszler
2004 Fluctuations and Noise in Photonics and Quantum Optics II  
We demonstrate a multipartite protocol that utilizes entanglement to securely distribute and reconstruct a quantum state.  ...  This (2, 3) threshold quantum state sharing scheme is characterized in terms of fidelity (F), signal transfer (T ) and reconstruction noise (V).  ...  The authors wish to thank Timothy Ralph, Tomáš Tyc, Roman Schnabel and Hans Bachor for useful discussions and the support of the Australian Research Council and iCORE.  ... 
doi:10.1117/12.546945 fatcat:6le4ifskcbeqhb64y5xmcevcme

A Model for Adversarial Wiretap Channels and its Applications

Reihaneh Safavi-Naini, Pengwei Wang
2015 Journal of Information Processing  
We consider a coding-theoretic model for wiretap channels with active adversaries who can choose their view of the communication channel and also add adversarial noise to the channel.  ...  Wyner's insight was that the difference in noise between the two channels can be used to provide perfect secrecy for communication between Alice and Bob, against the eavesdropper Eve.  ...  Acknowledgments This work is supported in part by Alberta Innovates Technology Futures, in the Province of Alberta, Canada.  ... 
doi:10.2197/ipsjjip.23.554 fatcat:fuudrnzbjvhdxiuchts6ps5bgm

Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems [chapter]

Rikke Bendlin, Ivan Damgård
2010 Lecture Notes in Computer Science  
We also describe how one can build a distributed key generation protocol.  ...  We prove the threshold cryptosystem secure against passive adversaries corrupting all but one of the players, and againts active adversaries corrupting less than one third of the players.  ...  Distributed Decryption for Stronger Adversaries The protocol for doing distributed decryption against a passive adversary corrupting less than t = u − 1 players, can easily be turned into a protocol secure  ... 
doi:10.1007/978-3-642-11799-2_13 fatcat:z7nfmj2q6rhp3ntud6dn33xqjq

Anonymity Trilemma: Strong Anonymity, Low Bandwidth Overhead, Low Latency - Choose Two

Debajyoti Das, Sebastian Meiser, Esfandiar Mohammadi, Aniket Kate
2018 2018 IEEE Symposium on Security and Privacy (SP)  
We thank the reviewers for their valuable comments.  ...  This work has been partially supported by the Zurich Information Security Center (ZISC), the European Commission through H2020-DS-2014-653497 PANORAMIX, the EPSRC Grant EP/M013-286/1, and the National  ...  Results for our user distributions imply results for similar distributions, if a reduction proof can show that they are less favorable to the protocol. 1 Adversaries.  ... 
doi:10.1109/sp.2018.00011 dblp:conf/sp/Das0MK18 fatcat:vvctjkwvzvf7zoxha76zhsihbi

Page 6758 of Mathematical Reviews Vol. , Issue 2000i [page]

2000 Mathematical Reviews  
An unfair noisy channel has a known range of possible noise lev- els; protocols must work for any level within this range against adversaries who know the actual noise level.  ...  If the upper bound on the noise is above a threshold (given as a function of the lower bound) then no information-theoretic reductions from OT (even against pas- sive adversaries) or BC exist; when it  ... 

Continuous-variable quantum-state sharing via quantum disentanglement

Andrew M. Lance, Thomas Symul, Warwick P. Bowen, Barry C. Sanders, Tomáš Tyc, T. C. Ralph, Ping Koy Lam
2005 Physical Review A. Atomic, Molecular, and Optical Physics  
This protocol utilizes entanglement for the secret state distribution, and a class of "quantum disentangling" protocols for the state reconstruction.  ...  We demonstrate a quantum state sharing protocol in which a tripartite entangled state is used to encode and distribute a secret state to three players.  ...  ACKNOWLEDGMENTS The authors wish to thank Roman Schnabel, David Pulford, and Hans Bachor for useful discussions and the support of the Australian Research Council, Australian Department of Defence and  ... 
doi:10.1103/physreva.71.033814 fatcat:or5ydhcgh5go3hcxibm6y34uyy

Security Properties of Gait for Mobile Device Pairing

Arne Bruesch, Le Nguyen, Dominik Schurmann, Stephan Sigg, Lars C. Wolf
2019 IEEE Transactions on Mobile Computing  
Gait has been proposed as a feature for mobile device pairing across arbitrary positions on the human body.  ...  For one of the schemes considered, we present modifications to fix an identified security flaw.  ...  ACKNOWLEDGMENT We appreciate partial funding in the frame of an EIT Digital HII Active project, as well as from the Academy of Finland and from the German Academic Exchange Service (DAAD).  ... 
doi:10.1109/tmc.2019.2897933 fatcat:d7ny77nwefelvhxpwyiecc7xiq

R-LWE-Based Distributed Key Generation and Threshold Decryption

Ferran Alborch, Ramiro Martínez, Paz Morillo
2022 Mathematics  
In this work, we will give two original threshold protocols based in the lattice problem R-LWE: one for key generation and one for decryption.  ...  Furthermore, the application of cryptographic techniques to different areas, like electronic voting, has also nourished a great interest in distributed cryptography.  ...  the place of the TTP in the threshold decryption protocol.  ... 
doi:10.3390/math10050728 fatcat:doq3cqrn3bdi3iwap6rhfnoiae

Competitive MAC under Adversarial SINR [article]

Adrian Ogierman, Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
2013 arXiv   pre-print
The second contribution of this paper is a distributed MAC protocol which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures  ...  While this problem has already been studied intensively for simplistic single-hop or unit disk graph models, we make a leap forward and study MAC protocols for the SINR interference model (a.k.a. the physical  ...  The authors would like to thank Michael Meier from Paderborn University for his help with the evaluation of the protocol.  ... 
arXiv:1307.7231v1 fatcat:b6vq54xrgrhitgfao5fg2uvryq
« Previous Showing results 1 — 15 out of 10,940 results