On the Concept of Trusted Computing and Software Watermarking: A Computational Complexity Treatise

被引:0
|
作者
Wu Hao [1 ]
Wu Guoqing [1 ]
机构
[1] Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China
关键词
Trusted computing; Trust measurement; one way function; software watermarking;
D O I
10.1016/j.phpro.2012.03.112
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Trusted computing is a new requirement of information security, after the successful modern cryptography. Although there are many developments of methods and techniques to address on the problems of trusted computing, the lack of rigorous theoretic treatment makes it hard to give further mathematical treatment. In this paper, we develop theory and concepts of trusted computing founded on computational complexity, which analogies to modern cryptography and find close connections between trusted computing and one way functions, one of the pillars of the modern cryptography. After that, we reveal that trusted computing has a subtle but deep relation with software watermarking, that concept can be found on the concept of trusted computing. (c) 2012 Published by Elsevier B.V. Selection and/or peer-review under responsibility of Garry Lee
引用
收藏
页码:465 / 474
页数:10
相关论文
共 50 条
  • [21] NONDISCRETE BIOMOLECULAR COMPUTING - AN APPROACH TO COMPUTATIONAL-COMPLEXITY
    RAMBIDI, NG
    BIOSYSTEMS, 1993, 31 (01) : 3 - 13
  • [22] Computational complexity in high-dimensional quantum computing
    Nagata, Koji
    Do Ngoc Diep
    Nakamura, Tadao
    QUANTUM MACHINE INTELLIGENCE, 2022, 4 (02)
  • [23] AN APPROACH TO COMPUTATIONAL-COMPLEXITY - NONDISCRETE BIOMOLECULAR COMPUTING
    RAMBIDI, NG
    COMPUTER, 1992, 25 (11) : 51 - 54
  • [24] Computational Complexity of Computing a Quasi-Proper Equilibrium
    Hansen, Kristoffer Arnsfelt
    Lund, Troels Bjerre
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2021, 2021, 12867 : 259 - 271
  • [25] Computational complexity in high-dimensional quantum computing
    Koji Nagata
    Do Ngoc Diep
    Tadao Nakamura
    Quantum Machine Intelligence, 2022, 4
  • [26] Software Implementation of FFT Algorithms and Analysis of their Computational Complexity
    Sinchana, G. S.
    Padaki, Sneha
    Ravi, Veena
    Varshini, Velury Suguna
    Raghavendra, C. G.
    2018 3RD INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, COMMUNICATION, COMPUTER, AND OPTIMIZATION TECHNIQUES (ICEECCOT - 2018), 2018, : 486 - 490
  • [27] Curb: Trusted and Scalable Software-Defined Network Control Plane for Edge Computing
    Xu, Minghui
    Wang, Chenxu
    Zou, Yifei
    Yu, Dongxiao
    Cheng, Xiuzhen
    Lyu, Weifeng
    2022 IEEE 42ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2022), 2022, : 492 - 502
  • [28] Analysis of computational complexity and time losses of the distributed computing systems
    Semchystlyn, Yuriy
    Fedasyuk, Dmytro
    2007 PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON THE EXPERIENCE OF DESIGNING AND APPLICATION OF CAD SYSTEMS IN MICROELECTRONICS, 2007, : 415 - 417
  • [29] Computational complexity of computing a partial solution for the Graph Automorphism problems
    Nagoya, Takayuki
    Toda, Seinosuke
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (21-23) : 2064 - 2071
  • [30] Computational Complexity of Computing Symmetries in Finite-Domain Planning
    Shleyfman, Alexander
    Jonsson, Peter
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2021, 70 : 1183 - 1221