1,453 Hits in 4.0 sec

An ECDLP-Based Threshold Proxy Signature Scheme Using Self-Certified Public Key System [chapter]

Qingshui Xue, Fengying Li, Yuan Zhou, Jiping Zhang, Zhenfu Cao, Haifeng Qian
2009 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
Based on Hsu et al's self-certified public key system and Li et al's proxy signature scheme, one threshold proxy signature scheme based on ECDLP and self-certified public key system is proposed.  ...  As far as we know, it is the first scheme based on ECDLP and self-certified public key system.  ...  In the paper, based on Hsu et al's self-certified public key system and Hwang's et al's proxy signature scheme, a threshold proxy signature scheme using self-certified public system is proposed by us.  ... 
doi:10.1007/978-3-642-04434-2_6 fatcat:74awecinrfdvrb2nuxj6socrta

Self-Certified Proxy Convertible Authenticated Encryption Scheme

Han-Yu Lin, Tzong-Sun Wu, Ting-Yu Huang, Yi-Shiung Yeh
2008 2008 Eighth International Conference on Intelligent Systems Design and Applications  
Integrating with self-certified public key systems, the proposed scheme can save more communication overheads and computation efforts, since it is not necessary to transmit and verify the public key certificate  ...  In case of a later repudiation, the specific recipient has the ability to convert the signature into an ordinary one for convincing anyone of the signer's dishonesty.  ...  It can be seen that the self-certified public key system is a better alternative to implement cryptographic schemes as compared with the certificate-based approach or the ID-based system.  ... 
doi:10.1109/isda.2008.139 dblp:conf/isda/LinWHY08 fatcat:sjguwiibevfcxjrrubn7hsaiqe

Self-Scrambling Anonymizers [chapter]

David Pointcheval
2001 Lecture Notes in Computer Science  
Indeed, the most secure ones generally suffer from inefficiency, largely due to the use of restrictive blind signatures, on the other hand efficient schemes often suffer from serious security drawbacks  ...  Those "Anonymity Providers" certify re-encrypted data after having been convinced of the validity of the content, but without knowing anything about this latter.  ...  the discrete logarithm x V of y V relatively to g.  ... 
doi:10.1007/3-540-45472-1_18 fatcat:kjduiwfp4bdp5ddausngm67dbi

A New Digital Signature Algorithm Similar to ELGamal Type

Haipeng Chen, Xuanjing Shen, Yingda Lv
2010 Journal of Software  
On this basis, aiming at the defect that the existing digital signature algorithms are weak to active attack and impersonation attack, using the hash algorithm named HRFA and the self-certified public  ...  key system, a new kind of digital signature algorithm, which is similar to ELGamal, named H-S DSA (Hash Round Function and Self-certified Public Key System Digital Signature Algorithm) is raised and realized  ...  The time-complexity of H-S DSA signature scheme depends on one-way function、hash round function、 Discrete Logarithm Problem and Self-certified public key system.  ... 
doi:10.4304/jsw.5.3.320-327 fatcat:3zbyw2zhwbdbrgtlnqf7wby3f4

Empirical Study of a Key Authentication Scheme in Public Key Cryptography

Kumaraswamy Palleboina
2017 International Journal of Engineering Research and Applications  
Earlier, many key authentication schemes are developed based on discrete logarithms. Each scheme has its own drawbacks.  ...  We developed a secure key authentication scheme based on discrete logarithms to avoid the drawbacks of earlier schemes.  ...  Some more key authentication schemes [8-13] were developed based on discrete logarithms and without using any certifying authorities.  ... 
doi:10.9790/9622-0703027986 fatcat:yo5q6xhw5naojmb57fxyuj7bya

Toward Efficient Convertible Authenticated Encryption Schemes Using Self-Certified Public Key System

2014 KSII Transactions on Internet and Information Systems  
Integrating the properties of self-certified public key systems, this paper presents efficient and computationally indistinguishable self-certified CAE schemes for strengthening the security of E-Commerce  ...  The recipient can also convert the signature into a conventional one which can be verified by anyone.  ...  Self-Certified CAE Schemes Based on Discrete Logarithms The proposed self-certified CAE schemes are divided into four stages: the user registration, the signature generation and verification, the signature  ... 
doi:10.3837/tiis.2014.03.026 fatcat:ibcfnzcv4nabhcx3ura6g7r53a

Public Key Authentication Schemes for Local Area Networks

Tzung-Her Chen, Gwoboa Horng, Chuan-Sheng Yang
2008 Informatica  
Consequently, the system security is mainly dependent on the honesty of these third parties.  ...  Most of the key authentication schemes require one or more trustworthy authorities to authenticate the key of a user.  ...  A Key Authentication Scheme for Cryptosystems Based on Discrete Logarithms In this section, the first scheme based on discrete logarithms is proposed.  ... 
doi:10.15388/informatica.2008.198 fatcat:xcuddeu5kfbrtec5i7xi46lkqy

Establishing Trust with Privacy [chapter]

Laurent Bussard, Refik Molva
2006 Lecture Notes in Computer Science  
Security Evaluation The security of the scheme is based on the assumptions that the discrete logarithm, the double discrete logarithm and the roots of discrete logarithm problems are hard.  ...  There are two main limitations to this scheme: it is well-known that signatures based on the proof of knowledge of a double discrete logarithm are not efficient in terms of computational complexity and  ... 
doi:10.1007/11861386_22 fatcat:wrg7elh5szdklhhmjh3s7bsyqu

