Asymmetric Cryptography

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 3966 Experts worldwide ranked by ideXlab platform

Dirk Westhoff - One of the best experts on this subject based on the ideXlab platform.

  • Dynamic Code Update for the Efficient Usage of Security Components in WSNs
    2011
    Co-Authors: Axel Poschmann, Dirk Westhoff, André Weimerskirch
    Abstract:

    Wireless sensor networks (WSN) will have a major impact on our everyday’s life. A requirement for large-scaled deployment are extremely low-cost sensors though running with minimal resources regarding computational power, energy consumption, and memory size. Cryptographic schemes are highly at demand for providing security mechanisms in such WSNs. Asymmetric Cryptography allows for flexible key management schemes at the cost of high resource demands whereas symmetric Cryptography provides resource efficient solutions. In this work we sketch an approach for (1) providing Asymmetric Cryptography during the one-time bootstrapping phase and (2) swap it by other security protocols for operation of the WSN in order to minimize memory size demands. Our mechanism is based on dynamic code update, e.g. provided by the FlexCup plug-in for TinyOS. Our approach yields the best of two worlds in order to maximize flexibility and life-span and minimize resource demands.

  • concrete security for entity recognition the jane doe protocol full paper
    IACR Cryptol. ePrint Arch., 2009
    Co-Authors: Stefan Lucks, André Weimerskirch, Erik Zenner, Dirk Westhoff
    Abstract:

    Entity recognition does not ask whether the message is from some entity X, just whether a message is from the same entity as a previous message. This turns turns out to be very useful for low-end devices. Motivated by an attack against a protocol presented at SAC 2003, the current paper proposes a new protocol – the “Jane Doe Protocol” –, and provides a formal proof of its concrete security. The protocol neither employs Asymmetric Cryptography, nor a trusted third party, nor any key pre-distribution. It is suitable for light-weight cryptographic devices such as sensor network motes and RFID tags.

  • concrete security for entity recognition the jane doe protocol
    International Conference on Cryptology in India, 2008
    Co-Authors: Stefan Lucks, André Weimerskirch, Erik Zenner, Dirk Westhoff
    Abstract:

    Entity recognition does not ask whether the message is from some entity X , just whether a message is from the same entity as a previous message. This turns turns out to be very useful for low-end devices. The current paper proposes a new protocol --- the "Jane Doe Protocol" ---, and provides a formal proof of its concrete security. The protocol neither employs Asymmetric Cryptography, nor a trusted third party, nor any key pre-distribution. It is suitable for light-weight cryptographic devices such as sensor network motes and RFID tags.

Steel Graham - One of the best experts on this subject based on the ideXlab platform.

  • A secure key management interface with Asymmetric Cryptography
    'Springer Science and Business Media LLC', 2014
    Co-Authors: Daubignard Mario, Lubicz David, Steel Graham
    Abstract:

    International audienceCryptographic devices such as Hardware Security Modules are only as secure as their application programme interfaces (APIs) that offer cryptographic functionality to the outside world. Design flaws and implementation errors in security APIs have been shown to cause vulnerabilities that may leak secrets such as keys and PINs. Ideally, we would like to design such interfaces in such a way that we can formally prove security properties, even in the presence of some corrupted keys. In this work, we take such a design for a provably secure interface for symmetric key management, due to Cortier and Steel, and extend it to Asymmetric Cryptography, giving new security definitions and associated proofs. Asymmetric Cryptography forces us to consider confidentiality and integrity properties separately and provide support for classical operations of public key infrastructure (e.g. certification of public keys). As far as we are aware this is the first such provably secure interface to support Asymmetric key operations for key management: Cachin and Chandran's secure token interface supports Asymmetric key operations only for encrypting and signing data, not for managing keys

  • A Secure Key Management Interface with Asymmetric Cryptography
    HAL CCSD, 2013
    Co-Authors: Daubignard Mario, Lubicz David, Steel Graham
    Abstract:

    Cryptographic devices such as Hardware Security Modules are only as secure as their application programme interfaces (APIs) that offer cryptographic functionality to the outside world. Design flaws and implementation errors in security APIs have been shown to cause vulnerabilities that may leak secrets such as keys and PINs. Ideally, we would like to design such interfaces in such a way that we can formally prove security properties, even in the presence of some corrupted keys. In this work, we take such a design for a provably secure interface for symmetric key management, due to Cortier and Steel, and extend it to Asymmetric Cryptography, giving new security definitions and associated proofs. Asymmetric Cryptography forces us to consider confidentiality and integrity properties separately and provide support for classical operations of public key infrastructure (e.g. certification of public keys). As far as we are aware this is the first such provably secure interface to support Asymmetric key operations for key management: Cachin and Chandran's secure token interface supports Asymmetric key operations only for encrypting and signing data, not for managing keys.Les systèmes cryptographiques tels que les modules matériels de sécurité ne peuvent apporter un niveau de sécurité que dans la mesure où leur interface de programmation (API) qui offre les services de cryptographie à l'extérieur de module atteint ce même niveau de sécurité. Il a été constaté que des défauts de conception ou des erreur d'implémentation dans les APIs de sécurité sont à l'origine de vulnérabilités pouvant entrainer la fuite de secrets comme des clefs ou des PINs. Idéalement, nous voudrions concevoir de telles interfaces de manière à pouvoir prouver formellement des propriétés de sécurité, même si certaines clefs sont corrompues. Dans cet article, nous partons d'une telle API, due à Cortier et Steel, conçue de manière disposer d'une preuve de sécurité pour la gestion de clefs symétriques, et nous l'adaptons à la cryptographie asymétrique en donnant une nouvelle définition de sécurité avec les preuves associées. Afin de prendre en compte la cryptographie asymétrique, nous sommes amenés à gérer de manière différentiée les propriétés de confidentialité et d'intégrité et à ajouter les fonctionalités classiques d'une infrastructure de gestion de clefs publiques (i.e. la certification des clefs publiques). Á notre connaissance, il s'agit de la première preuve d'interface prouvée permettant l'usage de primitives asymétriques pour la gestion de clefs : l'interface de Cachin et Chandra prévoit l'usage de primitives asymétriques uniquement pour le chiffrement et la signature de données, et non pas pour la gestion des clefs

