|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Certificateless Public Key Encryption with Keyword Search显示文摘Public Key Encryption with Keyword Search(PEKS),an indispensable part of searchable encryption,is stock-intrade for both protecting data and providing operability of encrypted data.So far most of PEKS schemes have been established on Identity-Based Cryptography(IBC) with key escrow problem inherently.Such problem severely restricts the promotion of IBC-based Public Key Infrastructure including PEKS component.Hence,Certificateless Public Key Cryptography(CLPKC) is efficient to remove such problem.CLPKC is introduced into PEKS,and a general model of Certificate/ess PEKS(CLPEKS) is formalized.In addition,a practical CLPEKS scheme is constructed with security and efficiency analyses.The proposal is secure channel free,and semantically secure against adaptive chosen keyword attack and keyword guessing attack.To illustrate the superiority,massive experiments are conducted on Enron Email dataset which is famous in information retrieval field.Compared with existed constructions,CLPEKS improves the efficiency in theory and removes the key escrow problem. | PENG Yanguo CUI Jiangtao PENG Changgen YING Zuobin | 2014 | China Communications2014，11，11： | 21 |
| 2 | Bayesian mechanism for rational secret sharing scheme显示文摘We consider the cooperation of rational parties in secret sharing. We present a new methodology for rational secret sharing both in two-party and multi-party settings based on Bayesian game. Our approach can resolve the impossible solutions to a rational secret sharing model. First, we analyze the 2-out-of-2 rational secret sharing using Bayesian game, which makes us able to consider different classes of the protocol player(for'good' and 'bad' players) and model attributes such as any other parties' preferences and beliefs that may affect the outcome of the game. Thus, the new model makes us able to reason rational secret sharing from the perspective of Bayesian rationality, a notion that may be in some scenarios more appropriate than that defined as per pure rational. According to these analyses, we propose a Bayesian rational protocol of 2-out-of-2 secret sharing. Also, our techniques can be extended to the case of t-out-of-n Bayesian rational secret sharing easily.Our protocol is adopted only by the parties in their decision-making according to beliefs and Bayes rule, without requiring simultaneous channels and can be run over asynchronous networks. | TIAN YouLiang PENG ChangGen LIN DongDai MA JianFeng JIANG Qi JI WenJiang | 2015 | Science China(Information Sciences)2015，58，5： | 9 |
| 3 | One-Time Rational Secret Sharing Scheme Based on Bayesian Game显示文摘The rational secret sharing cannot be realized in the case of being played only once,and some punishments in the one-time rational secret sharing schemes turn out to be empty threats.In this paper,after modeling 2-out-of-2 rational secret sharing based on Bayesian game and considering different classes of protocol parties,we propose a 2-out-of-2 secret sharing scheme to solve cooperative problem of a rational secret sharing scheme being played only once.Moreover,we prove that the strategy is a perfect Bayesian equilibrium,adopted only by the parties in their decision-making according to their belief system (denoted by the probability distribution) and Bayes rule,without requiring simultaneous channels. | TIAN Youliang MA Jianfeng PENG Changgen CHEN Xi JI Wenjiang | 2011 | Wuhan University Journal of Natural Sciences2011，16，5： | 8 |
| 4 | Large eddies induced by local impulse at wall of boundary layer with pressure gradients显示文摘Large eddies induced by local impulse at the wall with pressure gradients in the boundary layer was studied by direct numerical sim- ulations. The results show that the amplitude evolution, the high and low speed stripes, the formation of streamwise vortices, the ejection and sweeping, inflexions and distortion at the mean velocity profiles, as well as other characteristics, are consistent with the experimental and other numerical results. It is also found that large eddies are easy to be excited with adverse pressure gradient in the boundary layer, and the growth of amplitudes, formation of streamwise vortices and the influencing area etc., are much larger than those with favorable pressure gradient in the boundary layer. In contrast, large eddies are hardly to be induced through local impulse disturbance at the wall with favorable pressure gradients in the boundary layer. | Changgen Lu Weidong Cao Yanmei Zhang Jintao Peng | 2008 | Progress in Natural Science:Materials International2008，18，7： | 3 |
| 5 | Fair (t,n) threshold secret sharing scheme 显示文摘 | TIAN Youliang MA Jianfeng PENG Changgen | 2013 | lET Information Security2013，7，2： | 1 |
| 6 | Publicly Verifiable Secret Sharing Schemes Using Bilinear Pairings 显示文摘 | Tian Youliang Peng Changgen Ma Jianfeng | 2012 | International Journal of Network Security2012，14，3： | 1 |
| 7 | hOPE:improved order preserving encryption with the power to homomorphic operations of ciphertexts显示文摘Database applications that manage and utilize massive data must address the issues of element comparisons, the core operations in index accessing, metric computations and metric comparisons, and the core operations in result ranking. In the cloud era, to avoid private information leakage, encrypted data are subcontracted, and resolutions for the problems that arise in three operations over ciphertexts are urgently required. Indeed, it is possible to handle element comparison through order preserving encryption/encoding(OPE) or metric computation through homomorphic encryption(HE) directly over ciphertexts. Unfortunately,the simultaneous achievement of both goals(i.e., metric computation and comparison) by directly combining OPE and HE remains intractable. In this work, an improved OPE, named h OPE, is proposed to support homomorphic operations over ciphertexts in addition to comparisons. Based on h OPE, Ah OPE and Ph OPE are designed to support homomorphic addition and product, respectively. Both schemes are proved to be indistinguishable under operated and ordered chosen-plaintext attack(IND-O2CPA) secure when the adopted HE algorithm provides indistinguishable under ordered chosen-plaintext attack(IND-OCPA secure). h OPE is a general construction that supports arbitrary HE algorithms and achieves consistent security. We deploy Ah OPE and Ph OPE in practice with a trusted/untrusted third party and compare the result with the state-of-the-art methods. The results show that our presented algorithms need few interactions and fill the gap between OPE and HE. | Yanguo PENG Hui LI Jiangtao CUI Junwei ZHANG Jianfeng MA Changgen PENG | 2017 | Science China(Information Sciences)2017，60，6： | 1 |
| 8 | Publicly verifiable secret sharing schemes using bilinear pairings显示文摘 | Tian Youliang Peng Changgen Ma Jianfeng | 2012 | International Journal of Network Security2012，14，3： | 1 |
| 9 | An Attribute-Based Signcryption Scheme and Its Application in Information Hiding显示文摘In order to provide a secure,reliable and flexible way to hide information,a new attribute-based signcryption scheme based on ciphertext-policy and its security proof are presented.This scheme not only can simultaneously fulfil both authentication and confidentiality in an efficient way,but also implements a hierarchical decryption in one group and also between different groups according to user's authority(different users satisfying the same access structure can be considered as a group).We provide a solution to information hiding using our proposed scheme which can embed ciphertext into a carrier.Because the hierarchical decryption property,different users will obtain different message from the same carrier.Illegal user can not get any information without private key because message existed in the carrier is ciphertext.Such solution can be applied in sharing important message under the public network. | PENG Changgen WANG Weiru TIAN Youliang YUAN Zhilong | 2016 | Chinese Journal of Electronics2016，25，4： | 1 |
| 10 | Feasibility and physics potential of detecting ^(8)B solar neutrinos at JUNO显示文摘The Jiangmen Underground Neutrino Observatory(JUNO)features a 20 kt multi-purpose underground liquid scintillator sphere as its main detector.Some of JUNO's features make it an excellent location for^8B solar neutrino measurements,such as its low-energy threshold,high energy resolution compared with water Cherenkov detectors,and much larger target mass compared with previous liquid scintillator detectors.In this paper,we present a comprehensive assessment of JUNO's potential for detecting^8B solar neutrinos via the neutrino-electron elastic scattering process.A reduced 2 MeV threshold for the recoil electron energy is found to be achievable,assuming that the intrinsic radioactive background^(238)U and^(232)Th in the liquid scintillator can be controlled to 10^(-17)g/g.With ten years of data acquisition,approximately 60,000 signal and 30,000 background events are expected.This large sample will enable an examination of the distortion of the recoil electron spectrum that is dominated by the neutrino flavor transformation in the dense solar matter,which will shed new light on the inconsistency between the measured electron spectra and the predictions of the standard three-flavor neutrino oscillation framework.IfDelta m^(2)_(21)=4.8times10^(-5);(7.5times10^(-5))eV^(2),JUNO can provide evidence of neutrino oscillation in the Earth at approximately the 3sigma(2sigma)level by measuring the non-zero signal rate variation with respect to the solar zenith angle.Moreover,JUNO can simultaneously measureDelta m^2_(21)using^8B solar neutrinos to a precision of 20% or better,depending on the central value,and to sub-percent precision using reactor antineutrinos.A comparison of these two measurements from the same detector will help understand the current mild inconsistency between the value of Delta m^2_(21)reported by solar neutrino experiments and the KamLAND experiment. | Angel Abusleme Thomas Adam Shakeel Ahmad Sebastiano Aiello Muhammad Akram Nawab Ali Fengpeng An Guangpeng An Qi An Giuseppe Andronico Nikolay Anfimov Vito Antonelli Tatiana Antoshkina Burin Asavapibhop João Pedro Athayde Marcondes de André Didier Auguste Andrej Babic Wander Baldini Andrea Barresi Eric Baussan Marco Bellato Antonio Bergnoli Enrico Bernieri David Biare Thilo Birkenfeld Sylvie Blin David Blum Simon Blyth Anastasia Bolshakova Mathieu Bongrand Clément Bordereau Dominique Breton Augusto Brigatti Riccardo Brugnera Riccardo Bruno Antonio Budano Max Buesken Mario Buscemi Jose Busto Ilya Butorov Anatael Cabrera Hao Cai Xiao Cai Yanke Cai Zhiyan Cai Antonio Cammi Agustin Campeny Chuanya Cao Guofu Cao Jun Cao Rossella Caruso Cédric Cerna Jinfan Chang Yun Chang Pingping Chen Po-An Chen Shaomin Chen Shenjian Chen Xurong Chen Yi-Wen Chen Yixue Chen Yu Chen Zhang Chen Jie Cheng Yaping Cheng Alexander Chepurnov Davide Chiesa Pietro Chimenti Artem Chukanov Anna Chuvashova Gérard Claverie Catia Clementi Barbara Clerbaux Selma Conforti Di Lorenzo Daniele Corti Salvatore Costa Flavio Dal Corso Christophe De La Taille Jiawei Deng Zhi Deng Ziyan Deng Wilfried Depnering Marco Diaz Xuefeng Ding Yayun Ding Bayu Dirgantara Sergey Dmitrievsky Tadeas Dohnal Georgy Donchenko Jianmeng Dong Damien Dornic Evgeny Doroshkevich Marcos Dracos Frédéric Druillole Shuxian Du Stefano Dusini Martin Dvorak Timo Enqvist Heike Enzmann Andrea Fabbri Lukas Fajt Donghua Fan Lei Fan Can Fang Jian Fang Marco Fargetta Anna Fatkina Dmitry Fedoseev Vladko Fekete Li-Cheng Feng Qichun Feng Richard Ford Andrey Formozov Amélie Fournier Haonan Gan Feng Gao Alberto Garfagnini Alexandre Göttel Christoph Genster Marco Giammarchi Agnese Giaz Nunzio Giudice Franco Giuliani Maxim Gonchar Guanghua Gong Hui Gong Oleg Gorchakov Yuri Gornushkin Marco Grassi Christian Grewing Maxim Gromov Vasily Gromov Minghao Gu Xiaofei Gu Yu Gu Mengyun Guan Nunzio Guardone Maria Gul Cong Guo Jingyuan Guo Wanlei Guo Xinheng Guo Yuhang Guo Paul Hackspacher Caren Hagner Ran Han Yang Han Miao He Wei He Tobias Heinz Patrick Hellmuth Yuekun Heng Rafael Herrera Daojin Hong YuenKeung Hor Shaojing Hou Yee Hsiung Bei-Zhen Hu Hang Hu Jianrun Hu Jun Hu Shouyang Hu Tao Hu Zhuojun Hu Chunhao Huang Guihong Huang Hanxiong Huang Qinhua Huang Wenhao Huang Xingtao Huang Yongbo Huang Jiaqi Hui Wenju Huo Cédric Huss Safeer Hussain Antonio Insolia Ara Ioannisian Daniel Ioannisyan Roberto Isocrate Kuo-Lun Jen Xiaolu Ji Xingzhao Ji Huihui Jia Junji Jia Siyu Jian Di Jiang Xiaoshan Jiang Ruyi Jin Xiaoping Jing Cécile Jollet Jari Joutsenvaara Sirichok Jungthawan Leonidas Kalousis Philipp Kampmann Li Kang Michael Karagounis Narine Kazarian Amir Khan Waseem Khan Khanchai Khosonthongkee Patrick Kinz Denis Korablev Konstantin Kouzakov Alexey Krasnoperov Svetlana Krokhaleva Zinovy Krumshteyn Andre Kruth Nikolay Kutovskiy Pasi Kuusiniemi Tobias Lachenmaier Cecilia Landini Sébastien Leblanc Frederic Lefevre Liping Lei Ruiting Lei Rupert Leitner Jason Leung Demin Li Fei Li Fule Li Haitao Li Huiling Li Jiaqi Li Jin Li Kaijie Li Mengzhao Li Nan Li Nan Li Qingjiang Li Ruhui Li Shanfeng Li Shuaijie Li Tao Li Weidong Li Weiguo Li Xiaomei Li Xiaonan Li Xinglong Li Yi Li Yufeng Li Zhibing Li Ziyuan Li Hao Liang Hao Liang Jingjing Liang Jiajun Liao Daniel Liebau Ayut Limphirat Sukit Limpijumnong Guey-Lin Lin Shengxin Lin Tao Lin Jiajie Ling Ivano Lippi Fang Liu Haidong Liu Hongbang Liu Hongjuan Liu Hongtao Liu Hu Liu Hui Liu Jianglai Liu Jinchang Liu Min Liu Qian Liu Qin Liu Runxuan Liu Shuangyu Liu Shubin Liu Shulin Liu Xiaowei Liu Yan Liu Alexey Lokhov Paolo Lombardi Claudio Lombardo Kai Loo Chuan Lu Haoqi Lu Jingbin Lu Junguang Lu Shuxiang Lu Xiaoxu Lu Bayarto Lubsandorzhiev Sultim Lubsandorzhiev Livia Ludhova Fengjiao Luo Guang Luo Pengwei Luo Shu Luo Wuming Luo Vladimir Lyashuk Qiumei Ma Si Ma Xiaoyan Ma Xubo Ma Jihane Maalmi Yury Malyshkin Fabio Mantovani Francesco Manzali Xin Mao Yajun Mao Stefano MMari Filippo Marini Sadia Marium Cristina Martellini Gisele Martin-Chassard Agnese Martini Davit Mayilyan Axel Müller Ints Mednieks Yue Meng Anselmo Meregaglia Emanuela Meroni David Meyhöfer Mauro Mezzetto Jonathan Miller Lino Miramonti Salvatore Monforte Paolo Montini Michele Montuschi Nikolay Morozov Pavithra Muralidharan Massimiliano Nastasi Dmitry VNaumov Elena Naumova Igor Nemchenok Alexey Nikolaev Feipeng Ning Zhe Ning Hiroshi Nunokawa Lothar Oberauer Juan Pedro Ochoa-Ricoux Alexander Olshevskiy Domizia Orestano Fausto Ortica Hsiao-Ru Pan Alessandro Paoloni Nina Parkalian Sergio Parmeggiano Teerapat Payupol Yatian Pei Nicomede Pelliccia Anguo Peng Haiping Peng Frédéric Perrot Pierre-Alexandre Petitjean Fabrizio Petrucci Luis Felipe Piñeres Rico Oliver Pilarczyk Artyom Popov Pascal Poussot Wathan Pratumwan Ezio Previtali Fazhi Qi Ming Qi Sen Qian Xiaohui Qian Hao Qiao Zhonghua Qin Shoukang Qiu Muhammad Rajput Gioacchino Ranucci Neill Raper Alessandra Re Henning Rebber Abdel Rebii Bin Ren Jie Ren Taras Rezinko Barbara Ricci Markus Robens Mathieu Roche Narongkiat Rodphai Aldo Romani Bedřich Roskovec Christian Roth Xiangdong Ruan Xichao Ruan Saroj Rujirawat Arseniy Rybnikov Andrey Sadovsky Paolo Saggese Giuseppe Salamanna Simone Sanfilippo Anut Sangka Nuanwan Sanguansak Utane Sawangwit Julia Sawatzki Fatma Sawy Michaela Schever Jacky Schuler Cédric Schwab Konstantin Schweizer Dmitry Selivanov Alexandr Selyunin Andrea Serafini Giulio Settanta Mariangela Settimo Muhammad Shahzad Vladislav Sharov Gang Shi Jingyan Shi Yongjiu Shi Vitaly Shutov Andrey Sidorenkov FedorŠimkovic Chiara Sirignano Jaruchit Siripak Monica Sisti Maciej Slupecki Mikhail Smirnov Oleg Smirnov Thiago Sogo-Bezerra Julanan Songwadhana Boonrucksar Soonthornthum Albert Sotnikov Ondrej Sramek Warintorn Sreethawong Achim Stahl Luca Stanco Konstantin Stankevich DušanŠtefánik Hans Steiger Jochen Steinmann Tobias Sterr Matthias Raphael Stock Virginia Strati Alexander Studenikin Gongxing Sun Shifeng Sun Xilei Sun Yongjie Sun Yongzhao Sun Narumon Suwonjandee Michal Szelezniak Jian Tang Qiang Tang Quan Tang Xiao Tang Alexander Tietzsch Igor Tkachev Tomas Tmej Konstantin Treskov Andrea Triossi Giancarlo Troni Wladyslaw Trzaska Cristina Tuve Stefan van Waasen Johannes van den Boom Guillaume Vanroyen Nikolaos Vassilopoulos Vadim Vedin Giuseppe Verde Maxim Vialkov Benoit Viaud Cristina Volpe Vit Vorobel Lucia Votano Pablo Walker Caishen Wang Chung-Hsiang Wang En Wang Guoli Wang Jian Wang Jun Wang Kunyu Wang Lu Wang Meifen Wang Meng Wang Ruiguang Wang Siguang Wang Wei Wang Wenshuai Wang Xi Wang Xiangyue Wang Yangfu Wang Yaoguang Wang Yi Wang Yifang Wang Yuanqing Wang Yuman Wang Zhe Wang Zheng Wang Zhimin Wang Zongyi Wang Apimook Watcharangkool Lianghong Wei Wei Wei Yadong Wei Liangjian Wen Christopher Wiebusch Steven Chan-Fai Wong Bjoern Wonsak Diru Wu Fangliang Wu Qun Wu Wenjie Wu Zhi Wu Michael Wurm Jacques Wurtz Christian Wysotzki Yufei Xi Dongmei Xia Yuguang Xie Zhangquan Xie Zhizhong Xing Benda Xu Donglian Xu Fanrong Xu Jilei Xu Jing Xu Meihang Xu Yin Xu Yu Xu Baojun Yan Xiongbo Yan Yupeng Yan Anbo Yang Changgen Yang Huan Yang Jie Yang Lei Yang Xiaoyu Yang Yifan Yang Haifeng Yao Zafar Yasin Jiaxuan Ye Mei Ye Ugur Yegin Frédéric Yermia Peihuai Yi Xiangwei Yin Zhengyun You Boxiang Yu Chiye Yu Chunxu Yu Hongzhao Yu Miao Yu Xianghui Yu Zeyuan Yu Chengzhuo Yuan Ying Yuan Zhenxiong Yuan Ziyi Yuan Baobiao Yue Noman Zafar Andre Zambanini Pan Zeng Shan Zeng Tingxuan Zeng Yuda Zeng Liang Zhan Feiyang Zhang Guoqing Zhang Haiqiong Zhang Honghao Zhang Jiawen Zhang Jie Zhang Jingbo Zhang Peng Zhang Qingmin Zhang Shiqi Zhang Tao Zhang Xiaomei Zhang Xuantong Zhang Yan Zhang Yinhong Zhang Yiyu Zhang Yongpeng Zhang Yuanyuan Zhang Yumei Zhang Zhenyu Zhang Zhijian Zhang Fengyi Zhao Jie Zhao Rong Zhao Shujun Zhao Tianchi Zhao Dongqin Zheng Hua Zheng Minshan Zheng Yangheng Zheng Weirong Zhong Jing Zhou Li Zhou Nan Zhou Shun Zhou Xiang Zhou Jiang Zhu Kejun Zhu Honglin Zhuang Liang Zong Jiaheng Zou | 2021 | Chinese Physics C2021，45，2： | 0 |
| 11 | An incentive-compatible rational secret sharing scheme using blockchain and smart contract显示文摘In the rational cryptographic protocol,the two rational players often fall into the prisoner's dilemma,which is also the case for the rational secret sharing we consider in this paper.First,it is proved that rational secret sharing has a sequential equilibrium in the natural state,so that rational participants will fall into the prisoner's dilemma,resulting in no participants being able to reconstruct the secret correctly.Next,to solve this problem,we propose an incentive-compatible rational secret scheme.Specifically,the game tree with imperfect information is constructed to facilitate our analysis and proof,and the strictly dominated strategies are directly eliminated to simplify the game tree.Further more,we describe the motivation of the verifier.Then,we prove that rational players have no motivation to deviate from honest behavior using sequential equilibrium so that rational players can reconstruct the secret correctly.Finally,we complete the simulation using the smart contract and analyze our entire scheme.In addition,the game of our scheme does not need to be repeated multiple times to reach sequential equilibrium,i.e.,the game always follows the rational path. | Zerui CHEN Youliang TIAN Changgen PENG | 2021 | Science China(Information Sciences)2021，64，10： | 0 |
| 12 | Federated Learning Model for Auto Insurance Rate Setting Based on Tweedie Distribution显示文摘In the assessment of car insurance claims,the claim rate for car insurance presents a highly skewed probability distribution,which is typically modeled using Tweedie distribution.The traditional approach to obtaining the Tweedie regression model involves training on a centralized dataset,when the data is provided by multiple parties,training a privacy-preserving Tweedie regression model without exchanging raw data becomes a challenge.To address this issue,this study introduces a novel vertical federated learning-based Tweedie regression algorithm for multi-party auto insurance rate setting in data silos.The algorithm can keep sensitive data locally and uses privacy-preserving techniques to achieve intersection operations between the two parties holding the data.After determining which entities are shared,the participants train the model locally using the shared entity data to obtain the local generalized linear model intermediate parameters.The homomorphic encryption algorithms are introduced to interact with and update the model intermediate parameters to collaboratively complete the joint training of the car insurance rate-setting model.Performance tests on two publicly available datasets show that the proposed federated Tweedie regression algorithm can effectively generate Tweedie regression models that leverage the value of data fromboth partieswithout exchanging data.The assessment results of the scheme approach those of the Tweedie regressionmodel learned fromcentralized data,and outperformthe Tweedie regressionmodel learned independently by a single party. | Tao Yin Changgen Peng Weijie Tan Dequan Xu Hanlin Tang | 2024 | Computer Modeling in Engineering & Sciences2024，138，1： | 0 |
| 13 | Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services显示文摘Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight.Although the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression capabilities.To address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research.Additionally,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of re-encryption.Moreover,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all advantageous.Besides,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud.Furthermore,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure. | Jinqiu Hou Changgen Peng Weijie Tan Hongfa Ding | 2024 | Computer Modeling in Engineering & Sciences2024，138，1： | 0 |
| 14 | PUMTD:Privacy-Preserving User-Profile Matching Protocol in Social Networks显示文摘User profile matching can establish social relationships between different users in the social network.If the user profile is matched in plaintext,the user's privacy might face a security challenge.Although there exist some schemes realizing privacypreserving user profile matching,the resource-limited users or social service providers in these schemes need to take higher computational complexity to ensure the privacy or matching of the data.To overcome the problems,a novel privacy-preserving user profile matching protocol in social networks is proposed by using t-out-of n servers and the bloom filter technique,in which the computational complexity of a user is reduced by applying the Chinese Remainder Theorem,the matching users can be found with the help of any t matching servers,and the privacy of the user profile is not compromised.Furthermore,if at most t-1 servers are allowed to collude,our scheme can still fulfill user profile privacy and user query privacy.Finally,the performance of the proposed scheme is compared with the other two schemes,and the results show that our scheme is superior to them. | Jianhong Zhang Haoting Han Hongwei Su Zhengtao Jiang Changgen Peng | 2022 | China Communications2022，19，6： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员