Filters








31,697 Hits in 5.1 sec

Convertible Multi-authenticated Encryption Scheme for Data Communication

Hui-Feng Huang, Pin-Han Lin, Min-Hsuan Tsai
2015 International Journal of Network Security  
by a group of signers instead of a signal signer. (3) Except for the designated recipient, no one can derive the signed message and verify its corresponding signature. (4) When a later dispute on repudiation  ...  To protect the receiver's benefit of a later dispute on repudiation, the receiver has the ability to convert the signature into an ordinary one that can be verified by anyone.  ...  His current research interests are in the area of cryptography, information security, network security and electronic commerce.  ... 
dblp:journals/ijnsec/HuangLT15 fatcat:crqle6qudjdzjerfzeabjlpppi

Secure Convertible Undeniable Signature Scheme Using Extended Euclidean Algorithm without Random Oracles

2013 KSII Transactions on Internet and Information Systems  
A convertible undeniable signature requires a verifier to interact with the signer to verify a signature and furthermore allows the signer to convert a valid one to publicly verifiable signature.  ...  The proposed scheme has been evaluated based on computation and communication complexities and the performance comparisons of Yuen et al.'  ...  Acknowledgements The authors would like to thank the anonymous reviewers for the valuable comments on this work.  ... 
doi:10.3837/tiis.2013.06.010 fatcat:rsy5odhgsvai7gl2pa63zlt6oe

Generalized Key Substitution Attacks on Message Recovery Signatures

Atsushi Fujioka
2017 Tatra Mountains Mathematical Publications  
The generalized key substitution attacks were proposed as a generalization of the key substitution attacks to examine the security of the signature schemes adopted in ISO/IEC (1st CD) 14888-3, which standardizes  ...  appendix- -type signature schemes based on the discrete logarithm problem.  ...  We examined vulnerability of the MRS schemes adopted in ISO/IEC 9796--3:2006 against the GWKS attack using an unified representation of the schemes.  ... 
doi:10.1515/tmmp-2017-0022 fatcat:n2fuyycwqfgktm4ctf6f3nsgye

Security Analysis of Two Signcryption Schemes [chapter]

Guilin Wang, Robert H. Deng, DongJin Kwak, SangJae Moon
2004 Lecture Notes in Computer Science  
In this paper, we present a security analysis of two such schemes: the Huang-Chang convertible signcryption scheme [12] , and the Kwak-Moon group signcryption scheme [13] .  ...  Signcryption is a new cryptographic primitive that performs signing and encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach  ...  linearly depend on the number of group members, so that such schemes are suitable for large groups.  ... 
doi:10.1007/978-3-540-30144-8_11 fatcat:7mhpfypscbgujmidbgzg5eykge

Gradually Convertible Undeniable Signatures [chapter]

Laila El Aimani, Damien Vergnaud
2007 Lecture Notes in Computer Science  
We supply a formal security treatment of the modified scheme: we prove, in the generic group model, that the protocol is existentially unforgeable and anonymous under chosen message attacks, assuming new  ...  Michels, Petersen and Horster presented, in 1996, an attack on the El Gamal-based seminal scheme of Boyar et al. and proposed a repaired version without formal security analysis.  ...  This article focuses on the security treatment and on the proposal of an additional functionality for Michels-Petersen-Horster convertible undeniable signatures.  ... 
doi:10.1007/978-3-540-72738-5_31 fatcat:n7aripctdregdpusg6fw4fcu24

A Robust Convertible Multi-Authenticated Encryption Scheme with One-Way Hash Function

Chung Fu Lu, Chien Lung Hsu, Han Yu Lin, Chien Hui Su
2014 International Journal of Future Computer and Communication  
A convertible multi-authenticated encryption (CMAE) scheme allows a group of signers to cooperatively produce a valid authenticated encryption signature and still preserves the characteristic of convertible  ...  In 2008, Tsai proposed a CMAE scheme based on the intractability of one-way hash functions and discrete logarithms.  ...  His current research includes cryptography, information security, wireless sensor network, mobile commerce, digital forensics, vehicular system security, healthcare system and user acceptance, smart home  ... 
doi:10.7763/ijfcc.2014.v3.318 fatcat:44l6he2h6zecdl36sgzc47xv5m

Generalized Ring Signatures

J. Ren, L. Harn
2008 IEEE Transactions on Dependable and Secure Computing  
It may result in a higher level of confidence or broader coverage on the message source; 3) the proposed ring signature is convertible.  ...  In this paper, we first propose a generalized ring signature scheme based on the original ElGamal signature scheme.  ...  ACKNOWLEDGMENTS The authors would like to thank an anonymous reviewer for the valuable comments on an earlier version of this paper.  ... 
doi:10.1109/tdsc.2008.22 fatcat:p6cl4lrpjzc5hn3bjrq3kfwztu

(Convertible) Undeniable Signatures Without Random Oracles [chapter]