Ayse Nalli - One of the best experts on this subject based on the ideXlab platform.

  • restructuring of discrete logarithm problem and elgamal cryptosystem by using the power fibonacci sequence module m
    2018
    Co-Authors: Cagla Ozyilmaz, Ayse Nalli
    Abstract:

    In this paper, we have studied on adapting to Asymmetric Cryptography power Fibonacci sequence module m . To do this, We have restructed Discreate Logarithm Problem which is one of mathematical difficult problems by using power Fibonacci sequence module m and by means of this sequences, we have made the mathematical difficult problem which is used only in prime modules is also useful for composite modules. Then we have constructed cryptographic system based on this more difficult problem which we have rearranged. Hence, we have obtained a new cryptosystem as ElGamal Cryptosystem. Lastly, we have compared that ElGamal Cryptosystem and a new cryptosystem which we constitute in terms of Cryptography and we have obtained that a new cryptosystem is more advantageuos than ElGamal Cryptosystem.

Jing Ma - One of the best experts on this subject based on the ideXlab platform.

  • Image encryption using fingerprint as key based on phase retrieval algorithm and public key Cryptography
    Optics and Lasers in Engineering, 2015
    Co-Authors: Tieyu Zhao, Yingying Chi, Qi Wen Ran, Lin Yuan, Jing Ma
    Abstract:

    In this paper, a novel image encryption system with fingerprint used as a secret key is proposed based on the phase retrieval algorithm and RSA public key algorithm. In the system, the encryption keys include the fingerprint and the public key of RSA algorithm, while the decryption keys are the fingerprint and the private key of RSA algorithm. If the users share the fingerprint, then the system will meet the basic agreement of Asymmetric Cryptography. The system is also applicable for the information authentication. The fingerprint as secret key is used in both the encryption and decryption processes so that the receiver can identify the authenticity of the ciphertext by using the fingerprint in decryption process. Finally, the simulation results show the validity of the encryption scheme and the high robustness against attacks based on the phase retrieval technique.

Nalli Ayse - One of the best experts on this subject based on the ideXlab platform.

  • Restructuring of Discrete Logarithm Problem and ElGamal Cryptosystem by Using the Power Fibonacci Sequence Module M
    2018
    Co-Authors: Ozyilmaz Cagla, Nalli Ayse
    Abstract:

    In this paper, we have studied on adapting to Asymmetric Cryptography power Fibonacci sequence module m . To do this, We have restructed Discreate Logarithm Problem which is one of mathematical difficult problems by using power Fibonacci sequence module m and by means of this sequences, we have made the mathematical difficult problem which is used only in prime modules is also useful for composite modules. Then we have constructed cryptographic system based on this more difficult problem which we have rearranged. Hence, we have obtained a new cryptosystem as ElGamal Cryptosystem. Lastly, we have compared that ElGamal Cryptosystem and a new cryptosystem which we constitute in terms of Cryptography and we have obtained that a new cryptosystem is more advantageuos than ElGamal Cryptosystem.Comment: arXiv admin note: substantial text overlap with arXiv:math/0510057 by other author

Related terms

Asymmetric Cryptography - 15 days free trial to Access Experts & Abstracts