{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:40Z","timestamp":1750307920169,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2006,1]]},"abstract":"<jats:p>\n            A number of real-time embedded systems (RTESs) are used to manage critical infrastructure such as electric grids or C\n            <jats:sup>4<\/jats:sup>\n            I systems. In these systems, it is essential to meet deadlines, for example, to avoid a power outage or loss of a life. The importance of security support is also increasing, because more RTESs are being networked. To securely transmit sensitive data, e.g., a battle field status, across the network, RTESs need to protect the data via cryptographic techniques. However, security support may cause deadline misses or unacceptable QoS degradation. As an initial effort to address this problem, we formulate the security support in RTESs as a QoS optimization problem. Also, we propose a novel adaptive approach for security support in which a RTES initially uses a relatively short cryptographic key to maximize the QoS, while increasing the key length when the security risk level is raised. In this way, we can make a possible cryptanalysis several orders of magnitude harder by requiring the attacker to search a larger key space, while meeting all deadlines by degrading the QoS in a controlled manner. To minimize the overhead, we derive the appropriate QoS levels for several key lengths via an offine polynomial time algorithm. When the risk level is raised online, a real-time task can use a longer key and adapt to the corresponding QoS level (derived offine) in O(1) time.\n          <\/jats:p>","DOI":"10.1145\/1279711.1279718","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T13:44:55Z","timestamp":1189777495000},"page":"29-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Towards security and QoS optimization in real-time embedded systems"],"prefix":"10.1145","volume":"3","author":[{"given":"Kyoung-Don","family":"Kang","sequence":"first","affiliation":[{"name":"Department of Computer Science, State University of New York at Binghamton"}]},{"given":"Sang H.","family":"Son","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Virginia"}]}],"member":"320","published-online":{"date-parts":[[2006,1]]},"reference":[{"volume-title":"Maintaining Security in Firm Real-Time Database Systems. In 14th Annual Computer Security Applications Conference","year":"1998","author":"Ahmed Q.","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796360"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1694"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008783216944"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/900546"},{"volume-title":"On Quality of Service Optimization with Discrete QoS Options. In the 4th IEEE Real-Time Technology and Applications Symposium","year":"1998","author":"Lee C.","key":"e_1_2_1_7_1"},{"volume-title":"Liu. Imprecise Results: Utilizing Partial Computations in Real-Time Systems. In Real-Time System Symposium","year":"1987","author":"Lin K. J.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","first-page":"1508","article-title":"Generic Security Service Application Program Interface","author":"Linn J.","year":"1993","journal-title":"IETF Request for Comments"},{"key":"e_1_2_1_10_1","unstructured":"{10} W. Mao. Modern Cryptography. Prentice Hall 2004.   {10} W. Mao. Modern Cryptography . Prentice Hall 2004."},{"volume-title":"Protecting Resources with Resource Control Lists. In IEEE Real Time Technology and Applications Symposium","year":"2001","author":"Miyoshi A.","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","unstructured":"{12} National Institute of Standards and Technology Federal Information Processing Standards Publication 197: Announcing the Advanced Encryption Standard Nov. 2001.  {12} National Institute of Standards and Technology Federal Information Processing Standards Publication 197: Announcing the Advanced Encryption Standard Nov. 2001."},{"key":"e_1_2_1_13_1","unstructured":"{13} B. Schneier. Applied Cryptography. Wiley 2nd edition 1996.  {13} B. Schneier. Applied Cryptography . Wiley 2nd edition 1996."},{"key":"e_1_2_1_14_1","unstructured":"{14} J. W. S. Liu. Real-Time Systems. Prentice Hall 2000.   {14} J. W. S. Liu. Real-Time Systems . Prentice Hall 2000."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.895799"},{"key":"e_1_2_1_16_1","first-page":"63","volume-title":"An Adaptable Security Manager for Real-Time Transactions. In Euromicro Conference on Real-Time Systems","author":"Son S. H.","year":"2000"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/784591.784722"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/775412.775441"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1279711.1279718","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1279711.1279718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:33Z","timestamp":1750258293000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1279711.1279718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["10.1145\/1279711.1279718"],"URL":"https:\/\/doi.org\/10.1145\/1279711.1279718","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2006,1]]},"assertion":[{"value":"2006-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}