100,838 Hits in 6.7 sec

Time, computational complexity, and probability in the analysis of distance-bounding protocols

Max Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn Talcott
2017 Journal of Computer Security  
For instance, Distance Bounding Protocols take into account the round trip time of messages and the transmission velocity to infer an upper bound of the distance between two agents.  ...  We classify such security protocols as Cyber-Physical. Time plays a key role in design and analysis of many of these protocols.  ...  Scedrov is supported in part by the AFOSR MURI "Science of Cyber Security: Modeling, Composition, and Measurement". Additional support for Scedrov from ONR.  ... 
doi:10.3233/jcs-0560 fatcat:yquvrtuxnja4dl5tkt6bt6u43q

A Note on a Privacy-Preserving Distance-Bounding Protocol [chapter]

Jean-Philippe Aumasson, Aikaterini Mitrokotsa, Pedro Peris-Lopez
2011 Lecture Notes in Computer Science  
The present paper reports results from an in-depth security analysis of that new protocol, with as main result an attack that recovers the ephemeral secrets as well as the location information of the two  ...  Distance bounding protocols enable a device to establish an upper bound on the physical distance to a communication partner so as to prevent location spoofing, as exploited by relay attacks.  ...  Acknowledgments This work was partially supported by the Marie Curie IEF project "PPIDR: Privacy-Preserving Intrusion Detection and Response in Wireless Communications", grant number: 252323.  ... 
doi:10.1007/978-3-642-25243-3_7 fatcat:j5eibckxorcw5b7sfi3oeypqaq

Towards Efficient Designs for In-network Computing with Noisy Wireless Channels

Chengzhi Li, Huaiyu Dai
2010 2010 Proceedings IEEE INFOCOM  
We focus on protocol designs that are efficient in terms of communication complexity.  ...  We first devise a general protocol for evaluating any divisible functions, addressing both one-shot (N = O(1)) and block computation, and both constant and large m scenarios; its bottleneck in different  ...  Time and message complexity are two key measures for the efficiency of distributed computing protocols.  ... 
doi:10.1109/infcom.2010.5462023 dblp:conf/infocom/LiD10 fatcat:hoovehz47nbubcvvwhjegz325q

An Efficient Single-Slow-Phase Mutually Authenticated RFID Distance Bounding Protocol with Tag Privacy [chapter]

Anjia Yang, Yunhui Zhuang, Duncan S. Wong
2012 Lecture Notes in Computer Science  
The new protocol requires the tag to evaluate a PRF function for two times only, rather than three times as in one of the most efficient mutually authenticated RFID distance bounding protocols currently  ...  Due to the requirements of being lightweight, low-cost, and efficient, it is the common objective to design new RFID distance bounding protocols which require fewer message flows and less complex cryptographic  ...  Finally, the efficiency of a distance bounding protocol is an important concern of RFID technology, due to the tag's limited computation and storage capacities.  ... 
doi:10.1007/978-3-642-34129-8_25 fatcat:g4k3nyql4bddbabcsv4yfxb4rq

Security of Distance-Bounding

Gildas Avoine, Jorge Munilla, Alberto Peinado, Kasper Bonne Rasmussen, Dave Singelée, Aslan Tchamkerten, Rolando Trujillo-Rasua, Serge Vaudenay, Muhammed Ali Bingöl, Ioana Boureanu, Srdjan čapkun, Gerhard Hancke (+4 others)
2018 ACM Computing Surveys  
Distance bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity.  ...  This survey analyzes and compares in a unified manner many existing distance bounding protocols with respect to several key security and complexity features.  ...  This is the worst case scenario. The success probability of an attacker depends on . This often makes the analysis more complex and the comparison of various distance-bounding protocols difficult.  ... 
doi:10.1145/3264628 fatcat:cn734ifv5fhczfjjviwexu7cti

Complexity of Distance Fraud Attacks in Graph-Based Distance Bounding [chapter]

Rolando Trujillo-Rasua
2014 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds.  ...  The novel algorithm improves the computational complexity O(2^2^n+n) of the naive approach to O(2^2nn) where n is the number of rounds.  ...  The author thanks to Gildas Avoine, Sjouke Mauw, Juan Alberto Rodriguez-Velazquez, and Alejandro Estrada-Moreno for their invaluable comments and feedback.  ... 
doi:10.1007/978-3-319-11569-6_23 fatcat:l56v2jsjnje3zmiddwqek62cem

Probabilistic communication complexity

Ramamohan Paturi, Janos Simon
1986 Journal of computer and system sciences (Print)  
The upper bounds which we obtained for the functions-quality and verification of Hamming distance-are considerably better than their counterparts in the deterministic, the nondeterministic, and the bounded  ...  Communication is a bottleneck in many distributed computations. In VLSI, communication constraints dictate lower bounds on the performance of chips.  ...  The efftcient protocol for the verilication of Hamming distance is suggested by P. Berman, who also helped in clarifying some of our ideas. We are grateful for their help.  ... 
doi:10.1016/0022-0000(86)90046-2 fatcat:6qtle3lbafaatpnonrk2xqqtdq

