期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于符号ADD和线性多分支程序的分类算法安全评估 被引量：3

Secure Evaluation of Classification Algorithms Based on Symbolic ADD and Linear Multi-Branching Program
在线阅读 下载PDF
导出
摘要 分类算法是机器学习和数据分析中重要的算法.当需要对分类算法本身以及算法的输入数据进行隐私保护时,就出现了分类算法安全评估问题.针对现有的分类算法安全评估协议效率较低的问题,文章给出了一种基于代数决策图和线性多分支程序的解决方案.首先,设计了基于代数决策图的安全函数评估协议,用以安全评估决策函数;其次,引入了线性多分支程序的概念,用其对分类算法进行表示.最后,借助线性多分支程序和基于代数决策图的安全函数评估协议,给出了一个私有线性多分支程序的安全评估协议.对新的协议的正确性和安全性进行了分析和证明.实验数据表明,与原有的解决方案相比,新的协议在效率上有明显的提高. Classification algorithms are widely used in the areas of machine learning and data mining. It is an important task to evaluate the classification algorithms securely when both the classification algorithm and the input data of the algorithm are private. In order to improve the efficiency of existing secure evaluation protocols, a solution based on both the algebraic decision diagram and the linear multi-branching program was presented. Firstly, a secure function evaluation protocol based on algebraic decision diagram was designed for evaluating decision functions securely. Secondly, a structure named linear multi-branching program was proposed to represent the classification algorithms. Based on both the secure function evaluation protocol and the structure of linear multi-branching program, a protocol for securely evaluating the private linear multi-branching programs was constructed. Both the correctness and the security of the new protocol were analyzed. Experimental results show that the new protocol is more efficient than the existing solutions.
作者 古天龙 何仲春 常亮 徐周波
机构地区 桂林电子科技大学广西可信软件重点实验室
出处 《电子学报》 EI CAS CSCD 北大核心 2014年第5期940-947,共8页 Acta Electronica Sinica
基金 国家自然科学基金(No.60963010 No.60903079 No.61100025 No.61262030 No.61363030) 广西省自然科学基金(No.2012GXNSFBA053169)
关键词 安全评估 分类算法 代数决策图 线性多分支程序 secure evaluation classification algorithm algebraic decision diagram linear multi-branching program
分类号 TN918 [电子电信—通信与信息系统] TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献19

  • 1Ruggieri S. Efficient CA. 5 [J] 1EEE. Trans on Knowledge and Data Engineering, 2002,14(2) :438 - 444.
  • 2Delany S J, Canningham P, Doyle D, Zamolotskikh A. Generat- ing estimates of classification confidence for a case-based spam filter[ A ]. Proceedings of the 6th International Conference on Case-Based Reasoning[ C]. Chicago: Springer, 2005. Volume 3620 of LNCS : 177 - 190.
  • 3Ha J,Rossbach C J,Davis J V,et al. Improved error reporting for software that uses black-box components[ A ]. Proceedings of the 2007 ACM SIGPLAN Conference on Programming Lan- guage Design and Implementation[ C] .New York:ACM,2007. 101 - 111.
  • 4Rodriguez J, Goni A, Illarramendi A. Real-time classification of ECGs on a PDA[ J]. IEEE Trans on Information Technology in Biomedicine, 2005,9( 1 ) :23 - 34.
  • 5BrickeU J, Porter D E, Shmafikov V, et al. Privacy-preserving remote diagnostics[ A]. Proceedings of the 14th ACM Confer- ence on Computer and Communications Security [C]. New York: ACM, 2007.498 - 507.
  • 6Bami M, FaiUa P, Kolesnikov V, et al. Secure evaluation of pri- vate linear branching programs with medical applications[ A]. Proceedings of the 14th European Symposium on Research in Computer Security [ C ]. Saint-Malo: Springer, 2009. Volume5789 of LNCS : 424 - 439.
  • 7Yao A C.Protocols for secure computation[ A] .Proceedings of the 23th IEEE Symposium On Foundations of Computer Sci- ence[ C]. Chicago: 1EEE, 1982. 160 - 164.
  • 8Yao A C. How to generate and exchange secrets[ A]. Proceed- ings of the 27th IEEE Symposium On Foundations of Computer Science[ C]. Toronto: IEEE, 1986. 162 - 167.
  • 9Malkhi D,Nisan N,Pinkas B,et al. Fairplay-a secure two-party computation system[ A]. Proceedings of the 13th Conference on USENIX Security Symposium[ C]. California: USENIX, 2004. 287 - 302.
  • 10Kruger L, Jha S, Goh E J, et al. Secure function evaluation with ordered binary decision diagrams[ A]. Proceedings of the 13th ACM Conference on Computer and Communications Se- curity[ C]. New York: ACM,2006.410 - 420.

