Results 1 - 10 of 66

A Publicly Verifiable Authenticated Encryption Scheme Based on Factoring and Discrete Logarithms

by Cheng-Yi Tsai , Chi-Yu Liu , Shyh-Chang Tsaur , Min-Shiang Hwang , Min-Shiang Hwang
"... Abstract In this article, we propose a publicly verifiable authenticated encryption scheme based on factoring and discrete logarithms. We point out that even if either factoring or discrete logarithms is broken, this scheme still could keep the authentication, integration, and confidentiality of th ..."
Abstract - Add to MetaCart
Abstract In this article, we propose a publicly verifiable authenticated encryption scheme based on factoring and discrete logarithms. We point out that even if either factoring or discrete logarithms is broken, this scheme still could keep the authentication, integration, and confidentiality

Digital Signcryption or How to Achieve Cost(Signature

by Yuliang Zheng , 1997
"... Abstract. Secure and authenticated message delivery/storage is one of the major aims of computer and communication security research. The current standard method to achieve this aim is “(digital) signature followed by encryption”. In this paper, we address a question on the cost of secure and authen ..."
Abstract - Cited by 205 (20 self) - Add to MetaCart
expansion than does “signature followed by encryption ” based on the discrete logarithm problem (factorization problem, respectively).

A New Digital Signature Scheme Based on Factoring and Discrete Logarithms

by Ismail E. S, N. M. F. Tahat, R. R Ahmad
"... Abstract: Problem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factori ..."
Abstract - Add to MetaCart
scheme based on multiple hard problems namely factoring and discrete logarithms. We combined the two problems into both signing and verifying equations such that the former depends on two secret keys whereas the latter depends on two corresponding public keys. Results: The new scheme was shown

Unconditionally Secure Anonymous Encryption and Group Authentication 1

by Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, Hideki Imai , 2005
"... Anonymous channels or similar techniques that achieve sender’s anonymity play important roles in many applications, e.g. electronic voting. However, they will be meaningless if cryptographic primitives containing sender’s identity are carelessly used during the transmission. In computationally secur ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
security policy can no longer assume the difficulty of solving factoring or discrete logarithm problems, it must shift its focus to assuring the solvency of unconditionally secure schemes that provide long-term security. The main contribution of this paper is to study the security primitives for the above

doi:10.1093/comjnl/bxh149 Unconditionally Secure Anonymous Encryption and Group Authentication 1

by Goichiro Hanaoka, Junji Shikata, Yumiko Hanaoka, Hideki Imai , 2005
"... Anonymous channels or similar techniques that achieve sender’s anonymity play important roles in many applications, e.g. electronic voting. However, they will be meaningless if cryptographic primitives containing sender’s identity are carelessly used during the transmission. In computationally secur ..."
Abstract - Add to MetaCart
security policy can no longer assume the difficulty of solving factoring or discrete logarithm problems, it must shift its focus to assuring the solvency of unconditionally secure schemes that provide long-term security. The main contribution of this paper is to study the security primitives for the above

Semantic Searchable Encryption Scheme based on Lattice in Quantum-era

by Yang Yang, Maode Ma
"... Abstract. When data is outsourced to a remote storage server, search-able encryption plays an important role to protect data privacy while allowing users to retrieve data in the massive ciphertext. As far as we know, most of the existing searchable encryption schemes work based on the bilinear map. ..."
Abstract - Add to MetaCart
. These schemes may not be secure in the quantum age. Both discrete logarithms and factorization can be solved by quantum computer in a polynomial time. There is very few searchable encryption scheme that can be proved secure in post quantum age. In this paper, in order to construct a post-quantum secure scheme

An Effective Approach for Data encryption technique based on

by Block Cipher, Sameer Gulhane, Sonali Mahindre
"... Abstract- The data encryption using digital signature technique is essential for secure transactions over open networks. It is used in a variety of applications to ensure the integrity of data exchanged or stored and to prove to the recipient the originator's identity. Digital signature schemes ..."
Abstract - Add to MetaCart
combination of prime factorization and discrete logarithms, but different weaknesses and attacks have been developed against those algorithms. This Research paper presents a new variant of digital signature algorithm which is based on linear block cipher or Hill cipher initiate with Asymmetric algorithm using

ECDKG: A Distributed Key Generation Protocol Based on Elliptic Curve Discrete Logarithm

by Caimu Tang
"... In public key based cryptosystems, key distribution has been a crucial issue of protocol design. Many attack methods are orchestrated by making use of some weakness at the stage of key distribution. In this report, we also propose a distributed key generation protocol based on elliptic curve discret ..."
Abstract - Add to MetaCart
discrete logarithm, called ECDKG. Existing distributed key generation protocols use either cryptosystems based on discrete logarithm over a finite field or Integer factorization as a building block. The secrecy has been proven and the secrecy is as strong as the building block systems. However

APractical Lattice-based Digital Signature Schemes

by unknown authors
"... Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring as-sumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case o ..."
Abstract - Add to MetaCart
Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring as-sumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case

CMSS -- An Improved Merkle Signature Scheme Johannes Buchmann

by Luis Carlos Coronado, Johannes Buchmann, Luis Carlos, Coronado García, Erik Dahmen, Elena Klintsevich, Technische Universität Darmstadt , 2006
"... The Merkle signature scheme (MSS) is an interesting alternative for well established signature schemes such as RSA, DSA, and ECDSA. The security of MSS only relies on the existence of cryptographically secure hash functions. MSS has a good chance of being quantum computer resistant. In this pape ..."
Abstract - Add to MetaCart
The Merkle signature scheme (MSS) is an interesting alternative for well established signature schemes such as RSA, DSA, and ECDSA. The security of MSS only relies on the existence of cryptographically secure hash functions. MSS has a good chance of being quantum computer resistant
Results 1 - 10 of 66