Conecte-se

Bibliografias temáticas / Untrusted Code

Literatura científica selecionada sobre o tema "Untrusted Code"

Autor: Grafiati

Publicado: 25 de maio de 2024

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Índice

Artigos de revistas
Teses / dissertações
Capítulos de livros
Trabalhos de conferências

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Untrusted Code".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Untrusted Code"

1

Lampson, Butler. "Making untrusted code useful". Communications of the ACM 54, n.º 11 (novembro de 2011): 92. http://dx.doi.org/10.1145/2018396.2018418.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Patel, Parveen, Andrew Whitaker, David Wetherall, Jay Lepreau e Tim Stack. "Upgrading transport protocols using untrusted mobile code". ACM SIGOPS Operating Systems Review 37, n.º 5 (dezembro de 2003): 1–14. http://dx.doi.org/10.1145/1165389.945447.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Sewell, Peter, e Jan Vitek. "Secure composition of untrusted code: box π, wrappers, and causality types". Journal of Computer Security 11, n.º 2 (1 de abril de 2003): 135–87. http://dx.doi.org/10.3233/jcs-2003-11202.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Bugerya, A. B., V. Yu Efimov, I. I. Kulagin, V. A. Padaryan, M. A. Solovev e A. Yu Tikhonov. "A software complex for revealing malicious behavior in untrusted binary code". Proceedings of the Institute for System Programming of the RAS 31, n.º 6 (2019): 33–64. http://dx.doi.org/10.15514/ispras-2019-31(6)-3.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Liu, Hua Xiao, e Ying Jin. "Enumeration Based Security Behavior Model Checking Algorithm". Applied Mechanics and Materials 20-23 (janeiro de 2010): 808–13. http://dx.doi.org/10.4028/www.scientific.net/amm.20-23.808.

Texto completo da fonte

Resumo:

Model Carrying Code(MCC) provides a way to safe execution of untrusted code by taking both mobile code producer and consumers into consideration, where it checks mobile code security by comparing security related program behavior model with security policies. In this paper an enumeration based algorithm to checking security related behavior with respect to security policy has been given, where security behavior has been modeled as extended context free grammar and the security policy has been specified as extended FSA. Solutions to dealing with loops and recursions have been introduced. A program has been developed for implementing the algorithm, and several experiments have been done. It has been indicated that our algorithm can effectively check small scale security behavior models on the basis of simple security policies.

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Howard, Heidi, Fritz Alder, Edward Ashton, Amaury Chamayou, Sylvan Clebsch, Manuel Costa, Antoine Delignat-Lavaud et al. "Confidential Consortium Framework: Secure Multiparty Applications with Confidentiality, Integrity, and High Availability". Proceedings of the VLDB Endowment 17, n.º 2 (outubro de 2023): 225–40. http://dx.doi.org/10.14778/3626292.3626304.

Texto completo da fonte

Resumo:

Confidentiality, integrity protection, and high availability, abbreviated to CIA, are essential properties for trustworthy data systems. The rise of cloud computing and the growing demand for multiparty applications however means that building modern CIA systems is more challenging than ever. In response, we present the Confidential Consortium Framework (CCF), a general-purpose foundation for developing secure stateful CIA applications. CCF combines centralized compute with decentralized trust, supporting deployment on untrusted cloud infrastructure and transparent governance by mutually untrusted parties. CCF leverages hardware-based trusted execution environments for remotely verifiable confidentiality and code integrity. This is coupled with state machine replication backed by an auditable immutable ledger for data integrity and high availability. CCF enables each service to bring its own application logic, custom multiparty governance model, and deployment scenario, decoupling the operators of nodes from the consortium that governs them. CCF is open-source and available now at https://github.com/microsoft/CCF.

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Han, Jideng, Zhaoxin Zhang, Yuejin Du, Wei Wang e Xiuyuan Chen. "ESFuzzer: An Efficient Way to Fuzz WebAssembly Interpreter". Electronics 13, n.º 8 (15 de abril de 2024): 1498. http://dx.doi.org/10.3390/electronics13081498.

Texto completo da fonte

Resumo:

WebAssembly code is designed to run in a sandboxed environment, such as a web browser, providing a high level of security and isolation from the underlying operating system and hardware. This enables the execution of untrusted code in a web browser without compromising the security and integrity of the user’s system. This paper discusses the challenges associated with using fuzzing tools to identify vulnerabilities or bugs in WebAssembly interpreters. Our approach, known as ESFuzzer, introduces an efficient method for fuzzing WebAssembly interpreters using an Equivalent-Statement concept and the Stack Repair Algorithm. The samples generated by our approach successfully passed code validation. In addition, we developed effective mutation strategies to enhance the efficacy of our approach. ESFuzzer has demonstrated its ability to generate code that achieves 100% WebAssembly validation testing and achieves code coverage that is more than twice that of libFuzzer. Furthermore, the 24-h experiment results show that ESFuzzer performs ten times more efficiently than libFuzzer.

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

