Filters








301 Hits in 3.5 sec

Reliable broadcast with respect to topology knowledge

Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2016 Distributed computing  
On the positive side we devise protocols that match the obtained bounds and thus, exactly characterize the classes of graphs in which Reliable Broadcast is possible.  ...  We also provide an adaptation of CPA against general adversaries and show its uniqueness in this case too.  ...  CPA Uniqueness in Ad Hoc Networks Based on the above definitions we can now prove the CPA uniqueness conjecture for ad hoc networks, which was posed as an open problem in [14] .  ... 
doi:10.1007/s00446-016-0279-6 fatcat:zcgrj45w7bfyboovk75h23ensm

Reliable Broadcast with Respect to Topology Knowledge [chapter]

Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2014 Lecture Notes in Computer Science  
On the positive side we devise protocols that match the obtained bounds and thus, exactly characterize the classes of graphs in which Reliable Broadcast is possible.  ...  We also provide an adaptation of CPA against general adversaries and show its uniqueness in this case too.  ...  CPA Uniqueness in Ad Hoc Networks Based on the above definitions we can now prove the CPA uniqueness conjecture for ad hoc networks, which was posed as an open problem in [14] .  ... 
doi:10.1007/978-3-662-45174-8_8 fatcat:mu43bnhnxnf23lhqfskbf6qcgu

Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack [chapter]

Yevgeniy Dodis, Nelly Fazio
2002 Lecture Notes in Computer Science  
We introduce for the first time a precise formalization of an appropriate notion of adaptive security for public key Broadcast Encryption Schemes, for both the CPA and the CCA2 setting, which naturally  ...  A (public key) Trace and Revoke Scheme combines the functionality of broadcast encryption with the capability of traitor tracing.  ...  Acknowledgments We wish to thank Jonathan Katz, Yevgeniy Kushnir, Antonio Nicolosi and Victor Shoup for helpful observations on an preliminary version of the paper and the anonymous referees for useful  ... 
doi:10.1007/3-540-36288-6_8 fatcat:upje6ra2ufertn37yowfx2u4ma

Consistent Synchronous Group Off-The-Record Messaging with SYM-GOTR

Michael Schliep, Eugene Vasserman, Nicholas Hopper
2018 Proceedings on Privacy Enhancing Technologies  
We describe SYM-GOTR, a protocol for secure Group Off-The-Record (GOTR) messaging.  ...  We analyze the performance of SYM-GOTR in a real world deployment scenario and discuss the challenges of providing a usable implementation without compromising the security of the conversation.  ...  Acknowledgments We thank Roger Dingledine and Aaron Johnson for key discussion on the system model and properties of secure messaging.  ... 
doi:10.1515/popets-2018-0027 dblp:journals/popets/SchliepVH18 fatcat:cypqlbggxvdbtfuzlh45ouilu4

SR3: secure resilient reputation-based routing

Karine Altisen, Stéphane Devismes, Raphaël Jamet, Pascal Lafourcade
2016 Wireless networks  
We propose SR3, a secure and resilient algorithm for convergecast routing in WSNs. SR3 uses lightweight cryptographic primitives to achieve data confidentiality and data packet unforgeability.  ...  SR3 has a security proven by formal tool. We made simulations to show the resiliency of SR3 against various scenarios, where we mixed selective forwarding, blackhole, wormhole, and Sybil attacks.  ...  So, the bound on this FG game depends on the advantage Adv PRP−CPA F (B) of any adversary B in a PRP-CPA game.  ... 
doi:10.1007/s11276-016-1273-4 fatcat:6n4awryfrja2ndrxupqybh6uy4

SR3: Secure Resilient Reputation-based Routing

Karine Altisen, Stephane Devismes, Raphael Jamet, Pascal Lafourcade
2013 2013 IEEE International Conference on Distributed Computing in Sensor Systems  
We propose SR3, a secure and resilient algorithm for convergecast routing in WSNs. SR3 uses lightweight cryptographic primitives to achieve data confidentiality and data packet unforgeability.  ...  SR3 has a security proven by formal tool. We made simulations to show the resiliency of SR3 against various scenarios, where we mixed selective forwarding, blackhole, wormhole, and Sybil attacks.  ...  So, the bound on this FG game depends on the advantage Adv PRP−CPA F (B) of any adversary B in a PRP-CPA game.  ... 
doi:10.1109/dcoss.2013.33 dblp:conf/dcoss/AltisenDJL13 fatcat:mjk44aq56fhixgcttbj53n2ofm

A Traitor Tracing Scheme Based on RSA for Fast Decryption [chapter]

John Patrick McGregor, Yiqun Lisa Yin, Ruby B. Lee
2005 Lecture Notes in Computer Science  
Traitor tracing schemes deter piracy in broadcast encryption systems by enabling the identification of authorized users known as traitors that contribute to unauthorized pirate decoders.  ...  Each authorized user needs to store only a single decryption key, and decryption primarily consists of a single modular exponentiation operation.  ...  Acknowledgements The authors thank Scott Contini, Jeremy Horwitz, Joe Kilian, and Benny Pinkas for their suggestions and pointers regarding the security analysis.  ... 
doi:10.1007/11496137_5 fatcat:odmxaynh4zfzhomg34c77dbyku

General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction: Table 1

