scholarly journals Applications of SKREM-Like Symmetric Key Ciphers

2021 ◽  
Author(s):  
Mircea-Adrian Digulescu
Keyword(s):  
Digital Signature ◽  
Public Key Cryptography ◽  
Plain Text ◽  
Authentication And Authorization ◽  
Symmetric Key ◽  
Block Chain ◽  
Coin Flipping ◽  
Security Guarantees ◽  
Digital Signature Scheme ◽  
Specific Quantum

In a prior paper we introduced a new symmetric key encryption scheme called Short Key Random Encryption Machine (SKREM), for which we claimed excellent security guarantees. In this paper we present and briefly discuss how some other cryptographic applications besides plain text encryption can benefit from the same security guarantees. We task ourselves with and succeed in showing how Secure Coin Flipping, Cryptographic Hashing, Zero-Leaked-Knowledge Authentication and Authorization and a Digital Signature scheme which can be employed on a block-chain, can all be achieved using SKREM-like ciphers, benefiting from their security guarantees. We also briefly recap SKREMlike ciphers and the core traits which make them so secure. The realizations of the above applications are novel because they do not involve public key cryptography. Furthermore, the security of SKREMlike ciphers is not based on hardness of some algebraic operations, thus not opening them up to specific quantum computing attacks.

Design of Digital Signature Scheme Based on Elliptic Curve Cryptosystem

2014 ◽  
Vol 685 ◽  
pp. 579-582
Author(s):  
Shi Guo Jin ◽  
Guang Jiang Wang
Keyword(s):  
Elliptic Curve ◽  
Digital Signature ◽  
Public Key Cryptography ◽  
Elliptic Curve Cryptosystem ◽  
Generation Process ◽  
Signature Scheme ◽  
Technical Performance ◽  
Elliptic Curve Cryptosystems ◽  
Process System ◽  
Digital Signature Scheme

Digital signature is electronically password technique for electronic document signature. Elliptic curve cryptography is a method of public key cryptography based on elliptic curve mathematical. Digital signature scheme consists of three processes: initialization process, the signature generation process and signature verification process system. This paper analyzes the elliptic curve cryptosystems mathematical principle and technical performance. The paper proposes design of digital signature scheme based on elliptic curve cryptosystem.

scholarly journals Picpass Algorithm for Solution of Key Exchange Problem in Symmetric and Asymmetric Key Cryptography

2021 ◽  
pp. 305-308
Author(s):  
Anchal Goyal ◽  
Deepinder Kaur
Keyword(s):  
Public Key Cryptography ◽  
Key Exchange ◽  
Secret Key ◽  
Dictionary Attack ◽  
Plain Text ◽  
Cipher Text ◽  
Compact Size ◽  
Private And Public ◽  
Symmetric Key ◽  
Dictionary Attacks

In this dissertation a PicPass algorithm is proposed for the solution of Key Exchange problem using Symmetric and Asymmetric key cryptography. Diffie and Hellman proposed an algorithm for key exchange. But this algorithm suffers from Man-in middle attack. So to overcome this problem Seo proposed another algorithm that uses text password for the agreement between two parties. But again the password suffers from offline dictionary attack. In this, a PicPass Protocol i.e. picture is used as a password to make an agreement between two parties. The protocol contains two function i.e. picture function as well as distortion function is used to make picture in a compact size and then it is sent to receiver. Firstly the sender encrypts the Plain Text using Secret Picture and creates the Cipher Text using Symmetric key cryptography.Then the Secret Picture will be encrypted by covered picture resulting into Encrypted Picture.Now the Cipher Text and Encrypted Picture will be placed into digital envolpe and then the envelope will be send to the receiver. The receiver will receive the digital envelope, open it and then decrypt the Encrypted Picture using his Key Picture. This will result the receiver to get the Secret Picture. Now the receiver will open the Cipher Text using the Secret Picture and get the Plain Text. In between if any person wants to predict the Encrypted Picture then he cannot guess as the picture will only be decrypted using the Secret Key which will be only with the receiver. So in this dissertation, a picture is used as a password to authenticate key exchange is that gives practical solution against offline dictionary attacks only by using both private and public key cryptography.

scholarly journals Committing to quantum resistance: a slow defence for Bitcoin against a fast quantum computing attack

2018 ◽  
Vol 5 (6) ◽  
pp. 180410 ◽  
Author(s):  
I. Stewart ◽  
D. Ilie ◽  
A. Zamyatin ◽  
S. Werner ◽  
M. F. Torshizi ◽  
...  
Keyword(s):  
Quantum Computing ◽  
Digital Signature ◽  
Public Key Cryptography ◽  
Public Key ◽  
Quantum Computers ◽  
Signature Scheme ◽  
Integer Factorization ◽  
Digital Signature Algorithm ◽  
Mathematical Problems ◽  
Digital Signature Scheme

