5,870 Hits in 6.0 sec

Deciding security properties for cryptographic protocols. Application to key cycles [article]

Hubert Comon-Lundh and Véronique Cortier and Eugen Zalinescu
2009 arXiv   pre-print
As a consequence, we prove that deciding the existence of key cycles is NP-complete for a bounded number of sessions.  ...  We show that our decision procedure can also be applied to prove again the decidability of authentication-like properties and the decidability of a significant fragment of protocols with timestamps.  ...  We are particularly grateful to Michael Backes, Michaël Rusinowitch, Stéphanie Delaune, and Bogdan Warinschi for their very helpful suggestions.  ... 
arXiv:0708.3564v2 fatcat:ua5drgx625dsfb6pnky5thwi7e

A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems

Véronique Cortier, Steve Kremer, Bogdan Warinschi
2010 Journal of automated reasoning  
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and probability.  ...  The other approach relies on a symbolic model of protocol executions in which cryptographic primitives are treated as black boxes.  ...  designed a mechanized prover, named CryptoVerif, for security properties of cryptographic protocols.  ... 
doi:10.1007/s10817-010-9187-9 fatcat:6qrlhc34mnbnpmap2mkkrnfqhm

Strong Authentication for RFID Systems Using the AES Algorithm [chapter]

Martin Feldhofer, Sandra Dominikus, Johannes Wolkerstorfer
2004 Lecture Notes in Computer Science  
We introduce an authentication protocol which serves as a proof of concept for authenticating an RFID tag to a reader device using the Advanced Encryption Standard (AES) as cryptographic primitive.  ...  In contrast to the RFID community, which claims that cryptographic components are too costly for RFID tags, we describe a solution using strong symmetric authentication which is suitable for today's requirements  ...  Even if we use strong cryptographic algorithms, we need to ensure that the protocol is also secure.  ... 
doi:10.1007/978-3-540-28632-5_26 fatcat:egixcbfupjadtdejrppnw5qvu4

Security Protocol Verification: Symbolic and Computational Models [chapter]

Bruno Blanchet
2012 Lecture Notes in Computer Science  
Security protocol verification has been a very active research area since the 1990s.  ...  Additionally, we briefly describe our symbolic security protocol verifier ProVerif and situate it among these approaches.  ...  We thank Pierpaolo Degano for helpful comments on a draft of this paper. Sect. 2.2 is updated from [48] . This work was partly supported by the ANR project ProSe (decision ANR-2010-VERS-004-01).  ... 
doi:10.1007/978-3-642-28641-4_2 fatcat:fc32uobfpfbqboiqtfwj3fokee

miTLS: Verifying Protocol Implementations against Real-World Attacks

