This Article 
 Bibliographic References 
 Add to: 
Private and Secure Service Discovery via Progressive and Probabilistic Exposure
November 2007 (vol. 18 no. 11)
pp. 1565-1577
The involvement of only the necessary users and service providers for service discovery in pervasive computing environments is challenging. Without prudence, users’ and service providers’ requests or service information, their identities, and their presence information may be sacrificed. We identify that the problem may be as difficult as a chicken-and-egg problem, in which both users and service providers want the other parties to expose sensitive information first. In this paper, we propose a progressive and probabilistic approach to solve the problem. Users and service providers expose partial information in turn and avoid unnecessary exposure if there is any mismatch. Although one or two bits of information are exchanged in each message, we prove that the process converges and that the false positive overhead decreases quickly. Experiments and hypotheses tests show that security properties hold. We implemented the approach and the performance measurements show that the approach runs efficiently on PDAs.

[1] F. Zhu, M. Mutka, and L. Ni, “Service Discovery in Pervasive Computing Environments,” IEEE Pervasive Computing, vol. 4, pp.81-90, 2005.
[2] Sun Microsystems, Jini Technology Core Platform Specification,, June 2003.
[3] Salutation Consortium, Salutation Architecture Specification, , 1999.
[4] Bluetooth SIG, Specification of the Bluetooth System, http:/, Nov. 2004.
[5] “Bluetooth Security,” white paper, Bluetooth SIG Security Expert Group, %20of%20PHY Bluetooth_24Security_Paper.pdf , 2002.
[6] C. Ellison, UPnP Security Ceremonies V1.0, Intel Co., UPnPSecurity Ceremonies_1_0secure.pdf , Oct. 2003.
[7] C. Ellison, “Home Network Security,” Intel Technology J., vol. 6, pp. 37-48, 2002.
[8] S. Czerwinski, B.Y. Zhao, T. Hodes, A. Joseph, and R. Katz, “An Architecture for a Secure Service Discovery Service,” Proc. MobiCom, 1999.
[9] F. Zhu, M. Mutka, and L. Ni, “A Private, Secure and User-Centric Information Exposure Model for Service Discovery Protocols,” IEEE Trans. Mobile Computing, vol. 5, pp. 418-429, 2006.
[10] B. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors,” Comm. ACM, vol. 13, pp. 422-426, 1970.
[11] P. Bonatti and P. Samarati, “Regulating Service Access and Information Release on the Web,” Proc. Seventh ACM Conf. Computer and Comm. Security (CCS '00), 2000.
[12] T. Yu and M. Winslett, “A Unified Scheme for Resource Protection in Automated Trust Negotiation,” Proc. IEEE Symp. Security and Privacy, 2003.
[13] M. Winslett, T. Yu, K.E. Seamons, A. Hess, J. Jacobson, R. Jarvis, B. Smith, and L. Yu, “Negotiating Trust on the Web,” IEEE Internet Computing, pp. 30-37, 2002.
[14] W.H. Winsborough and N. Li, “Towards Practical Automated Trust Negotiation,” Proc. Third Int'l Workshop Policies for Distributed Systems and Networks (POLICY '02), 2002.
[15] W.H. Winsborough and N. Li, “Protecting Sensitive Attributes in Automated Trust Negotiation,” Proc. ACM Workshop Privacy in the Electronic Soc. (WPES '02), 2002.
[16] M. Krzywinski, “Port Knocking: Network Authentication across Closed Ports,” SysAdmin Magazine, vol. 12, pp. 12-17, 2003.
[17] T. Pering, M. Sundar, J. Light, and R. Want, “Photographic Authentication through Untrusted Terminals,” IEEE Pervasive Computing, pp. 30-36, 2003.
[18] A. Menezes, P.V. Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996.
[19] Y. Nohara, S. Inoue, K. Baba, and H. Yasuura, “Quantitative Evaluation of Unlinkable ID Matching Schemes,” Proc. ACM Workshop Privacy in the Electronic Soc. (WPES '05), 2005.
[20] M. Ohkubo, K. Suzuki, and S. Kinoshita, “Cryptographic Approach to ‘Privacy-Friendly’ Tags,” RFID Privacy Workshop, Massachusetts Inst. of Technology, 2003.
[21] S.A. Weis, S. Sarma, R. Rivest, and D. Engels, “Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems,” Proc. First Int'l Conf. Security in Pervasive Computing (SPC '03), 2003.
[22] M. Bellare, R. Canettiy, and H. Krawczykz, “Keying Hash Functions for Message Authentication,” Proc. 16th Ann. Int'l Conf. Advances in Cryptology (Crypto '96), 1996.
[23] S. Ross, Introduction to Probability Models, eighth ed. Academic Press, 2003.
[24] J. Rice, Math. Statistics and Data Analysis, second ed. Duxbury Press, 1995.

Index Terms:
Authentication, Pervasive Computing, Privacy, Probabilistic, Security
Feng Zhu, Wei Zhu, Matt W. Mutka, Lionel M. Ni, "Private and Secure Service Discovery via Progressive and Probabilistic Exposure," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 11, pp. 1565-1577, Nov. 2007, doi:10.1109/TPDS.2007.1075
Usage of this product signifies your acceptance of the Terms of Use.