Continuous monitoring in the dynamic sensor field model

C. Àlvarez, J. Díaz, D. Mitsche, M. Serna
2012 Theoretical Computer Science  
We study the Continuous Monitoring problem by providing bounds on the performance of several protocols that differ in the use of mobility and the placement of the devices.  ...  Accordingly, we introduce two additional performance measures: the total traveled distance in a computational step and the gathering period.  ...  Acknowledgment The authors wish to thank an anonymous referee for pointing out suggestions to improve the complexity analysis.  ... 
doi:10.1016/j.tcs.2012.05.012 fatcat:ojjgvs26zfgqnphbfty25fqyyq

UWB impulse radio based distance bounding

Marc Kuhn, Heinrich Luecken, Nils Ole Tippenhauer
2010 2010 7th Workshop on Positioning, Navigation and Communication  
Distance Bounding (DB) protocols are authentication protocols designed to protect against these attacks.  ...  They determine an upper bound on the physical distance between two communication parties -the verifier V (e.g. a door requiring an access key) and the prover P (e.g. a wireless key device).  ...  ACKNOWLEDGMENTS This work was supported by the Zurich Information Security Center and by the Communication Technology Laboratory of ETH Zurich. It represents the views of the authors.  ... 
doi:10.1109/wpnc.2010.5653801 dblp:conf/wpnc/KuhnLT10 fatcat:pkdarc46ubaarepdnygmtqzqvm

Efficient In-Network Computing with Noisy Wireless Channels

Chengzhi Li, Huaiyu Dai
2013 IEEE Transactions on Mobile Computing  
We focus on protocol designs that are efficient in terms of communication complexity.  ...  We also analyze the bottleneck of this general protocol in different scenarios, which provides insights into designing more efficient protocols for specific functions.  ...  ACKNOWLEGEMENTS This work was supported in part by the US National Science Foundation under Grant CCF-0721815, CCF-0830462 and ECCS-1002258.  ... 
doi:10.1109/tmc.2012.185 fatcat:yqebxpwxkbgffh4nt5lslv6ptq

Opportunistic Information Dissemination in Mobile Ad-hoc Networks: adaptiveness vs. obliviousness and randomization vs. determinism [article]

Martin Farach-Colton, Antonio Fernandez Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks
2011 arXiv   pre-print
Under the above framework, we show negative and positive results for different types of randomized protocols, and we put those results in perspective with respect to previous deterministic results.  ...  In this setup informed and uninformed nodes can be disconnected for some time (bounded by a parameter alpha), but eventually some uninformed node must become neighbor of an informed node and remain so  ...  Acknowledgements We thank Seth Gilbert for triggering the development of this work asking a question at DISC 2010.  ... 
arXiv:1105.6151v1 fatcat:6jg3wji6tbb5zd5ae5votxp6oy

New Applications of the Incompressibility Method (Extended Abstract) [chapter]

Harry Buhrman, Paul Vitányi, Tao Jiang, Ming Li
1999 Lecture Notes in Computer Science  
We show that it is particularly suited to obtain average-case computational complexity lower bounds. Such lower bounds have been difficult to obtain in the past by other methods.  ...  In this paper we present four new results and also give four new proofs of known results to demonstrate the power and elegance of the new method.  ...  us to the paper [3] , and Osamu Watanabe for drawing our attention to the random walk problem.  ... 
doi:10.1007/3-540-48523-6_19 fatcat:rjcftm67n5fn3ndynpc2fgqcza

ID-Based Secure Distance Bounding and Localization [chapter]

Nils Ole Tippenhauer, Srdjan Čapkun
2009 Lecture Notes in Computer Science  
In this paper, we propose a novel ID-based secure distance bounding protocol.  ...  Unlike traditional secure distance measurement protocols, our protocol is based on standard insecure distance measurement as elemental building block, and enables the implementation of secure distance  ...  Acknowledgements This work was partially supported by the Zurich Information Security Center. It represents the views of the authors.  ... 
doi:10.1007/978-3-642-04444-1_38 fatcat:glgeut66k5gyhawd6idbnvdkk4

The Limits of Two-Party Differential Privacy

Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, Salil Vadhan
2010 2010 IEEE 51st Annual Symposium on Foundations of Computer Science  
Our results imply almost tight lower bounds on the accuracy of such data analyses, both for specific natural functions (such as Hamming distance) and in general.  ...  In addition, those bounds demonstrate a dramatic gap between the accuracy that can be obtained by differentially private data analysis versus the accuracy obtainable when privacy is relaxed to a computational  ...  We note that the connection between differential-privacy and communication complexity can be used to prove lower bounds on the error in computing specific functions for which lower bounds on the communication  ... 
doi:10.1109/focs.2010.14 dblp:conf/focs/McGregorMPRTV10 fatcat:rlirnnfyxnhkjga3ha54t6jmw4

Page 3852 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
The time complexity of this protocol is a significant improvement over currently known protocols for this problem.  ...  We also give a family of protocols with message and time complexities O( Nk) and O(N/k), respectively, where log N < k < N.  ... 
« Previous Showing results 1 — 15 out of 100,838 results