Quantum computers are expected to have a dramatic impact on numerous fields due to their anticipated ability to solve classes of mathematical problems much more efficiently than their classical counterparts. This particularly applies to domains involving integer factorization and discrete logarithms, such as public key cryptography. In this paper, we consider the threats a quantum-capable adversary could impose on Bitcoin, which currently uses the Elliptic Curve Digital Signature Algorithm (ECDSA) to sign transactions. We then propose a simple but slow commit–delay–reveal protocol, which allows users to securely move their funds from old (non-quantum-resistant) outputs to those adhering to a quantum-resistant digital signature scheme. The transition protocol functions even if ECDSA has already been compromised. While our scheme requires modifications to the Bitcoin protocol, these can be implemented as a soft fork.

Digital Signature Schemes

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Digital Signature ◽  
Digital Signatures ◽  
Public Key Cryptography ◽  
Detailed Comparison ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Digital Signature Scheme

In this chapter, we discuss digital signature schemes. We start by considering the general requirements of a digital signature scheme. We show first that a digital signature scheme could be established using symmetric techniques. We then consider the more conventional use of public-key cryptography to create digital signature schemes. We compare two different approaches to building a digital signature scheme and illustrate how to manifest these using RSA. We then discuss practical issues concerning digital signature schemes, including different aspects of their security. We close by providing a detailed comparison between digital signatures and handwritten signatures which serves to both illustrate the strengths and vulnerabilities of digital signature schemes.

scholarly journals An Implementation of Picpass Algorithm for the Solution of Key Exchange Problem

2021 ◽  
pp. 76-79
Author(s):  
Er. Krishan Kumar ◽  
Nidhi Singla
Keyword(s):  
Public Key Cryptography ◽  
Key Exchange ◽  
Secret Key ◽  
Dictionary Attack ◽  
Plain Text ◽  
Cipher Text ◽  
Compact Size ◽  
Private And Public ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

In this dissertation a PicPass algorithm is proposed for the solution of Key Exchange problem using Symmetric and Asymmetric key cryptography. Diffie and Hellman proposed an algorithm for key exchange. But this algorithm suffers from Man-in middle attack. So to overcome this problem Seo proposed another algorithm that uses text password for the agreement between two parties. But again the password suffers from offline dictionary attack. In this, a PicPass Protocol i.e. picture is used as a password to make an agreement between two parties. The protocol contains two function i.e. picture function as well as distortion function is used to make picture in a compact size and then it is sent to receiver. Firstly the sender encrypts the Plain Text using Secret Picture and creates the Cipher Text using Symmetric key cryptography. Then the Secret Picture will be encrypted by covered picture resulting into Encrypted Picture. Now the Cipher Text and Encrypted Picture will be placed into digital envelope and then the envelope will be send to the receiver. The receiver will receive the digital envelope, open it and then decrypt the Encrypted Picture using his Key Picture. This will result the receiver to get the Secret Picture. Now the receiver will open the Cipher Text using the Secret Picture and get the Plain Text. In between if any person wants to predict the Encrypted Picture then he cannot guess as the picture will only be decrypted using the Secret Key which will be only with the receiver. So in this dissertation, a picture is used as a password to authenticate key exchange is that gives practical solution against offline dictionary attacks only by using both private and public key cryptography.

scholarly journals A Pairing-Free Identity-Based Identification Scheme with Tight Security Using Modified-Schnorr Signatures

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1330
Author(s):  
Jason Chia ◽  
Ji-Jian Chin ◽  
Sook-Chin Yip
Keyword(s):  
Key Management ◽  
Discrete Logarithm ◽  
Probability Bounds ◽  
Diffie Hellman ◽  
Identity Based ◽  
Symmetric Key ◽  
Security Guarantees ◽  
Lightweight Authentication ◽  
Tight Security ◽  
Schnorr Signatures

The security of cryptographic schemes is proven secure by reducing an attacker which breaks the scheme to an algorithm that could be used to solve the underlying hard assumption (e.g., Discrete Logarithm, Decisional Diffie–Hellman). The reduction is considered tight if it results in approximately similar probability bounds to that of solving the underlying hard assumption. Tight security is desirable as it improves security guarantees and allows the use of shorter parameters without the risk of compromising security. In this work, we propose an identity-based identification (IBI) scheme with tight security based on a variant of the Schnorr signature scheme known as TNC signatures. The proposed IBI scheme enjoys shorter parameters and key sizes as compared to existing IBI schemes without increasing the number of operations required for its identification protocol. Our scheme is suitable to be used for lightweight authentication in resource-constrained Wireless Sensor Networks (WSNs) as it utilizes the lowest amount of bandwidth when compared to other state-of-the-art symmetric key lightweight authentication schemes. Although it is costlier than its symmetric key counterparts in terms of operational costs due to its asymmetric key nature, it enjoys other benefits such as decentralized authentication and scalable key management. As a proof of concept to substantiate our claims, we perform an implementation of our scheme to demonstrate its speed and memory usage when it runs on both high and low-end devices.

Sign in / Sign up

Export Citation Format

Share Document