Towards provable security for ubiquitous applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4058 LNCS, Issue , 2006, Pages 295-312

  Burmester, Mike ^a   Van Le, Tri ^a   De Medeiros, Breno ^a  

^a Florida State University   (United States)

Author keywords

Fault tolerance; MANET; RFID; Tracing malicious faults; Ubiquitous applications

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; CRYPTOGRAPHY; EMBEDDED SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS;

MANET; RFID; TRACING MALICIOUS FAULTS; UBIQUITOUS APPLICATIONS;

SECURITY SYSTEMS;

EID: 33746342177     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780656_25     Document Type: Conference Paper

References (38)

1. G. Ateniese, J. Camenisch, and B. de Medeiros. Untraceable RFID tags via insubvertible encryption. In Proc. of the ACM Conf. on Computer and Communication Security (ACM CCS 2005), pp. 92-101, ACM Press, 2005.
2. B. Awerbuch, D. Holmer, C. Nita-Rotaru and H. Rubens, An On-Demand Secure Routing Protocol Resilient to Byzantine Failures, ACM Workshop on Wireless Security - WiSe'02 2002.
3. D. Beaver, Foundations of secure interactive computing, Proc. CRYPTO '91, Springer Verlag LNCS, vol. 576, pp. 377-391, 1991.
4. D. Beaver. Secure multi-party protocols and zero-knowledge proof systems tolerating a faulty minority. In Journal of Cryptology, vol. 4, no. 2, pp. 75122, 1991.
5. D. Beaver and S. Goldwasser. Multiparty computation with faulty majority. In Proc. of Advances in Cryptology (CRYPTO 89), LNCS Vol. 435, pp. 589-590, Springer-Verlag, 1989.
6. E.M. Belding-Royer and C.-K. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. In IEEE Personal Communications Magazine, pp. 46-55, 1991.
7. M. Burmester and T. van Le. Secure Multipath Communication in Mobile Ad hoc Networks. In Proc. International Conference on Information Technology Coding and Computing, pp. 405-409, 2004.
8. M. Burmester, T. Van Le, and A. Yasinsac. Adaptive gossip protocols: managing security and redundancy in dense ad hoc networks. In Journal of Ad hoc Networks, vol. 4, no. 3, pp. 504-515, Elsevier, 2006.
9. C. Chatmon, T. Le Van, and M. Burmester. Anonymous authentication with RFID devices. FSU Technical Report: TR-060112. Available at url http://www.sait.fsu.edu/research/rfid/index.shtml.
10. R. Canetti. Studies in Secure Multiparty Computation and Applications. Ph. D. thesis, Weizmann Institute of Science, Rehovot 76100, Israel, June 1995.
11. R. Canetti. Security and composition of multi-party cryptographic protocols. In Journal of Cryptology, vol. 13, no. 1, pp. 143-202, 2000.
12. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In Proc. of Foundations of Comp. Sci. (FOCS 2001), pp. 136-145, 2001.
13. R. Canetti and M. Fischlin. Universally Composable Commitments. In Proc. of Advances in Cryptology (CRYPTO 2001), LNCS 2139, pp. 19-ff., Springer-Verlag, 2001.
14. R. Canetti and J. Herzog. Universally Composable Symbolic Analysis of Cryptographic Protocols (The case of encryption-based mutual authentication and key exchange). In E-print Technical Report # 2004/334, International Association for Cryptological Research, 2004. Available at url http://eprint.iacr.org/2004/ 334
15. R. Canetti and H. Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels (Extended Abstract). In Proc. of Advances in Cryptology (EUROCRYPT 2002), LNCS 2332, pp. 337-ff, Springer-Verlag, 2002.
16. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation. In Proc. of the ACM Symposim on Theory of Computing, vol. 34, pp. 494-503, ACM Press, 2002.
17. J. R. Douceur. The Sybil attack. In Proc. 1st International Workshop on Peer-to-Peer Systems - IPTPS '02, 2002.
18. L.R. Ford and D.R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
19. H. Gilbert, M. Rodshaw, and H. Sibert. An Active Attack Against HB+ - A Provably Secure Lightweight Authentication Protocol. PerSec '04, March 2004. Full paper available in E-print Technical Report # 2005/237, International Association for Cryptological Research, Available at url http://eprint.iacr.org/ 2005/237.pdf
20. M. Hirt and U. Maurer. Player Simulation and General Adversary Structures in Perfect Multiparty Computation. In Journal of Cryptology, Vol. 13, No. 1, pp. 31-60, 2000.
21. D. Hofheinz, J. Müller-Quade, and R. Steinwandt. Initiator-Resilient Universally Composable Key Exchange. In Proc. of the European Symp. on Research in Computer Security (ESORICS 2003), LNCS 2808, pp. 61-84, Springer-Verlag, 2003.
22. N. J. Hopper and M. Blum. Secure Human Identification Protocols. In Proc. of Advances in Crypotology (ASIACRYPT 2001), LNCS, Springer-Verlag, 2001.
23. Y-C Hu, D.B. Johnson and A. Perrig. Ariadne: A Secure On-Demand Routing protocol for Ad Hoc Networks. In Proc. of the ACM Annual Intern. Conf. on Mobile Computing and Networking (MobiCom 2002), ACM Press, 2002.
24. Y-C Hu, D.B. Johnson and A. Perrig. SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks. In Proc. 4th IEEE Workshop on Mobile Computing Systems & Applications (WMCSA 2002), IEEE, Calicoon, NY, 2002.
25. Y-C. Hu, A. Perrig and D.B. Johnson. Rushing attacks and defense in wireless ad hoc network routing protocols. In Proc. of WiSe2003, pp. 30-40, 2003.
26. D.B. Johnson and D.A. Maltz. Dynamic Source Routing in Ad-Hoc Wireless Networks. In ed. T. Imielinski and H. Korth, Mobile Computing, Kluwer Academic Publisher, pp. 152-181, 1996.
27. A. Juels and S. A. Weiss. Authenticating Pervasive Devices with Human Protocols. In Proc. of Advances in Cryptology-CRYPTO 2005, LNCS vol. 3621, pp. 293-ff, Springer-Verlag, 2005.
28. J. Katz and J. S. Shin. Parallel and Concurrent Security of the HB and HB+ Protocols. To appear in Proc. of Advances in Cryptology (EUROCRYPT 2006), Springer, 2006.
29. P. Laud. Formal analysis of crypto protocols: Secrecy types for a simulatable cryptographic library. In Proc. of the 12th ACM Conf. on Computer and Communications Security (ACM CCS 2005), pp. 26-35, ACM Press, 2005.
30. P. Papadimitratos and Z.H. Haas. Secure Routing for Mobile Ad hoc Networks. In Mobile Computing and Communications Review, Vol 6, No 4, 2002.
31. C. E. Perkins and P. Bhagwat. Highly Dynamic Destination-Sequenced Distance-Vector Routing for Mobile Computers. In Computer Communications Review, pp. 224-244, 1994.
32. C.E. Perkins and E.M. Royer. Ad hoc on-demand distance vector routing. In Proc. of the IEEE Workshop on Mobile Computing Systems and Applications, pp. 90-100, 1999.
33. B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. of the ACM Conf. on Computer and Communications Security (ACM CCS 2000, pp. 245-254, ACM Press, 2000.
34. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. of the IEEE Security and Privacy Symposium (S & P 2001), pp. 184-200, 2001.
35. Y. Oren and A. Shamir. Power Analysis of RFID Tags. Invited talk, RSA Conference, Cryptographer's Track (RSA-CT 2006). Available at http://www.wisdom.weizmann.ac.il/~yossio/rfid
36. A.J. Menezes, P.C. van Oorschot and S.A. Vanscott. Handbook of Applied Cryptography, CRC Press, 1996.
37. G. Tsudik. YA-TRAP: Yet another trivial rfid authentication protocol. International Conference on Pervasive Computing and Communications, 2006.
38. M. G. Zapata. Secure Ad hoc On-Demand Vector (SAODV) Routing. IETF Internet Draft. Available at url http://www.potaroo.net/ietf/all-ids/draft- guerreromanet-saodv-00.txt (Work in Progress).