Filters








814 Hits in 4.8 sec

Automatic SAT-Compilation of Protocol Insecurity Problems via Reduction to Planning [chapter]

Alessandro Armando, Luca Compagna
2002 Lecture Notes in Computer Science  
Our approach results from the combination of a reduction of protocol insecurity problems to planning problems and well-known SAT-reduction techniques developed for planning.  ...  We also propose and discuss a set of transformations on protocol insecurity problems whose application has a dramatic effect on the size of the propositional encoding obtained with our SAT-compilation  ...  Automatic SAT-Compilation of Protocol Insecurity Problems Our proposed reduction of protocol insecurity problems to propositional logic is carried out in two steps.  ... 
doi:10.1007/3-540-36135-9_14 fatcat:6uh5hj4ufbaetexxkn3dlt22yi

An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols

Alessandro Armando, Luca Compagna
2005 Electronical Notes in Theoretical Computer Science  
In previous work we showed that automatic SAT-based model-checking techniques based on a reduction of protocol (in)security problems to a sequence of propositional satisfiability problems can be used to  ...  effectively find attacks on protocols.  ...  Acknowledgments We are grateful to Cristina Frà for her contribution to the implementation of the encodings for supporting such an optimized intruder.  ... 
doi:10.1016/j.entcs.2004.05.021 fatcat:gxgc5bvp35an7pjj3pmx5cwluy

SoK: Computer-Aided Cryptography [article]

Manuel Barbosa, Gilles Barthe, Karthikeyan Bhargavan, Bruno Blanchet, Cas Cremers, Kevin Liao, Bryan Parno
2019 IACR Cryptology ePrint Archive  
Computer-aided cryptography is an active area of research that develops and applies formal, machine-checkable approaches to the design, analysis, and implementation of cryptography.  ...  First, we study efforts in combining tools focused on different areas to consolidate the guarantees they can provide.  ...  There have also been performance improvements based on partial order reduction (APTE, AKISS, DEEPSEC) or graph planning (SAT-Equiv).  ... 
dblp:journals/iacr/BarbosaBBBCLP19 fatcat:ky7xph7q3vfpxd2q2cfpybhw5e

SoK: Computer-Aided Cryptography

Manuel Barbosa, Gilles Barthe, Karthik Bhargavan, Bruno Blanchet, Cas Cremers, Kevin Liao, Bryan Parno
2021 2021 IEEE Symposium on Security and Privacy (SP)  
Computer-aided cryptography is an active area of research that develops and applies formal, machine-checkable approaches to the design, analysis, and implementation of cryptography.  ...  First, we study efforts in combining tools focused on different areas to consolidate the guarantees they can provide.  ...  There have also been performance improvements based on partial order reduction (APTE, AKISS, DEEPSEC) or graph planning (SAT-Equiv).  ... 
doi:10.1109/sp40001.2021.00008 fatcat:hvor2dotoracledftqympf5ai4

Applying Formal Methods to Networking: Theory, Techniques, and Applications

Junaid Qadir, Osman Hasan
2015 IEEE Communications Surveys and Tutorials  
This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications.  ...  The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built  ...  There has been a remarkable upsurge of interest in propositional logic SAT solving since a diverse class of problems (including scheduling, planning, problems) can be expressed as propositional satisfiability  ... 
doi:10.1109/comst.2014.2345792 fatcat:oc6l6pn4tnddjbbr5v4gbbuycq

Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols

Marco Bozzano, Giorgio Delzanno
2004 Journal of symbolic computation  
Furthermore, our approach can be used both to find attacks and to verify secrecy for a protocol. We apply our method to analyse several classical examples of authentication protocols.  ...  Following the Proceedings of the 12th Computer Security Foundations Workshop (1999) 55, we use multi-conclusion clauses to represent the behaviour of agents in a protocol session, and we adopt the Dolev-Yao  ...  Acknowledgements We would like to thank the anonymous reviewers of this paper for their helpful suggestions and advice.  ... 
doi:10.1016/j.jsc.2004.04.002 fatcat:sjmicevacfcr7orbzcxll7qdhi

Timed automata as a formalism for expressing security: A survey on theory and practice

Johan Arcile, Étienne André
2022 ACM Computing Surveys  
Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints.  ...  While timed automata were originally designed for safety (in the wide sense of correctness w.r.t. a formal property), they were progressively used in a number of works to guarantee security properties.  ...  We would like to thank anonymous reviewers for their useful comments, as well as Jaime Arias and Laure Petrucci for a feedback on their recent works.  ... 
doi:10.1145/3534967 fatcat:bq3focapvzh77lf5qvdx4oskcm

Unifying Compilers for SNARKs, SMT, and More [article]

Alex Ozdemir, Fraser Brown, Riad S. Wahby
2020 IACR Cryptology ePrint Archive  
For example, we build the first pipeline that (1) automatically identifies bugs in programs, then (2) automatically constructs cryptographic proofs of the bugs' existence.  ...  This compilation task is challenging, but not entirely new: the software verification community has a rich literature on compiling programs to logical constraints (like SAT or SMT).  ...  The views in this paper are the authors' and do not necessarily represent the views of the United States Government or DARPA.  ... 
dblp:journals/iacr/OzdemirBW20 fatcat:h7whkhhtfre2tbybjfjzpefxya