FERRARI, GIANLUIGI, EUGENIO MOGGI e ROSARIO PUGLIESE. "MetaKlaim: a type safe multi-stage language for global computing". Mathematical Structures in Computer Science 14, n.º 3 (20 de maio de 2004): 367–95. http://dx.doi.org/10.1017/s0960129504004165.

Texto completo da fonte

Resumo:

This paper describes the design and semantics of METAKLAIM, which is a higher order distributed process calculus equipped with staging mechanisms. METAKLAIM integrates METAML (an extension of SML for multi-stage programming) and KLAIM (a Kernel Language for Agents Interaction and Mobility), to permit interleaving of meta-programming activities (such as assembly and linking of code fragments), dynamic checking of security policies at administrative boundaries and ‘traditional’ computational activities on a wide area network (such as remote communication and code mobility). METAKLAIM exploits a powerful type system (including polymorphic types á la system F) to deal with highly parameterised mobile components and to enforce security policies dynamically: types are metadata that are extracted from code at run-time and are used to express trustiness guarantees. The dynamic type checking ensures that the trustiness guarantees of wide area network applications are maintained whenever computations interoperate with potentially untrusted components.

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Mitropoulos, Dimitris, e Diomidis Spinellis. "Fatal injection: a survey of modern code injection attack countermeasures". PeerJ Computer Science 3 (27 de novembro de 2017): e136. http://dx.doi.org/10.7717/peerj-cs.136.

Texto completo da fonte

Resumo:

With a code injection attack (CIA) an attacker can introduce malicious code into a computer program or system that fails to properly encode data that comes from an untrusted source. A CIA can have different forms depending on the execution context of the application and the location of the programming flaw that leads to the attack. Currently, CIAs are considered one of the most damaging classes of application attacks since they can severely affect an organisation’s infrastructure and cause financial and reputational damage to it. In this paper we examine and categorize the countermeasures developed to detect the various attack forms. In particular, we identify two distinct categories. The first incorporates static program analysis tools used to eliminate flaws that can lead to such attacks during the development of the system. The second involves the use of dynamic detection safeguards that prevent code injection attacks while the system is in production mode. Our analysis is based on nonfunctional characteristics that are considered critical when creating security mechanisms. Such characteristics involve usability, overhead, implementation dependencies, false positives and false negatives. Our categorization and analysis can help both researchers and practitioners either to develop novel approaches, or use the appropriate mechanisms according to their needs.

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Gourdin, Léo, Benjamin Bonneau, Sylvain Boulmé, David Monniaux e Alexandre Bérard. "Formally Verifying Optimizations with Block Simulations". Proceedings of the ACM on Programming Languages 7, OOPSLA2 (16 de outubro de 2023): 59–88. http://dx.doi.org/10.1145/3622799.

Texto completo da fonte

Resumo:

CompCert (ACM Software System Award 2021) is the first industrial-strength compiler with a mechanically checked proof of correctness. Yet, CompCert remains a moderately optimizing C compiler. Indeed, some optimizations of “gcc ‍-O1” such as Lazy Code Motion (LCM) or Strength Reduction (SR) were still missing: developing these efficient optimizations together with their formal proofs remained a challenge. Cyril Six et al. have developed efficient formally verified translation validators for certifying the results of superblock schedulers and peephole optimizations. We revisit and generalize their approach into a framework (integrated into CompCert) able to validate many more optimizations: an enhanced superblock scheduler, but also Dead Code Elimination (DCE), Constant Propagation (CP), and more noticeably, LCM and SR. In contrast to other approaches to translation validation, we co-design our untrusted optimizations and their validators. Our optimizations provide hints, in the forms of invariants or CFG morphisms , that help keep the formally verified validators both simple and efficient. Such designs seem applicable beyond CompCert.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Teses / dissertações sobre o assunto "Untrusted Code"

1

Menage, Paul Barnaby. "Resource control of untrusted code in an open programmable network". Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621902.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Carpentier, Robin. "Privacy-preserving third-party computations on secure personal data management systems". Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG079.

Texto completo da fonte

Resumo:

La centralisation des données personnelles par certaines des entreprises les plus influentes du monde met en péril la vie privée des individus. Des législations récentes comme le Règlement Général sur la Protection des Données en Europe encadrent la collecte et le traitement des données des citoyens. En particulier, le droit à la portabilité permet aux individus de récupérer une copie de leurs données détenues par un organisme. Conjointement, des solutions de Cloud Personnels (PDMS) se développent, renforçant l'autonomisation des utilisateurs en leur facilitant la gestion de leurs données. Elles permettent notamment la collecte automatique de données, leur partage et la prise en charge de traitement avancés. Dans ces solutions, les données de l'utilisateur sont traitées directement là où elles sont stockées par un code de traitement écrit par un tiers. Ici, seuls les résultats sont partagés à un tier sur décision de l'utilisateur. Ce paradigme est en opposition avec l'approche classique qui voit les données de l'utilisateur partagée dans leur intégralité à un tier pour être traitées. Pour être viables, les PDMS doivent satisfaire deux prérequis : ils doivent assurer la sécurité des données en présence d'un utilisateur novice dans ce domaine tout en étant le plus extensible possible afin de garantir une richesse de traitements sur ces données. Pour adresser ce conflit entre extensibilité et sécurité, cette thèse s'appuie sur une architecture incluant des modules tiers couplée à des mécanismes de sécurité matériels appelés Environnements d'Exécution de Confiance. Nous proposons des briques de sécurité pour limiter les fuites de données résultant de l'utilisation de ces modules tiers ainsi que des stratégies d'exécution implémentant ces briques et limitant l'impact sur les performances des traitements
The privacy of individuals is constantly undermined by some of the most prominent companies in the world which centralize vast amounts of personal data. Recent legal means such as the General Data Protection Regulation in Europe regulate the collection and processing of citizens' data. In particular, data portability grants individuals the right to recover a copy of their data held by an organization. At the same time, Personal Data Management Systems (PDMS) are emerging, empowering users by facilitating the management of their data. For example, these solutions enable automatic data collection, sharing, and advanced processing. In these solutions, the user's data is processed directly where it is stored by a processing code potentially written by a third party. Here, only the results are shared with a third party upon the user's decision. This paradigm diverges from the traditional approach in which the user's data is entirely shared with a third party for processing. To be viable, PDMS must satisfy two prerequisites: they must ensure the security of the data in the presence of a layman user while being as extensible as possible to support diverse computations on this data. To address this conflict between extensibility and security, this thesis relies on an architecture including third-party modules coupled with hardware security mechanisms called Trusted Executions Environments. In this context, we propose security building blocks to limit data leakage resulting from the use of these third-party modules as well as execution strategies implementing these building blocks and limiting the impact on performances

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Roy, Indrajit. "Protecting sensitive information from untrusted code". Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-08-1951.

Texto completo da fonte

Resumo:

As computer systems support more aspects of modern life, from finance to health care, security is becoming increasingly important. However, building secure systems remains a challenge. Software continues to have security vulnerabilities due to reasons ranging from programmer errors to inadequate programming tools. Because of these vulnerabilities we need mechanisms that protect sensitive data even when the software is untrusted. This dissertation shows that secure and practical frameworks can be built for protecting users' data from untrusted applications in both desktop and cloud computing environment. Laminar is a new framework that secures desktop applications by enforcing policies written as information flow rules. Information flow control, a form of mandatory access control, enables programmers to write powerful, end-to-end security guarantees while reducing the amount of trusted code. Current programming abstractions and implementations of this model either compromise end-to-end security guarantees or require substantial modifications to applications, thus deterring adoption. Laminar addresses these shortcomings by exporting a single set of abstractions to control information flows through operating system resources and heap-allocated objects. Programmers express security policies by labeling data and represent access restrictions on code using a new abstraction called a security region. The Laminar programming model eases incremental deployment, limits dynamic security checks, and supports multithreaded programs that can access heterogeneously labeled data. In large scale, distributed computations safeguarding information requires solutions beyond mandatory access control. An important challenge is to ensure that the computation, including its output, does not leak sensitive information about the inputs. For untrusted code, access control cannot guarantee that the output does not leak information. This dissertation proposes Airavat, a MapReduce-based system which augments mandatory access control with differential privacy to guarantee security and privacy for distributed computations. Data providers control the security policy for their sensitive data, including a mathematical bound on potential privacy violations. Users without security expertise can perform computations on the data; Airavat prevents information leakage beyond the data provider's policy. Our prototype implementation of Airavat demonstrates that several data mining tasks can be performed in a privacy preserving fashion with modest performance overheads.
text

Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Untrusted Code"

1