Karthikeyan Bhargavan, Cedric Fournet, Markulf Kohlweiss
2016 IEEE Security and Privacy  
Application Interface (API) and its Security Goals Many problems stem from a mismatch between the security properties expected by applications using TLS and the actual guarantees provided by TLS (gap IV  ...  Compound authentication protocols used the TLS session key (called master secret) as an identifier for binding application-level credentials.  ... 
doi:10.1109/msp.2016.123 fatcat:fisjry37bzexpdcl26l67e67p4

Deciding Key Cycles for Security Protocols [chapter]

Véronique Cortier, Eugen Zălinescu
2006 Lecture Notes in Computer Science  
While security properties like secrecy or authentication have been proved decidable for many interesting classes of protocols, the automatic detection of key cycles has not been studied so far.  ...  In this paper, we prove that deciding the existence of key-cycles is NP-complete for a bounded number of sessions.  ...  We are particularly grateful to Michaël Rusinowitch and Bogdan Warinschi for their very helpful suggestions.  ... 
doi:10.1007/11916277_22 fatcat:b2s3znis55cf3notx3zad3wada

Risk Analysis of Physically Unclonable Functions [chapter]

Andrea Kolberger, Ingrid Schaumüller-Bichl, Martin Deutschmann
2014 Lecture Notes in Computer Science  
To be aware of potential threats and vulnerabilities concerning PUF-based security schemes a risk analysis on different use cases was performed in order to gain requirements for the development and implementation  ...  Physically unclonable functions (PUFs) are an emerging technology that have been proposed as central building blocks in a variety of cryptographic application areas.  ...  This work is co-financed by the Austrian Research Promotion Agency (FFG) in the FIT-IT line within the project CODES (835932): Algorithmic extraction and error correction codes for lightweight security  ... 
doi:10.1007/978-3-662-44885-4_12 fatcat:kvoh5n5bkvegdlrzi3b7rri524


Antonio L. Maia Neto, Harsh Kupwade Patil, Leonardo B. Oliveira, Artur L. F. Souza, Italo Cunha, Michele Nogueira, Ivan Oliveira Nunes, Leonardo Cotta, Nicolas Gentille, Antonio A. F. Loureiro, Diego F. Aranha
2016 Proceedings of the 14th ACM Conference on Embedded Network Sensor Systems CD-ROM - SenSys '16  
In particular, there is a dire need for a holistic authentication mechanism throughout the IoT device life-cycle, namely from the manufacturing to the retirement of the device.  ...  To validate our solution, we have developed AoT for Android smartphones like the LG G4 and evaluated all the cryptographic primitives over more constrained devices like the Intel Edison and the Arduino  ...  , Seungyoon Song, Timbere Nogueira, Vitor Paisante for fruitful discussions and feedback.  ... 
doi:10.1145/2994551.2994555 dblp:conf/sensys/NetoSCNNCGLAPO16 fatcat:o4ld54usfnah3fhwr3t7ikmqdu

New Public Integrity Auditing Scheme for Cloud Data Storage Using Mac And Symmetric Key Cryptographic Algorithms

A. Emily Jenifer, S. Karthigaiveni
2016 International Journal of Applied Engineering Research  
Moreover, it supports some properties such as, confidentiality, countability, efficiency and traceability for secure data storage.  ...  The experimental results are analyzed and evaluated in terms of computation time, block size, key size, number of rounds and cycles per block.  ...  Cycles/BlockThe number of cycles per block in key generation should be minimum for less computational time.  ... 
doi:10.37622/ijaer/11.3.2016.1894-1899 fatcat:flcgqm5tkzgengqu45gar24pfa

Disco: Modern Session Encryption [article]

David Wong
2019 IACR Cryptology ePrint Archive  
This, while offering both a flexible way to encryption sessions and a complete cryptographic library for all of an application's needs.  ...  At the same conference Mike Hamburg introduced Strobe, a symmetric protocol framework capable of protecting sessions as well as building symmetric cryptographic primitives for the single cost of Joan Daemen's  ...  Thanks to Thomas Pornin for discussions and help with the C implementation.  ... 
dblp:journals/iacr/Wong19 fatcat:yr3xyyao6zgxjl27mz76vgjxd4

The Snowden Phone: A Comparative Survey of Secure Instant Messaging Mobile Applications [article]

Christian Johansen, Aulon Mujaj, Hamed Arshad, Josef Noll
2019 arXiv   pre-print
We conduct a series of experiments on these implementations to identify which types of security and usability properties each application provides.  ...  Finally, the paper gives proposals for improving each application w.r.t. security, privacy, and usability.  ...  Other Security Properties: A protocol or application for end-to-end secure IM may implement any (if not all) of the following. 1.  ... 
arXiv:1807.07952v2 fatcat:njkcmmo7fnctvdtt7txvdjq7py

The Snowden Phone: A Comparative Survey of Secure Instant Messaging Mobile Applications

Christian Johansen, Aulon Mujaj, Hamed Arshad, Josef Noll, Shehzad Ashraf Chaudhry
2021 Security and Communication Networks  
During these experiments, we test 21 security and usability properties specially relevant for applications (not protocols).  ...  New implementations of such end-to-end encrypted messaging protocols have appeared, and several popular chat applications have been updated to use such protocols.  ...  A KDF chain is a sequencing of applications of a key derivation function which returns one key used as a new KDF key for the next chain cycle as well as an output key for messages. e KDF chain has the  ... 
doi:10.1155/2021/9965573 fatcat:f3sfbxwqdzaovlvaf5jln2k5qq

Hardware authentication based on PUFs and SHA-3 2nd round candidates

Susana Eiroa, Iluminada Baturone
2010 2010 International Conference on Microelectronics  
are included and, based on them, several cryptographic protocols have been reported.  ...  This paper describes the hardware implementation of a symmetric-key authentication protocol in which a PUF is one of the relevant blocks.  ...  Most of them are adhoc structures that depend on the application, such as the symmetric key protocol for IP protection proposed in [1] , and the structure for off-line RFID authentication described in  ... 
doi:10.1109/icm.2010.5696149 fatcat:m3lfe7gdsncqfmwa267jq3mvy4

An Experimental Study of Cryptography Capability using Chained Key Exchange Scheme for Embedded Devices [article]

Mohd Anuar Mat Isa, Habibah Hashim, Jamalul-lail Ab Manan, Syed Farid Syed Adnan, Ramlan Mahmod
2014 arXiv   pre-print
After 38 years of birthday Diffie-Hellman Key Exchange (DHKE), there are many proposed improvements in the DHKE protocol to encounter modern security issues.  ...  Our proposed scheme in the TFTP protocol will secure the sharing of secrets and symmetric keys (e.g., AES256).  ...  Target Application This study will attempt to establish a secure and trust based key exchange protocol in the embedded controller.  ... 
arXiv:1409.0065v1 fatcat:egt2fwfzubhjvj6fiwapsxtoa4

Conditional reactive simulatability

Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters
2007 International Journal of Information Security  
Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositionality guarantees, which are achieved  ...  This yields a more fine-grained security definition that is achievable for several protocols for which unconditional simulatability is too strict a notion, or at lower cost for the underlying cryptographic  ...  We thank Martín Abadi for interesting discussions.  ... 
doi:10.1007/s10207-007-0046-6 fatcat:o2w7iqnhovbqhp5uudpuxopmxi
« Previous Showing results 1 — 15 out of 5,870 results