Akinori Kawachi, Yoshio Okamoto, Keisuke Tanaka, Kenji Yasunaga
2016 Computer journal  
Our construction can be applied to protocols for synchronous channels, and preserves a strict Nash equilibrium of the original protocol.  ...  Then, for any constant m ≥ 1, we obtain an expected constant-round protocol that achieves a Nash equilibrium with the optimal coalition resilience ⌈ n 2 ⌉ − m − 1 in the presence of m unexpectedly behaving  ...  , 25106509, and 15H00851, and MEXT Grant-in-Aid for Scientific Research on Innovative Areas Number 24106009.  ... 
doi:10.1093/comjnl/bxw094 fatcat:7fpjyuzwyrhrlobwhne77onh3a

Securing wireless sensor networks against large-scale node capture attacks

Tuan Manh Vu, Reihaneh Safavi-Naini, Carey Williamson
2010 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security - ASIACCS '10  
We provide detailed mathematical analysis and a security proof for the system, and use extensive simulation to validate the analysis and to compare performance of the new system with the original EG scheme  ...  material while maintaining secure connectivity of the network.  ...  Acknowledgments Financial support for this research was provided by iCORE (Informatics Circle of Research Excellence) in the Province of Alberta, as well as NSERC (Natural Sciences and Engineering Research  ... 
doi:10.1145/1755688.1755703 dblp:conf/ccs/VuSW10 fatcat:nwueucz7nfbybiuym63ogt4uyy

Maliciously Secure Multi-Client ORAM [chapter]

Matteo Maffei, Giulio Malavolta, Manuel Reinert, Dominique Schröder
2017 Lecture Notes in Computer Science  
In this work, we formalize the notion of maliciously secure multi-client ORAM, we prove that the server-side computational complexity of any secure realization has to be Ω(n), and we present a cryptographic  ...  We further devise an efficient access control mechanism, built upon a novel and generally applicable realization of plaintext equivalence proofs for ciphertext vectors.  ...  to the textbook notion of CPA-security.  ... 
doi:10.1007/978-3-319-61204-1_32 fatcat:hlav2s5wtjditpmcojqw6lmp4y

ID List Forwarding Free Confidentiality Preserving Data Aggregation for Wireless Sensor Networks

Liehuang Zhu, Zhen Yang, Mingzhong Wang, Meng Li
2013 International Journal of Distributed Sensor Networks  
We also prove that PEC2P is CPA secure by security reduction.  ...  We analyze the accuracy of PEC2P and conclude that base station can retrieve the sum of environmental data with an overwhelming probability.  ...  Acknowledgments This paper is supported by the National Natural Science Foundation of China (nos. 61272512, 61003262, and 61100172), Program for New Century Excellent Talents in University (NCET-12-0047  ... 
doi:10.1155/2013/241261 fatcat:aahheaclb5bebgnrz5nktl3sqm

Reliable Communication via Semilattice Properties of Partial Knowledge [chapter]

Aris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas
2017 Lecture Notes in Computer Science  
To the best of our knowledge, this is the first unique protocol for RMT against general adversaries in the partial knowledge model.  ...  Due to the generality of the model, our results provide, for any level of topology knowledge and any adversary structure, an exact characterization of instances where RMT is possible and an algorithm to  ...  A simple, yet powerful Reliable Broadcast protocol called Certified Propagation Algorithm (CPA) was proposed in this work; CPA is based on the idea that if a set of t + 1 neighbors of v provides the same  ... 
doi:10.1007/978-3-662-55751-8_29 fatcat:7kow2q525re5fc7dtq27i7vpoa

A Taxonomy Framework for Maritime Cybersecurity: A Demonstration Using the Automatic Identification System

Gary C. Kessler, Philip Craiger, Jon C. Haass
2018 TransNav: International Journal on Marine Navigation and Safety of Sea Transportation  
This paper describes a taxonomy that supports the creation of adversarial cyber models, risk mitigation, and resiliency plans as applied to the maritime industry, using the Automatic Identification System  ...  as a specific illustration of the approach.  ...  Using some form of lightweight public-key infrastructure (PKI) for AIS communication security, not terribly unlike the use of certificates in the Secure Sockets Layer (SSL) already in widespread use on  ... 
doi:10.12716/1001.12.03.01 fatcat:y23puk7alvhtjoqpl5jpselzua

PERFORMANCE EVALUATION OF MULTICRYPT ENCRYPTION MECHANISM

Wutjanun
2012 American Journal of Applied Sciences  
The proposed cipher is also proved to be secure against IND-CPA and IND-CCA attacks.  ...  The proposed cipher, Multicrypt, is similar to the One Time Pad and Hill cipher based on a sub band coding scheme using the principle of Orthogonal Vectors.  ...  Multicrypt cryptosystem's security was analyzed and was shown to be resilient against IND-CPA and IND-CCA attacks.  ... 
doi:10.3844/ajassp.2012.1849.1861 fatcat:p3tdqntxzjg4hlqmqchp3jtb4i

StakeCube: Combining Sharding and Proof-of-Stake to Build Fork-Free Secure Permissionless Distributed Ledgers [chapter]

Antoine Durand, Emmanuelle Anceaume, Romaric Ludinard
2019 Lecture Notes in Computer Science  
Our work focuses on the design of a scalable permissionless blockchain in the proof-of-stake setting.  ...  We impose induced churn to make shards robust to eclipse attacks, and we rely on the UTXO coin model to guarantee that any stakeholder action is securely verifiable by anyone.  ...  Construction of the next block of the blockchain In the following we propose a byzantine resilient cross-shard mechanism to agree on a unique valid block, despite the presence of at most f shard corrupted  ... 
doi:10.1007/978-3-030-31277-0_10 fatcat:h6nt6xy2hnhbrhb4vn2y54lof4
« Previous Showing results 1 — 15 out of 301 results