@article {ishak22, title = {Learning multi-party adversarial encryption and its application to secret sharing}, journal = {IEEE Access }, year = {2022}, publisher = {IEEE}, abstract = {

Neural networks based cryptography has seen a significant growth since the introduction of adversarial cryptography which makes use of Generative Adversarial Networks (GANs) to build neural networks that can learn encryption. The encryption has been proven weak at first but many follow up works have shown that the neural networks can be made to learn the One Time Pad (OTP) and produce perfectly secure ciphertexts. To the best of our knowledge, existing works only considered communications between two or three parties. In this paper, we show how multiple neural networks in an adversarial setup can remotely synchronize and establish a perfectly secure communication in the presence of different attackers eavesdropping their communication. As an application, we show how to build Secret Sharing Scheme based on this perfectly secure multi-party communication. The results show that it takes around 45,000 training steps for 4 neural networks to synchronize and reach equilibria. When reaching equilibria, all the neural networks are able to communicate between each other and the attackers are not able to break the ciphertexts exchanged between them.

}, keywords = {Cryptography, Encryption, Generative Adversarial Networks, Kernel, Mathematical models, Neural networks, Secret Sharing, Synchronization, Training}, issn = {2169-3536}, doi = {10.1109/ACCESS.2022.3223430}, url = {https://doi.org/10.1109/ACCESS.2022.3223430}, author = {Ishak Meraouche and Sabyasachi Dutta and Sraban Kumar Mohanty and Isaac Agudo and Kouichi Sakurai} } @article {sarita2018, title = {Detection of Node Capture Attack in Wireless Sensor Networks}, journal = {IEEE Systems Journal}, volume = {13}, year = {2019}, month = {03/2019}, pages = {238 - 247}, publisher = {IEEE}, issn = {1932-8184}, author = {Sarita Agrawal and Manik Lal Das and Javier Lopez} } @article {Roman2010a, title = {Advanced Secure Multimedia Services for Digital Homes}, journal = {Information Systems Frontiers}, volume = {14}, year = {2012}, month = {July 2012}, pages = {527-540}, publisher = {Springer}, abstract = {

Our society is becoming increasingly more IT-oriented, and the images and sounds that reflect our daily life are being stored mainly in a digital form. This digital personal life can be part of the home multimedia contents, and users demand access and possibly share these contents (such as photographs, videos, and music) in an ubiquitous way: from any location and with any device. The purpose of this article is twofold. First, we introduce the Feel@Home system, whose main objective is to enable the previously mentioned vision of an ubiquitous digital personal life. Second, we describe the security architecture of Feel@Home, analyzing the security and privacy requirements that identify which threats and vulnerabilities must be considered, and deriving the security building blocks that can be used to protect both IMS-based and VPN-based solutions.

}, keywords = {Content sharing, Digital home, Multimedia, privacy, security}, issn = {1387-3326}, doi = {10.1007/s10796-010-9258-9}, url = {http://www.springerlink.com/content/1785645v5246006u/}, author = {Rodrigo Roman and Javier Lopez and Olivier Dugeon and Marc Lacoste and Pierre Plaza Tron and Marta Bel} } @article {JordiForne2009, title = {Pervasive Authentication and Authorization Infrastructures for Mobile Users}, journal = {Computer and Security}, volume = {29}, year = {2010}, pages = {501-514}, publisher = {elsevier}, abstract = {

Network and device heterogeneity, nomadic mobility, intermittent connectivity and, more generally, extremely dynamic operating conditions, are major challenges in the design of security infrastructures for pervasive computing. Yet, in a ubiquitous computing environment, limitations of traditional solutions for authentication and authorization can be overcome with a pervasive public key infrastructure (pervasive-PKI). This choice allows the validation of credentials of users roaming between heterogeneous networks, even when global connectivity is lost and some services are temporarily unreachable. Proof-of-concept implementations and testbed validation results demonstrate that strong security can be achieved for users and applications through the combination of traditional PKI services with a number of enhancements like: (i) dynamic and collaborative trust model, (ii) use of attribute certificates for privilege management, and (iii) modular architecture enabling nomadic mobility and enhanced with reconfiguration capabilities.

}, issn = {0167-4048}, doi = {10.1016/j.cose.2009.09.001}, author = {Jordi Forne and Francisca Hinajeros and Andres Marin and Florina Almenarez and Javier Lopez and Jose A. Montenegro and Marc Lacoste and Daniel Diaz} } @article {Dix07, title = {Temporal Logics of Knowledge and their Applications in Security}, journal = {First Workshop in Information and Computer Security (ICS{\textquoteright}06)}, volume = {186}, year = {2007}, pages = {27-42}, publisher = {Elsevier}, address = {Timisoara, Romania}, abstract = {

\ Temporal logics of knowledge are useful for reasoning about situations where the knowledge of an agent or component is important, and where change in this knowledge may occur over time. Here we investigate the application of temporal logics of knowledge to the specification and verification of security protocols. We show how typical assumptions relating to authentication protocols can be specified. We consider verification methods for these logics, in particular, focusing on proofs using clausal resolution. Finally we present experiences from using a resolution based theorem prover applied to security protocols specified in temporal logics of knowledge.

}, keywords = {security, temporal resolution}, issn = {1571-0661}, doi = {"DOI: 10.1016/j.entcs.2006.11.043"}, author = {Clare Dixon and Carmen Fernandez-Gago and Michale Fisher and Wiebe van der Hoek} } @article {Fernandez2005, title = {First-Order Temporal Verification in Practice}, journal = {Journal of Automated Reasoning}, volume = {34}, year = {2005}, pages = {295-321}, publisher = {Springer}, abstract = {

First-order temporal logic, the extension of first-order logic with operators dealing with time, is a powerful and expressive formalism with many potential applications. This expressive logic can be viewed as a framework in which to investigate problems specified in other logics. The monodic fragment of first-order temporal logic is a useful fragment that possesses good computational properties such as completeness and sometimes even decidability. Temporal logics of knowledge are useful for dealing with situations where the knowledge of agents in a system is involved. In this paper we present a translation from temporal logics of knowledge into the monodic fragment of first-order temporal logic. We can then use a theorem prover for monodic first-order temporal logic to prove properties of the translated formulas. This allows problems specified in temporal logics of knowledge to be verified automatically without needing a specialized theorem prover for temporal logics of knowledge. We present the translation, its correctness, and examples of its use.

}, issn = {0168-7433}, doi = {dx.doi.org/10.1007/s10817-005-7354-1}, author = {Carmen Fernandez-Gago and Ullrich Hustadt and Clare Dixon and Michale Fisher and Boris Konev} } @article {Winfield2005, title = {On the Formal Specification of Emergent Behaviours of Swarm Robotics Systems}, journal = {International Journal of Advanced Robotics Systems}, volume = {2}, year = {2005}, pages = {363-371}, publisher = {SAGE Publishing}, abstract = {

It is a characteristic of swarm robotics that specifying overall emergent swarm behaviours in terms of the low-level behaviours of individual robots is very difficult. Yet if swarm robotics is to make the transition from the laboratory to real-world engineering realisation we need such specifications. This paper explores the use of temporal logic to formally specify, and possibly also prove, the emergent behaviours of a robotic swarm. The paper makes use of a simplified wireless connected swarm as a case study with which to illustrate the approach. Such a formal approach could be an important step toward a disciplined design methodology for swarm robotics.

}, keywords = {Swarm Robotics, temporal resolution}, issn = {1729-8806}, doi = {dx.doi.org/10.5772/5769}, author = {Alan Winfield and Jin Sa and Carmen Fernandez-Gago and Clare Dixon and Michale Fisher} } @article {javierlopez2005c, title = {Specification and Design of Advanced Authentication and Authorization Services}, journal = {Computer Standards \& Interfaces}, volume = {27}, number = {5}, year = {2005}, month = {Jun 2005}, pages = {467-478}, publisher = {Elsevier}, abstract = {

A challenging task in security engineering concerns the specification and integration of security with other requirements at the top level of requirements engineering. Empirical studies show that it is common at the business process level that customers and end users are able to express their security needs. Among the security needs of Internet applications, authentication and authorization services are outstanding and, sometimes, privacy becomes a parallel requirement. In this paper, we introduce a methodology for the specification of security requirements and use a case study to apply our solution. We further detail the resulting system after extending it with an Authentication and Authorization Infrastructure.

}, issn = {0920-5489}, doi = {10.1016/j.csi.2005.01.005}, author = {Javier Lopez and Jose A. Montenegro and Jose L. Vivas and Eiji Okamoto and Ed Dawson} } @article {SelwynRusell2003, title = {Virtual Certificates and Synthetic Certificates: New Paradigms for Improving Public Key Validation}, journal = {Computer Communications}, volume = {26}, number = {16}, year = {2003}, pages = {1826-1838}, publisher = {Elsevier}, abstract = {

The certificate paradigm is applied recursively to obtain the public keys of a number of Certification Authorities and, accordingly, to obtain the public keys of a number of final entities. Thus, validation of the authorized public key of a party in a network transaction is commonly based on processing the certificate chain descended from a trusted root issuer, involving non-negligible time and cost. Those chains become long in communications between large organizations, which is the typical case of e-commerce and e-government applications. The process of validation of extensive chains introduces performance problems in two aspects: signature verification and revocation checking. That is, the repeated processing of long chains of certificates creates severe efficiency problems. This fact causes that most of the advantages provided by Public Key Infrastructures (PKIs) are not conveniently exploited. In this paper we analyze the scenarios in which large volumes of digitally signed transactions between commercial entities exist. These cases require of interoperation among PKIs. We show that solutions available in those scenarios still involve processing of too long chains of certificates, either at the receiving computer or by an outsourced entity. For this reason, we propose new concepts of virtual certificate and synthetic certificate for faster and less costly processing of certificate chains. In this way, communications in a certificate-based intercommunity can be highly improved. We also show how these types of certificates can be applied in practice.

}, issn = {0140-3664}, author = {Selwyn Rusell and Ed Dawson and Eiji Okamoto and Javier Lopez} } @article {1712, title = {Sistemas Electr{\'o}nicos de Micropago}, journal = {Revista de Contrataci{\'o}n Electr{\'o}nica}, volume = {22}, year = {2001}, pages = {3-22}, issn = {1576-2033}, author = {Jorge Davila and Javier Lopez} } @article {1714, title = {Dise{\~n}o de Protocolos de No-Repudio}, journal = {Revista SIC: Seguridad en Inform{\'a}tica y Comunicaciones}, volume = {38}, year = {2000}, pages = {1-5}, issn = {1136-0623}, author = {Jorge Davila and Javier Lopez and Felipe Rosello} }