保密社交意愿探测

Private Social-willing Detection

研究保密意愿探测问题:Alice和Bob可以协同测试他们是否可以在某个理想区域共事,但不泄漏彼此的隐私信息.近年来,大部分的移动智能设备在出厂时都预装了位置感知设备,从而为开发者设计各种各样的提供位置识别与服务的应用软件提供了广阔的空间.然而很多情况下,用户间不愿意泄露自己的位置信息(或者活动范围),仅通过一比特的信息探知(或知晓)各参与方是否愿意在某个(便于彼此的)区域内共同做某件事情.保密意愿探测协议可以实现这样的功能,并且能够保证各参与方位置信息不会泄露.首先,设计了一个新的基于高阶剩余类判定性难解问题的云外包同态加密方案;然后,基于该方案构造了一个保密意愿探测协议,并在ideal/real模型下证明了协议的安全性.

Privacy-preserving tests are studied for social-willing:Alice and Bob can test whether they are suitable to do something jointly in an ideal area without either party revealing any other information about each other's location.Nowadays,most mobile intelligent devices come pre-equipped with location(GPS)sensing capabilities,allowing developers to create a wide variety of location-aware applications and services.While location awareness provides novel features and functionality,it opens the door to many privacy nightmares.In many occasions,however,users are not willing to share their actual location or the range of their activities,but to determine whether they are able to do something in some area(a place is convenient for each user),which is practically one bit of information.Private social-willing protocols allow this functionality without any further information leakage.Firstly,a homomorphic encryption scheme is developed,assisted by cloud server and based on the intractable problem of decisional composite residuosity.Then,a novel protocol is proposed based on the developed homomorphic encryption scheme,and security in ideal/real model is proved.