Public-key cryptosystem and digital-signature schemes based on linear algebra over a local ring

1987 ◽  
Vol 134 (5) ◽  
pp. 254
Author(s):  
S. Zu-hua
Keyword(s):  
Local Ring ◽  
Linear Algebra ◽  
Digital Signature ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Signature Schemes

scholarly journals Derived Hyperstructures from Hyperconics

Mathematics ◽  
2020 ◽  
Vol 8 (3) ◽  
pp. 429 ◽  
Author(s):  
Vahid Vahedi ◽  
Morteza Jafarpour ◽  
Sarka Hoskova-Mayerova ◽  
Hossein Aghabozorgi ◽  
Violeta Leoreanu-Fotea ◽  
...  
Keyword(s):  
Digital Signature ◽  
Quadratic Forms ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Signature Schemes ◽  
The Public

In this paper, we introduce generalized quadratic forms and hyperconics over quotient hyperfields as a generalization of the notion of conics on fields. Conic curves utilized in cryptosystems; in fact the public key cryptosystem is based on the digital signature schemes (DLP) in conic curve groups. We associate some hyperoperations to hyperconics and investigate their properties. At the end, a collection of canonical hypergroups connected to hyperconics is proposed.

scholarly journals Public-key cryptosystem based on invariants of diagonalizable groups

2017 ◽  
Vol 9 (1) ◽  
Author(s):  
František Marko ◽  
Alexandr N. Zubkov ◽  
Martin Juráš
Keyword(s):  
Linear Algebra ◽  
Finite Fields ◽  
Number Fields ◽  
Euclidean Algorithm ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Finite Rings

AbstractWe develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).

scholarly journals Comparison and intelligent analysis of NTRU and ETRU signature algorithms for public key digital signature

2021 ◽  
Vol 2083 (4) ◽  
pp. 042009
Author(s):  
Zifeng Zhu ◽  
Fei Tian
Keyword(s):  
Digital Signature ◽  
Public Key ◽  
High Dimensional ◽  
Public Key Cryptosystem ◽  
Fast Speed ◽  
Intelligent Analysis ◽  
Small Footprint ◽  
Integer Base ◽  
Definition Of

Abstract Three American mathematicians made the NTRU public-key cryptosystem in 1996, it has a fast speed, small footprint, and also it is easy to produce key advantages. The NTRU signature algorithm is based on an integer base, the performance of the signature algorithm will change when the integer base becomes other bases. Based on the definition of “high-dimensional density” of lattice signatures, this paper chooses the ETRU signature algorithm formed by replacing the integer base with the Eisenstein integer base as a representative, and analyzes and compares the performance, security of NTRU and ETRU signature algorithms, SVP and CVP and other difficult issues, the speed of signature and verification, and the consumption of resources occupied by the algorithm.

Public-key cryptosystem based on quantum BCH codes and its quantum digital signature

2020 ◽  
Vol 15 (4) ◽  
pp. 197
Author(s):  
Haiqing Han ◽  
Siru Zhu ◽  
Qin Li ◽  
Xiao Wang ◽  
Yutian Lei ◽  
...  
Keyword(s):  
Digital Signature ◽  
Bch Codes ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Quantum Digital Signature

A Verifiable Ring Signature Scheme Based on Multivariate Public-Key Cryptosystem

2013 ◽  
Vol 380-384 ◽  
pp. 1899-1902
Author(s):  
Ling Ling Wang
Keyword(s):  
Public Key ◽  
Quantum Computers ◽  
Public Key Cryptosystem ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Multivariate Public Key

Most existing verifiable ring signature schemes are based on traditional PKCs, which cannot resist future attacks of quantum computers. Fortunately, the MQ-problem based Multivariate Public-Key Cryptosystem (MPKC) is an important alternative to traditional PKCs for its potential to resist future attacks of quantum computers. In this paper, we proposed a construction of verifiable ring signature based on MPKC, which has the properties of consistent, unforgery, signer-anonymity and verifiability.

A Blind Proxy Re-Signatures Scheme Based on Random Oracle

2011 ◽  
Vol 204-210 ◽  
pp. 1062-1065 ◽  
Author(s):  
Yu Qiao Deng
Keyword(s):  
Digital Signature ◽  
Digital Signatures ◽  
Random Oracle ◽  
Proxy Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes

Digital signature schemes allow a signer to transform any message into a signed message, such that anyone can verify the validity of the signed message using the signer’s public key, but only the signer can generate signed messages. A proxy re-signature, which is a type of digital signatures, has significant applications in many areas. Proxy signature scheme was first introduced by Blaze, Bleumer, and Strauss, but that scheme is inefficient and with limited features. After that, some Proxy re-signature schemes were proposed by researchers. This paper constructs a blind proxy re-signatures scheme. Comparing to the previous proxy re-signature schemes, the scheme adds a message blinded feature, and then the security of the scheme is proven.