Tsz Hon Yuen, Man Ho Au, Joseph K. Liu, Willy Susilo
2007 Lecture Notes in Computer Science  
The security of our scheme is based on the CDH and the decision linear assumption.  ...  We propose a convertible undeniable signature scheme without random oracles. Our construction is based on the Waters signatures proposed in Eurocrypt 2005.  ...  The decision linear assumption is proposed in [6] to prove the security of short group signatures.  ... 
doi:10.1007/978-3-540-77048-0_7 fatcat:inn2ywnux5bkjfnjhkozyedjr4

Limited Verifier Signature from Bilinear Pairings [chapter]

Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
2004 Lecture Notes in Computer Science  
In this paper, we first present the precise definition and clear security notions for (convertible) limited verifier signature, and then propose two efficient (convertible) limited verifier signature schemes  ...  The signature can be verified by a limited verifier, who will try to preserve the privacy of the signer if the signer follows some specified rules.  ...  This work was supported by a grant No.R12-2003-004-01004-0 from the Ministry of Science and Technology, Korea.  ... 
doi:10.1007/978-3-540-24852-1_10 fatcat:lhxw4jmzrza43aayn6we4d73k4

Convertible multi-authenticated encryption scheme with verification based on elliptic curve discrete logarithm problem

Nedal Tahat
2016 International journal of computer applications in technology  
The work presents a Convertible Multi-Authenticated Encryption (CMAE) scheme based on the Elliptic Curve Discrete Logarithm Problem (ECDLP).  ...  As for efficiency, the computation cost of the proposed scheme is smaller than the existing schemes, such as Lu et al.'s scheme.  ...  This paper suggested a secure and efficient CMAE scheme based on ECDLP.  ... 
doi:10.1504/ijcat.2016.10000490 fatcat:4bhjmgmj45hwnhv76volp275bq

Provably Secure Convertible Undeniable Signatures with Unambiguity [chapter]

Le Trieu Phong, Kaoru Kurosawa, Wakaha Ogata
2010 Lecture Notes in Computer Science  
This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model and discrete logarithm setting.  ...  In other words, our schemes can be viewed as anonymous signature schemes as well as convertible undeniable signature schemes.  ...  Acknowledgements We thank Dennis Hofheinz for communicating on the strong uf-cma security of the GBM scheme.  ... 
doi:10.1007/978-3-642-15317-4_19 fatcat:hqxnu3rhvrhm7kgotke2sob3hu

Privacy-enhanced Designated Confirmer Signature without Random Oracles

Shengke Zeng, Hu Xiong
2014 International Journal of Network Security  
In a DCS scheme, the validity of the signature must be confirmed by the signer or a semi-trusted third party, called confirmer.  ...  However, from the view of the signer, the privacy is leaked if the DCS is converted into an ordinary signature by the confirmer. In this work, we propose a new DCS scheme without the random oracles.  ...  Acknowledgments This work is supported by Fundamental Research Funds for the Central Universities (No.ZYGX2011J068) and the NSFS (No.61133016 and No.61003230).  ... 
dblp:journals/ijnsec/ZengX14a fatcat:bgd3436sajautbh6y3s6lz66ue

Convertible Group Undeniable Signatures [chapter]

Yuh-Dauh Lyuu, Ming-Luen Wu
2003 Lecture Notes in Computer Science  
group signatures without compromising security of the secret key needed to generate signatures.  ...  In this paper, we propose a convertible group undeniable signature scheme in which the group manager can turn all or selective signatures, which are originally group undeniable signatures, into ordinary  ...  In general, a group undeniable signature scheme has the following security considerations: Unforgeability: Only the group member can sign on behalf of the group.  ... 
doi:10.1007/3-540-36552-4_4 fatcat:3mlopgphlzabnjt36p3f5whlqq

Efficient ID-Based Authenticated Group Key Agreement from Bilinear Pairings [chapter]

Lan Zhou, Willy Susilo, Yi Mu
2006 Lecture Notes in Computer Science  
All Rights Reserved ii Dedicated to my parents iii Declaration I, Lan Zhou, declare that this thesis, submitted in partial fulfilment of the requirements for the award of Master of Computer Science by  ...  research, in the School of Information Technology and Computer Science, University of Wollongong, is wholly my own work unless otherwise referenced or acknowledged.  ...  Consequently, a series of OSBE schemes based on ElGamal family signatures was proposed, along with a generic construction of SH from OSBE.  ... 
doi:10.1007/11943952_44 fatcat:rlhvi7dsoncirg7dq3vgmzngte

Universally Convertible Directed Signatures [chapter]

Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud
2005 Lecture Notes in Computer Science  
Our construction relies on the so-called xyz-trick applicable to bilinear map groups.  ...  Directed signatures differ from the well-known confirmer signatures in that the signer has the simultaneous abilities to confirm, deny and individually convert a signature.  ...  The proof relies on the Forking Lemma [22] and is in spirit rather similar to the security proof of known discrete-log-based signature schemes such as Schnorr.  ... 
doi:10.1007/11593447_37 fatcat:kpucfvpoafdn5o2iv4wiwrjs4e
« Previous Showing results 1 — 15 out of 31,697 results