Self-certified ring signatures

Nan Li, Yi Mu, Willy Susilo, Fuchun Guo
2011 Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security - ASIACCS '11  
based ring signatures.  ...  The main contribution of this paper is a precise definition of self-certified ring signatures along with a concrete construction.  ...  (Discrete Logarithm assumption) The discrete logarithm problem (DLP) is (t, ϵ)-hard, if given a tuple < P, aP > that P is a generator of a group G1 and a ∈R Z * q , there is no probabilistic polynomial  ... 
doi:10.1145/1966913.1966966 dblp:conf/ccs/LiMSG11 fatcat:hwmftkvb6bg3ve2o5ngn4wwqeq

Efficient self-certified proxy CAE scheme and its variants

Tzong-Sun Wu, Han-Yu Lin
2009 Journal of Systems and Software  
Elaborating on the merits of proxy signature schemes and convertible authenticated encryption (CAE) schemes, we adopt self-certified public key systems to construct efficient proxy CAE schemes enabling  ...  In addition, integrating with self-certified public key systems, our schemes can earn more computational efficiency, since authenticating the public key and verifying the proxy signature can be simultaneously  ...  In 1976, Diffie and Hellman (1976) proposed the first public key cryptosystem based on the discrete logarithm problem (DLP) (Delfs and Knebl, 2002; Menezes et al., 1997) .  ... 
doi:10.1016/j.jss.2008.12.040 fatcat:2y3zf66jgjdp7aucsy7rrlya2m

Certified Bitcoins [chapter]

Giuseppe Ateniese, Antonio Faonio, Bernardo Magri, Breno de Medeiros
2014 Lecture Notes in Computer Science  
We propose a certification system for Bitcoin that offers: a) an opt-in guarantee to send and receive bitcoins only to/ from certified users; b) control of creation of bitcoins addresses (certified users  ...  Ateniese and de Medeiros [3] describe a new self-certified scheme based on the Nyberg-Rueppel signature [12] scheme and its variants.  ...  Another self-certified public key scheme based on Elgamal signatures and provably secure in the Random Oracle Model (ROM) was described by Petersen and Horster [14] .  ... 
doi:10.1007/978-3-319-07536-5_6 fatcat:iwa6nma6hrhz7fbictm7m4unza

Self-certified multi-proxy signature schemes with message recovery

Tzong-sun Wu, Chien-lung Hsu, Han-yu Lin
2009 Journal of Zhejiang University: Science A  
We first propose a multi-proxy signature scheme based on discrete logarithms and then adapt it to the elliptic curve cryptosystem.  ...  With the integration of self-certified public-key systems and the message recovery signature schemes, our proposed schemes have the following advantages: (1) They do not require the signing message to  ...  In Section 2, we propose a multi-proxy signature scheme based on the discrete logarithms over a finite field.  ... 
doi:10.1631/jzus.a0820202 fatcat:ht7rl3qjhfegjl3xdztz5lzpdq

Cryptanalysis of Two Group Signature Schemes [chapter]

Marc Joye, Seungjoo Kim, Narn-Yih Lee
1999 Lecture Notes in Computer Science  
Group signature schemes allow a group member to anonymously sign on group's behalf. Moreover, in case of anonymity misuse, a group authority can recover the issuer of a signature.  ...  We show that both schemes are universally forgeable, that is, anyone (not necessarily a group member) is able to produce a valid group signature on an arbitrary message, which cannot be traced by the group  ...  In [13] , they also propose a group signature scheme based on the related notion of self-certified public keys [4] .  ... 
doi:10.1007/3-540-47790-x_23 fatcat:nupqs7tun5ca5d3njo26eijtma

Provably Secure Lattice-Based Self-Certified Signature Scheme

Qiang Yang, Daofeng Li
2021 Security and Communication Networks  
Then, based on the small integer solution problem, our scheme is provable secure in the random oracle model.  ...  Furthermore, compared with the previous self-certified signature schemes, our scheme is more secure.  ...  In addition, some self-certified signature schemes based on discrete logarithm problems were also proposed, Xie [21] and Wu and Xu [22] .  ... 
doi:10.1155/2021/2459628 doaj:652f9bd4dcf54fd6bba3aff496d7ebfc fatcat:can4aobmnbfdth5aoukuyyyppu

Design of DL-based certificateless digital signatures

Lein Harn, Jian Ren, Changlu Lin
2009 Journal of Systems and Software  
The proposed construction can be applied to all Discrete Logarithm (DL)-based signature schemes to convert a digital signature scheme into a CDS scheme.  ...  He has published a number of papers on digital signature design and applications and wireless and network security. He has written two books on security.  ...  The security analysis is based on discrete logarithm problem (DLP) and discrete logarithm assumption (DLA) in the random oracle model. Definition 1 (Discrete logarithm problem (DLP)).  ... 
doi:10.1016/j.jss.2008.11.844 fatcat:sl3dkmoih5ddtjcyvaasnk2xhi
« Previous Showing results 1 — 15 out of 1,453 results