Wen, Yan, Jinjing Zhao e Huaimin Wang. "A Novel Approach for Untrusted Code Execution". In Information and Communications Security, 398–411. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-77048-0_31.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Necula, George C., e Peter Lee. "Safe, Untrusted Agents Using Proof-Carrying Code". In Lecture Notes in Computer Science, 61–91. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-68671-1_5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Necula, George C., e Robert R. Schneck. "Proof-Carrying Code with Untrusted Proof Rules". In Software Security — Theories and Systems, 283–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36532-x_18.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Staats, Matthew, e Mats P. E. Heimdahl. "Partial Translation Verification for Untrusted Code-Generators". In Formal Methods and Software Engineering, 226–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88194-0_15.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Bottesch, Ralph, Max W. Haslbeck, Alban Reynaud e René Thiemann. "Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL". In Lecture Notes in Computer Science, 233–50. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55754-6_14.

Texto completo da fonte

Resumo:

AbstractWe implement a decision procedure for linear mixed integer arithmetic and formally verify its soundness in Isabelle/HOL. We further integrate this procedure into one application, namely into , a formally verified certifier to check untrusted termination proofs. This checking involves assertions of unsatisfiability of linear integer inequalities; previously, only a sufficient criterion for such checks was supported. To verify the soundness of the decision procedure, we first formalize the proof that every satisfiable set of linear integer inequalities also has a small solution, and give explicit upper bounds. To this end we mechanize several important theorems on linear programming, including statements on integrality and bounds. The procedure itself is then implemented as a branch-and-bound algorithm, and is available in several languages via Isabelle’s code generator. It internally relies upon an adapted version of an existing verified incremental simplex algorithm.

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Boldrin, Luca, Giovanni Paolo Sellitto e Jaak Tepandi. "TOOP Trust Architecture". In The Once-Only Principle, 126–40. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79851-2_7.

Texto completo da fonte

Resumo:

AbstractWhile information security nowadays represents a core concern for any organization, Trust Management is usually less elaborated and is only important when two or more organizations cooperate towards a common objective. The overall Once-Only Principle Project (TOOP) architecture relies on the concept of trusted sources of information and on the existence of a secure exchange channel between the Data Providers and the Data Consumers in this interaction framework. Trust and information security are two cross-cutting concerns of paramount importance. These two concerns are overlapping, but not identical and they span all of the interoperability layers, from the legal down to the technical, passing through organizational and semantic layers. While information security aims at the preservation of confidentiality, integrity and availability of information, trust establishment guarantees that the origin and the destination of the data and documents are authentic (authenticity) and trustworthy (trustworthiness), and that data and documents are secured against any modification by untrusted parties (integrity). In this chapter, the TOOP Trust Architecture is presented, starting from a simple abstract model of interaction between two agents down to the detailed end-to-end trust establishment architecture, modeled onto the Toop Reference Architecture presented in the previous chapter.

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

"Verifiable Computing: Secure Code Execution Despite Untrusted Software and Hardware". In Trust Extension as a Mechanism for Secure Code Execution on Commodity Computers. ACM, 2014. http://dx.doi.org/10.1145/2611399.2611406.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Pistoia, Marco, Omer Tripp e David Lubensky. "Combining Static Code Analysis and Machine Learning for Automatic Detection of Security Vulnerabilities in Mobile Apps". In Application Development and Design, 1121–47. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3422-8.ch047.

Texto completo da fonte

Resumo:

Mobile devices have revolutionized many aspects of our lives. Without realizing it, we often run on them programs that access and transmit private information over the network. Integrity concerns arise when mobile applications use untrusted data as input to security-sensitive computations. Program-analysis tools for integrity and confidentiality enforcement have become a necessity. Static-analysis tools are particularly attractive because they do not require installing and executing the program, and have the potential of never missing any vulnerability. Nevertheless, such tools often have high false-positive rates. In order to reduce the number of false positives, static analysis has to be very precise, but this is in conflict with the analysis' performance and scalability, requiring a more refined model of the application. This chapter proposes Phoenix, a novel solution that combines static analysis with machine learning to identify programs exhibiting suspicious operations. This approach has been widely applied to mobile applications obtaining impressive results.

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Pasupuleti, Syam Kumar. "Privacy-Preserving Public Auditing and Data Dynamics for Secure Cloud Storage Based on Exact Regenerated Code". In Research Anthology on Privatizing and Securing Data, 1003–22. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-8954-0.ch046.

Texto completo da fonte

Resumo:

Cloud storage allows users to store their data in the cloud to avoid local storage and management costs. Since the cloud is untrusted, the integrity of stored data in the cloud has become an issue. To address this problem, several public auditing schemes have been designed to verify integrity of the data in the cloud. However, these schemes have two drawbacks: public auditing may reveal sensitive data to verifier and does not address the data recovery problem efficiently. This article proposes a new privacy-preserving public auditing scheme with data dynamics to secure the data in the cloud based on an exact regenerated code. This scheme encodes the data for availability, then masks the encoded blocks with randomness for privacy of data and enables a public auditor to verify the integrity of the data. Further, this scheme also supports dynamic data updates. In addition, security and performance analysis proves that proposed scheme is provably secure and efficient.

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Pistoia, Marco, Omer Tripp e David Lubensky. "Combining Static Code Analysis and Machine Learning for Automatic Detection of Security Vulnerabilities in Mobile Apps". In Mobile Application Development, Usability, and Security, 68–94. IGI Global, 2017. http://dx.doi.org/10.4018/978-1-5225-0945-5.ch004.

Texto completo da fonte

Resumo:

Mobile devices have revolutionized many aspects of our lives. Without realizing it, we often run on them programs that access and transmit private information over the network. Integrity concerns arise when mobile applications use untrusted data as input to security-sensitive computations. Program-analysis tools for integrity and confidentiality enforcement have become a necessity. Static-analysis tools are particularly attractive because they do not require installing and executing the program, and have the potential of never missing any vulnerability. Nevertheless, such tools often have high false-positive rates. In order to reduce the number of false positives, static analysis has to be very precise, but this is in conflict with the analysis' performance and scalability, requiring a more refined model of the application. This chapter proposes Phoenix, a novel solution that combines static analysis with machine learning to identify programs exhibiting suspicious operations. This approach has been widely applied to mobile applications obtaining impressive results.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Untrusted Code"

1

Birman, Ken. "Session details: Safely executing untrusted code". In SOSP03: ACM Symposium on Operating Systems Principles. New York, NY, USA: ACM, 2003. http://dx.doi.org/10.1145/3245957.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

2

Patel, Parveen, Andrew Whitaker, David Wetherall, Jay Lepreau e Tim Stack. "Upgrading transport protocols using untrusted mobile code". In the nineteenth ACM symposium. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/945445.945447.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

3

Leontie, Eugen, Gedare Bloom, Bhagirath Narahari, Rahul Simha e Joseph Zambreno. "Hardware-enforced fine-grained isolation of untrusted code". In the first ACM workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1655077.1655082.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

4

Wartell, Richard, Vishwath Mohan, Kevin W. Hamlen e Zhiqiang Lin. "Securing untrusted code via compiler-agnostic binary rewriting". In the 28th Annual Computer Security Applications Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2420950.2420995.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

5

Yee, Bennet, David Sehr, Gregory Dardyk, J. Bradley Chen, Robert Muth, Tavis Ormandy, Shiki Okasaka, Neha Narula e Nicholas Fullagar. "Native Client: A Sandbox for Portable, Untrusted x86 Native Code". In 2009 30th IEEE Symposium on Security and Privacy (SP). IEEE, 2009. http://dx.doi.org/10.1109/sp.2009.25.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

6

Zhang, Linfeng, Yan Wen e Kai Du. "Pollux VMM: A Virtual Machine Monitor for Executing Untrusted Code". In 2009 First International Conference on Information Science and Engineering. IEEE, 2009. http://dx.doi.org/10.1109/icise.2009.835.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

7

Wen, Yan, Jinjing Zhao, Gang Zhao, Hua Chen e Dongxia Wang. "A Survey of Virtualization Technologies Focusing on Untrusted Code Execution". In 2012 Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS). IEEE, 2012. http://dx.doi.org/10.1109/imis.2012.92.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

8

Gao, Zhenzhen, Xuewen Liao, Xiaodong Sun e Shihua Zhu. "A secure space-time code for asynchronous cooperative communication systems with untrusted relays". In 2013 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2013. http://dx.doi.org/10.1109/wcnc.2013.6555250.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

9

Shahani, Snehkumar, Jibi Abraham e Venkateswaran. "Techniques for Privacy-Preserving Data Aggregation in an Untrusted Distributed Environment". In CODS-COMAD 2023: 6th Joint International Conference on Data Science & Management of Data (10th ACM IKDD CODS and 28th COMAD). New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3570991.3571020.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

10

Lin, Elizabeth, Igibek Koishybayev, Trevor Dunlap, William Enck e Alexandros Kapravelos. "UntrustIDE: Exploiting Weaknesses in VS Code Extensions". In Network and Distributed System Security Symposium. Reston, VA: Internet Society, 2024. http://dx.doi.org/10.14722/ndss.2024.24073.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!