# Digital Signature Scheme

Xem 1-20 trên 40 kết quả Digital Signature Scheme
• ### Lecture Cryptography and network security: Chapter 13

Lecture Cryptography and network security: Chapter 13 after studying this section will help you understand: To define a digital signature; To define security services provided by a digital signature; To define attacks on digital signatures; To discuss some digital signature schemes, including RSA, ElGamal;...

• ### Phát triển lược đồ chữ ký số mù

Bài viết đề xuất xây dựng 2 lược đồ chữ ký số mù từ việc phát triển lược đồ chữ ký số trên cơ sở bài toán logarithm rời rạc. Các lược đồ mới đề xuất ở đây có mức độ an toàn cao hơn về khả năng chống tấn công làm lộ nguồn gốc của bản tin được ký so với một số lược đồ đã biết trước đó trong thực tế. Mời các bạn cùng tham khảo!

• ### A new construction method of digital signature algorithms

The article presents a new construction method of digital signature algorithms based on difficulty of the discrete logarithm problem. From the proposed method, the different signature schemes can be deployed to choose suitably for applications in practice.

• ### A design method of digital signature scheme based on discrete logarithm problem

This paper proposes a design method of digital signature scheme based on the difficulty of the discrete logarithm problem. With the proposed method, we can develop a lot of other digital signature schemes to choose suitable for practical applications.

• ### Constructing a digital signature algorithm based on the difficulty of some expanded root problems

This paper presents the proposed method of building a digital signature algorithm which is based on the difficulty of solving root problem and some expanded root problems on Zp. The expanded root problem is a new form of difficult problem without the solution, also originally proposed and applied to build digital signature algorithms. This proposed method enable to build a high-security digital signature platform for practical applications.

• ### A new method for constructing digital signature algorithm based on a new key scheme

In this paper, with the target to improve safety level of digital signature algorithms, we present the proposed method for constructing digital signature algorithms which is based on a new key scheme. This new key format is constructed using a new difficulty problem without high-efficiency solution and it can be applied to construct digital signature algorithms. According to this research, a high-security digital signature class can be construct by the proposed method in some actual situation.

• ### Developing root problem aims to create a secure digital signaturescheme in data transfer

This paper presents the proposed method of building a digital signature algorithm which is based on the difficulty of solving root problem and some expanded root problems on Zp. The expanded root problem is a new form of difficult problem without the solution, also originally proposed and applied to build digital signature algorithms. This proposed method enable to build a high-security digital signature platform for practical applications.

• ### Blind signature scheme based on discrete logarithm problem

The paper focuses on analyzing weaknesses which can be attacked reveals the origin of a message being signed by known blind digital scheme, which proposed a new scheme have higher degree of security in a sense of keeping secret the source of the signed message. It will meet the demand of the real.

• ### Constructing digital signature algorithms based on new key schemes

The paper proposes a method of constructing digital signature algorithms based on the new key schemes. The new key schemes are difficult problems that currently have no solution. That algorithm construction method with a new key scheme is to improve the security of digital signature algorithms. The new method is showed through the construction of two specific digital signature algorithms and the generation of highly secure signature algorithms that are constructed by this method is completely possible.

• ### A new digital signature scheme based on the hardness of some expanded root problems

This paper presents a new digital signature scheme which is based on the hardness of solving root problem and some expanded root problems on Zp. The expanded root problem is a new form of difficult problem without efficient solution, also originally proposed and applied to build digital signature algorithms. This proposed scheme enable to build a high-security digital signature platform for practical applications.

• ### Digital signatures

"Ebook Digital signatures" present digital signatures background and definitions; cryptographic hardness assumptions; digital signature schemes without random oracles; signature schemes based on the (strong) RSA assumption; constructions based on bilinear maps; the random oracle model; signature schemes from identification schemes...

• ### Lecture Data security and encryption - Chapter 20: Digital Signatures

The contents of this chapter include all of the following: Digital signatures, ElGamal & Schnorr signature schemes, digital signature algorithm and standard, digital signature model, attacks and forgeries, digital signature requirements, direct digital signatures, ElGamal digital signature.

• ### Lecture Data security and encryption - Chapter 21: Key management and distribution

The contents of this chapter include all of the following: symmetric key distribution using symmetric encryption, symmetric key distribution using public-key encryption, distribution of public keys, digital signatures, ElGamal & Schnorr signature schemes, digital signature algorithm and standard, X.509 authentication and certificates.

• ### Lecture TCP-IP protocol suite (3/e): Chapter 28 - Behrouz Forouzan

Chapter 28 - Security. In this chapter, you will learn to: Differentiate between two categories of cryptography schemes; understand four aspects of security; understand the concept of digital signature; understand the role of key management in entity authentication; know how and where IPSec, TLS, and PPG provide security.

• ### Phát triển một lược đồ chữ ký số mới có độ an toàn dựa trên bài toán Logarit rời rạc trên vành Zn

Bài viết đề xuất một lược đồ chữ ký số dựa trên bài toán Logarit rời rạc theo modulo hợp số, một biến thể của lược đồ chữ ký số Elgamal.

• ### A novel establishing and managing secure group key method

This paper proposes a novel method to prevent man in the middle attack by combining the OFT scheme with digital signatures scheme which is used to authenticate the participants. Beside, the proposed method can also prevent the collusion attack.

• ### Constructing the digital signature scheme based on the discrete logarithmic problem

In this report, the DSA digital signature scheme has been introduced. Based on these digital signature scheme, a new digital signature scheme on the ring of Zn is developed. Its computing complexity is similar to the DSA and getting rid of some unwanted disadvantages of the DSA digital signature scheme and can be applied in practice.

• ### A development of DSA digital signature scheme based on ring

This paper, we propose a solution that improves the DSA digital signature scheme on ring

• ### Embedded digital signature based data sharing scheme in cloud computing

In this encryption technique, Users’ private keys and cipher texts are associated with a set of attributes. This technique completely encrypts the file and does not have any control over the individual attributes in the file. So, in order to overcome this problem a concept called attribute with weight was introduced, so that it can have control over the individual elements in the file and can be able to hide sensitive information while sharing data with the users

• ### Utilization of ECDLP for constructing a new certificate based digital signature

The proposed scheme’s security is proven under the elliptic curve discrete logarithm assumption in the random oracle model. Results of comparing our scheme with existing pairing-free certificate-based signature schemes, shows that ours has much lower computational cost.