scholarly journals Quantum Election Protocol Based on Quantum Public Key Cryptosystem

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Wenhua Gao ◽  
Li Yang
Keyword(s):  
Digital Signature ◽  
Large Scale ◽  
Third Party ◽  
Public Key ◽  
General Construction ◽  
Public Key Cryptosystem ◽  
Public Key Encryption ◽  
Quantum Digital Signature ◽  
Quantum Public Key ◽  
Quantum Public Key Cryptosystem

There is no quantum election protocol that can fulfil the eight requirements of an electronic election protocol, i.e., completeness, robustness, privacy, legality, unreusability, fairness, verifiability, and receipt-freeness. To address this issue, we employ the general construction of quantum digital signature and quantum public key encryption, in conjunction with classic public key encryption, to develop and instantiate a general construction of quantum election protocol. The proposed protocol exhibits the following advantages: (i) no pre-shared key between any two participants is required, and no trusted third party or anonymous channels are required. The protocol is suitable for large-scale elections with numerous candidates and voters and accommodates the situation in which multiple voters vote simultaneously. (ii) It is the first protocol that dismantles the contradiction between verifiability and receipt-freeness in a quantum election protocol. It satisfies all eight requirements stated earlier under the physical assumptions that there exists a one-way untappable channel from the administrator to the voter and that there is no collusion between any of the three parties in the protocol. Compared with current election protocols with verifiability and receipt-freeness, this protocol relies upon fewer physical assumptions. (iii) This construction is flexible and can be instantiated into an election scheme having post-quantum security by applying cryptographic algorithms conveying post-quantum security. Moreover, utilizing quantum digital signature and public key encryption yields a good result: the transmitted ballots are in quantum states, so owing to the no-cloning theorem, ballot privacy is less likely to be compromised, even if private keys of the signature and public key encryption are leaked after the election. However, in existing election protocols employing classic digital signatures and public key encryption, ballot privacy can be easily violated if attackers obtain private keys. Thus, our construction enhances privacy.

scholarly journals Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC)

2020 ◽  
Vol 14 (1) ◽  
pp. 438-459
Author(s):  
Giovanni Di Crescenzo ◽  
Matluba Khodjaeva ◽  
Delaram Kahrobaei ◽  
Vladimir Shpilrain
Keyword(s):  
Elliptic Curves ◽  
Digital Signature ◽  
Cryptographic Protocols ◽  
Public Key ◽  
Small Probability ◽  
Signature Schemes ◽  
Cyclic Groups ◽  
Public Key Cryptosystems ◽  
Fixed Base

AbstractMany public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. To expand the applicability of these solutions to computationally weaker devices, it has been advocated that a computationally weaker client (i.e., capable of performing a relatively small number of modular multiplications) delegates such primitive operations to a computationally stronger server. Important requirements for such delegation protocols include privacy of the client’s input exponent and security of the client’s output, in the sense of detecting, except for very small probability, any malicious server’s attempt to convince the client of an incorrect exponentiation result. Only recently, efficient protocols for the delegation of a fixed-based exponentiation, over cyclic and RSA-type groups with certain properties, have been presented and proved to satisfy both requirements.In this paper we show that a product of many fixed-base exponentiations, over a cyclic groups with certain properties, can be privately and securely delegated by keeping the client’s online number of modular multiplications only slightly larger than in the delegation of a single exponentiation. We use this result to show the first delegations of entire cryptographic schemes: the well-known digital signature schemes by El-Gamal, Schnorr and Okamoto, over the q-order subgroup in ℤp, for p, q primes, as well as their variants based on elliptic curves. Previous efficient delegation results were limited to the delegation of single algorithms within cryptographic schemes.

Nonce-Based Key Agreement Protocol Against Bad Randomness

2019 ◽  
Vol 30 (04) ◽  
pp. 619-633
Author(s):  
Burong Kang ◽  
Xinyu Meng ◽  
Lei Zhang ◽  
Yinxia Sun
Keyword(s):  
Digital Signature ◽  
Key Agreement ◽  
Public Key ◽  
Security Model ◽  
Public Key Encryption ◽  
Signature Schemes ◽  
Key Agreement Protocol ◽  
Agreement Protocols

Most of the existing cryptographic schemes, e.g., key agreement protocol, call for good randomness. Otherwise, the security of these cryptographic schemes cannot be fully guaranteed. Nonce-based cryptosystem is recently introduced to improve the security of public key encryption and digital signature schemes by ensuring security when randomness fails. In this paper, we first investigate the security of key agreement protocols when randomness fails. Then we define the security model for nonce-based key agreement protocols and propose a nonce-based key agreement protocol that protects against bad randomness. The new protocol is proven to be secure in our proposed security model.

Sign in / Sign up

Export Citation Format

Share Document