二级参考文献13

  • 1M Naor,B Pinkas.Efficient oblivious transfer protocols[A].Proc 12th Ann Symp Discrete Algorithms[C].New York:ACM Press,2001.448-457.
  • 2Wen-Guey Tzeng.Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters[J].IEEE TRANSACTIONS ON COMPUTERS,2004,53(2):232-240.
  • 3William Stallings.Cryptography and Network Security:Principles and Practice (2nd ed)[M].Beijing:Tsinghua University Press,2003.264-269.
  • 4A Yao.Protocols for secure computations[A].Proceeding of the 23th IEEE Symposium on Foundations of Computer Science[C].Los Alamitos,CA:IEEE Computer Society Press,1982.160-164.
  • 5C Cachin.Efficient private bidding and auction with an obvious third party[A].Proceeding of the 6th ACM conference on computer and communication security[C].New York:ACM Press,1999.120-127.
  • 6Oded Goldreich,Silvio Micali,Avi Wigderson.How to play ANY mental game[A].Proceedings of the nineteenth annual ACM conference on Theory of computing[C].New York:ACM Press,1987.218-229.
  • 7O Goldreich.Secure multi-party computation (working draft)[OL].http://www.wisdom.weizmann.ac.il/home/oded/public-html/foc.html,2002.
  • 8S Goldwasser.Multi-party computations:Past and present[A].Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing[C].New York:ACM Press,1997.21-24.
  • 9Wenliang Du,Atallah J.Secure multi-party computation problems and their applications:A review and open problems[A].New Security Paradigms Workshop 2001[C].Cloudcroft,New Mexico,USA,Sep.11-13,2001.11-20.
  • 10Mikhail J Atallah,Wenliang Du.Secure multi-party computational geometry[A].In Seventh International Workshop on Algorithms and Data Structures (WADS 2001),Lecture Note in Computer Science 2125[C].New York:Springer-verlag,2001.165-179.

共引文献43

同被引文献34

  • 1Yao A.Protocols for secure computations[C]//Proceedings of the 23th Annual Aymposium on Foundations of Computer Science,IEEE,1982:160-164.
  • 2Katz J,Malka L.Secure text processing with applications to private DNA matching[C]//Proceedings of the 17th ACM Conference on Computer and Communications Security,2010:485-492.
  • 3Yao A.How to generate and exchange secrets[C]//Proceedings of the 27th Annual Symposium on Foundations of Computer Science,IEEE,1986:162-167.
  • 4Kruger L,Jha S,Goh E,et al.Secure function evaluation with ordered binary decision diagrams[C]//Proceedings of the 13th ACM Conference on Computer and Communications Security,2006:410-420.
  • 5Kolesnikov V,Schneider T.A Practical Universal Circuit Construction and Secure Evaluation of Private Functions[M]//Financial Cryptography and Data Security.[S.l.]:Springer Berlin Heidelberg,2008:83-97.
  • 6Brickell J,Porter D,Shmatikov V,et al.Privacy-preserving remote diagnostics[C]//Proceedings of the 14th ACM Conference on Computer and Communications Security,2007:498-507.
  • 7Mohassel P,Niksefat S.Oblivious Decision Programs from Oblivious Transfer:Efficient Reductions[M]//Angelos D.Financial Cryptography and Data Security.[S.l.]:Springer Berlin Heidelberg,2012:269-284.
  • 8Rabin M.How to Exchange Secrets by Oblivious Transfer[R].Harvard University,1981.
  • 9Paillier P.Public-key cryptosystems based on composite degree residuosity classes[C]//Advances in CryptologyEUROCRYPT’99.[S.l.]:Springer Berlin Heidelberg,1999:223-238.
  • 10Katz J,Malka L.Secure text processing with applications to private DNA matching[C]∥Proceedings of the 17th ACM Conference on Computer and Communications Security.ACM,2010:485-492.

引证文献3

二级引证文献3

电子学报
2014年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部