- 期刊
Comparison Based Semantic Security is Probabilistic Polynomial Time Equivalent to Indistinguishability
並列摘要
In this paper we try to unify the frameworks of definitions of semantic security, indistinguishability and non-malleability by defining semantic security in comparison based framework. This facilitates the study of relations among these goals against different attack models and makes the proof of the equivalence of semantic security and indistinguishability easier and more understandable. Besides, our proof of the equivalence of semantic security and indistinguishability does not need any intermediate goals such as non devidability to change the definition framework.
延伸閱讀
- Chao, C. L. (2017). Semi-passivity and Synchronization in Linearly Coupled Systems [master's thesis, National Chiao Tung University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0030-0705201811390575
- Weng, W. C. (2009). Scalable Security Property Checking by Loop Dependence and Constraint Contradiction Analysis [master's thesis, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2009.00646
- Ji, Y., Wang, T., & Li, Y. (2014). A Continuous Trust-Region-Type Method for Solving Nonlinear Semidefinite Complementarity Problem. Abstract and Applied Analysis, 2014(), 345-353-933. https://doi.org/10.1155/2014/589731
- Sung, J. S. (2007). Dynamic Probabilistic Packet Marking with Partial Non-Preemption [master's thesis, Tatung University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0081-0607200917243378
- Sosík, P., Patón, A. R., & Ciencialova, L. (2013). POLYNOMIAL TIME-BOUNDED COMPUTATIONS IN SPIKING NEURAL P SYSTEMS. Neural Network World, 23(1), 31-48. https://doi.org/10.14311/NNW.2013.23.003