Software-Defined Networking: A Comprehensive Survey [article]

Diego Kreutz and Fernando M. V. Ramos and Paulo Verissimo and Christian Esteve Rothenberg and Siamak Azodolmolky and Steve Uhlig
2014 arXiv   pre-print
the network control problem into tractable pieces, SDN makes it easier to create and introduce new abstractions in networking, simplifying network management and facilitating network evolution.  ...  In an effort to anticipate the future evolution of this new paradigm, we discuss the main ongoing research efforts and challenges of SDN.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers and a number of fellows that have contributed to this work.  ... 
arXiv:1406.0440v3 fatcat:usdyjgdys5h3foowmq6qvih3e4

Tableau methods for formal verification of multi-agent distributed systems

F Massacci
1998 Journal of Logic and Computation  
The aim of access control is to limit what agents (humans, programs, softbots, etc.) of distributed systems can do directly or indirectly by delegating their powers and tasks.  ...  Commission [11] for systems to be legally labelled as "trusted".  ...  Acknowledgments Most of this work was done while the author was at the Computer Laboratory at the University of Cambridge (UK). I'm indebted to L.  ... 
doi:10.1093/logcom/8.3.373 fatcat:cjgk6exub5fzxix56y5h2t4n7i

Software-Defined Networking: A Comprehensive Survey

Diego Kreutz, Fernando M. V. Ramos, Paulo Esteves Verissimo, Christian Esteve Rothenberg, Siamak Azodolmolky, Steve Uhlig
2015 Proceedings of the IEEE  
We also look at cross-layer problems such as debugging and troubleshooting.  ...  the network control problem into tractable pieces, SDN makes it easier to create and introduce new abstractions in networking, simplifying network management and facilitating network evolution.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers and a number of fellows that have contributed to this work.  ... 
doi:10.1109/jproc.2014.2371999 fatcat:azqmynutpfgl7lovrg7qxdnl2u

Using complexity to protect elections

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
2010 Communications of the ACM  
editorial Board also serves as the editorial Board of .  ...  Brown; Bryan cantrill; terry coatta; mark compton; stuart feldman; Benjamin fried; pat Hanrahan; marshall Kirk mcKusick; george neville-neil; theo schlossnagle; Jim Waldo the practice section of the cacm  ...  Cormac Flanagan, computer science Department, university of california at santa cruz, santa cruz, ca. Stephen n. Freund, computer science Department, Williams college, Williamstown, ma.  ... 
doi:10.1145/1839676.1839696 fatcat:hbqpm5boabe3jcpa4jcs7czf6y

D2.2 The COLLABS Level-3 Security Package for Secure Digital Supply Networks: 1st complete version

Panagiotis Rizomiliotis, Konstantinos Tserpes, Aikaterini Triakosia
2021 Zenodo  
the 1st version of integrated platform of the project.  ...  Analytics and Machine- / Deep-Learning on shared data), T2.5 (Distributed anomaly detection for Industrial IoT) and T2.6 (Workflow-driven security for supply chain and compliance in manufacturing) related to  ...  In permissioned block-chains like HLF the consensus protocol can be changed and adapted to fit specific use cases via policies.  ... 
doi:10.5281/zenodo.5667012 fatcat:xgzhqfeq6nbwte4h256pntlkau

COST IC1404 WG1 Deliverable WG1.2: Framework to Relate / Combine Modeling Languages and Techniques

Rima Al-Ali, Moussa Amrani, Soumyadip Bandyopadhyay, Ankica Barisic, Fernando Barros, Dominique Blouin, Ferhat Erata, Holger Giese, Mauro Iacono, Stefan Klikovits, Eva Navarro, Patrizio Pelliccione (+3 others)
2019 Zenodo  
Ontological foundation for a framework to Relate / Combine Modeling Languages and Techniques.  ...  Making use of a large-scale network (such as the Internet), adopting insecure communication protocols, heavy use of legacy systems or rapid adoption of commercial off-the-shelf (COTS) technologies are  ...  This is achieved via activity diagrams coupled with model transformation specifications executed automatically to support the development process.  ... 
doi:10.5281/zenodo.2538795 fatcat:ox2slzxzdbcrjha2xeoz75a7vy

D2.1 The COLLABS Level-3 Security Package for Secure Digital Supply Networks: MVP

Miloš Radovanović, Nataša Vujnović Sedlar, Srđan Škrbić
2020 Zenodo  
the minimum viable product of the project.  ...  This deliverable is the first output of Work Package 2 tasks T2.1 (Tools and methods for secure data sharing), T2.2 (Trustworthiness of data flows), T2.3 (Machine learning-based cognitive security framework  ...  Demonstration of their operation is planned shortly after the first year of the project.  ... 
doi:10.5281/zenodo.5666952 fatcat:hwa4x5pwnrdqva2tbp4kspnkhi
« Previous Showing results 1 — 15 out of 814 results