Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Catalin Hritcu"'
Autor:
Akram El-Korashy, Roberto Blanco, Jeremy Thibault, Adrien Durier, Deepak Garg, Catalin Hritcu
Publikováno v:
2022 IEEE 35th Computer Security Foundations Symposium
Proving secure compilation of partial programs typically requires back-translating an attack against the compiled program to an attack against the source program. To prove back-translation, one can syntactically translate the target attacker to a sou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7fa67dc050bdddff74c88164526e4f5
https://hdl.handle.net/21.11116/0000-0009-B271-E21.11116/0000-0009-B26F-2
https://hdl.handle.net/21.11116/0000-0009-B271-E21.11116/0000-0009-B26F-2
Publikováno v:
CSF
IEEE 34th Computer Security Foundations Symposium (CSF)
2021 IEEE 34th Computer Security Foundations Symposium (CSF)
IEEE 34th Computer Security Foundations Symposium (CSF)
2021 IEEE 34th Computer Security Foundations Symposium (CSF)
We show that noninterference and transparency, the key soundness theorems for dynamic IFC libraries, can be obtained "for free", as direct consequences of the more general parametricity theorem of type abstraction. This allows us to give very short s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::057a8f7fac644f722b71a4bb0b28fe37
https://doi.org/10.1109/csf51468.2021.00005
https://doi.org/10.1109/csf51468.2021.00005
Autor:
Catalin Hritcu, Jan Schwinghammer
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 4 (2009)
Step-indexed semantic interpretations of types were proposed as an alternative to purely syntactic proofs of type safety using subject reduction. The types are interpreted as sets of values indexed by the number of computation steps for which these v
Externí odkaz:
https://doaj.org/article/c1499712fdea4cc1b05f60d3b71c053f
Autor:
Deepak Garg, Carmine Abate, Jérémy Thibault, Catalin Hritcu, Roberto Blanco, Marco Patrignani
Publikováno v:
32nd IEEE Computer Security Foundations Symposium (CSF)
2019 IEEE 32nd Computer Security Foundations Symposium (CSF)
CSF 2019-32nd IEEE Computer Security Foundations Symposium
CSF 2019-32nd IEEE Computer Security Foundations Symposium, Jun 2019, Hoboken, United States. pp.256-271, ⟨10.1109/CSF.2019.00025⟩
CSF
2019 IEEE 32nd Computer Security Foundations Symposium (CSF)
CSF 2019-32nd IEEE Computer Security Foundations Symposium
CSF 2019-32nd IEEE Computer Security Foundations Symposium, Jun 2019, Hoboken, United States. pp.256-271, ⟨10.1109/CSF.2019.00025⟩
CSF
(CROPPED TO FIT IN ARXIV'S SILLY LIMIT. SEE PDF FOR COMPLETE ABSTRACT.) We are the first to thoroughly explore a large space of formal secure compilation criteria based on robust property preservation, i.e., the preservation of properties satisfied a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5258244ad14840038a19bfa836a7a4d
https://doi.org/10.1109/CSF.2019.00025
https://doi.org/10.1109/CSF.2019.00025
Autor:
Théo Laurent, Roberto Blanco, Arthur Azevedo de Amorim, Catalin Hritcu, Marco Stronati, Andrew Tolmach, Carmine Abate, Guglielmo Fachini, Benjamin C. Pierce, Ana Nora Evans
Publikováno v:
CCS
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security-CCS 18
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security -CCS '18
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security-CCS 18
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security -CCS '18
We propose a new formal criterion for evaluating secure compilation schemes for unsafe languages, expressing end-to-end security guarantees for software components that may become compromised after encountering undefined behavior---for example, by ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa3e4c30ef24d96db436671d67487d2b
https://doi.org/10.1145/3243734.3243745
https://doi.org/10.1145/3243734.3243745
Autor:
Nikos Vasilakis, Udit Dhawan, Raphael Rubin, André DeHon, Jonathan M. Smith, Benjamin C. Pierce, Thomas F. Knight, Silviu Chiricescu, Catalin Hritcu
Publikováno v:
ASPLOS
20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015)
20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015), Mar 2015, Istanbul, Turkey. pp.487-502, ⟨10.1145/2694344.2694383⟩
20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015)
20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2015), Mar 2015, Istanbul, Turkey. pp.487-502, ⟨10.1145/2694344.2694383⟩
Optimized hardware for propagating and checking software-programmable metadata tags can achieve low runtime overhead. We generalize prior work on hardware tagging by considering a generic architecture that supports software-defined policies over meta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1019ce1fa764bf1583763520bcde5653
https://doi.org/10.1145/2786763.2694383
https://doi.org/10.1145/2786763.2694383
Publikováno v:
International Journal of Computing. :44-48
The aim of this paper is twofold. First, we present the basic principles and point out the main difficulties in writing a library supporting operations with arbitrarily large numbers. Aspects such as library structure, number representation, algorith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::851c03db3f45ce737d18935e3a8f6a25
https://doi.org/10.47839/ijc.2.3.228
https://doi.org/10.47839/ijc.2.3.228
Publikováno v:
29th IEEE Symposium on Computer Security Foundations (CSF)
29th IEEE Symposium on Computer Security Foundations (CSF), 2016, Lisabon, Portugal. pp.45--60, ⟨10.1109/CSF.2016.11⟩
CSF
29th IEEE Symposium on Computer Security Foundations (CSF), 2016, Lisabon, Portugal. pp.45--60, ⟨10.1109/CSF.2016.11⟩
CSF
Compartmentalization is good security-engineering practice. By breaking a large software system into mutually distrustful components that run with minimal privileges, restricting their interactions to conform to well-defined interfaces, we can limit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07491133ff449ffd069dcc1457698deb
https://hal.archives-ouvertes.fr/hal-01424795
https://hal.archives-ouvertes.fr/hal-01424795
Autor:
Andrew Tolmach, Benjamin C. Pierce, Antal Spector-Zabusky, Arthur Azevedo de Amorim, Nick Giannarakis, Catalin Hritcu, Maxime Dénès
Publikováno v:
IEEE Symposium on Security and Privacy
2015 IEEE Symposium on Security and Privacy
2015 IEEE Symposium on Security and Privacy, May 2015, San Jose, United States. pp.813-830, ⟨10.1109/SP.2015.55⟩
2015 IEEE Symposium on Security and Privacy
2015 IEEE Symposium on Security and Privacy, May 2015, San Jose, United States. pp.813-830, ⟨10.1109/SP.2015.55⟩
International audience ; Recent advances in hardware design have demonstrated mechanisms allowing a wide range of low-level security policies (or micro-policies) to be expressed using rules on metadata tags. We propose a methodology for defining and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::032279c920072a1563342cc979436f2f
https://doi.org/10.1109/sp.2015.55
https://doi.org/10.1109/sp.2015.55
Autor:
Georges, Aïna Linn1 algeorges@mpi-sws.org, Guéneau, Armaël2 armael.gueneau@inria.fr, Van Strydonck, Thomas3 thomas.vanstrydonck@cs.kuleuven.be, Timany, Amin4 timany@cs.au.dk, Trieu, Alix5 alix.trieu@ssi.gouv.fr, Devriese, Dominique3 dominique.devriese@kuleuven.be, Birkedal, Lars4 birkedal@cs.au.dk
Publikováno v:
Journal of the ACM. Feb2024, Vol. 71 Issue 1, p1-59. 59p.