Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography, Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC'00), pp.123-132, 2000. ,
DOI : 10.1007/s00145-005-0318-0
Constraints ans approaches for distributed sensor networks security The Security Research Division Network associates Inc, 2000. ,
Random key predistribution schemes for sensor networks, Proc. IEEE Symposium on Security and Privacy (SP'03), p.197, 2003. ,
Unit disk graphs, Discrete Mathematics, vol.86, issue.1-3, pp.165-177, 1990. ,
DOI : 10.1016/0012-365X(90)90358-O
A key-mamangement scheme for distributed sensor networks, Proc. 9th ACM Conference on Computer and Communications Security, pp.41-47, 2002. ,
Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks, Lecture Notes in Computer Science, vol.4305, pp.215-229, 2006. ,
DOI : 10.1007/11945529_16
The Byzantine generals problem Advances in Ultra-Dependable Distributed Systems, 1995. ,
Theoretical aspects of connectivity-based multi-hop positioning, Theoretical Computer Science, vol.344, issue.1, pp.47-68, 2005. ,
NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks, European Conference on Wireless Sensor Networks (EWSN'08), 2008. ,
DOI : 10.1007/978-3-540-77690-1_19
Modeling adaptive node capture attacks in multi-hop wireless networks, Ad Hoc Networks, pp.801-814, 2007. ,
DOI : 10.1016/j.adhoc.2007.01.002
Improved pairwise key establishment for wireless sensor networks, Proc. 2nd IEEE Int. Conf. on Wireless and Mobile Computing, Networking and Communications, 2006. ,
Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach, Proc. 11th IEEE International Conference on Network Protocols (ICNP03), p.326, 2003. ,