A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We have presented cryptanalysis of improved CCH2 proxy multisignature scheme and showed that improved CCH2 scheme suffered from various attacks, that is, forgery attack and framing attack. ... We have represented time complexity, space complexity, and computational overhead of improved CCH1 and CCH2 proxy multisignature schemes. ... Acknowledgment The authors also wish to thank many anonymous referees for their suggestions to improve this paper. ...doi:10.1155/2014/429271 fatcat:7t3ba24uvzccppnirrk344gcxe
Rueppel, Message recovery for signature schemes based on the discrete log- arithm problem (182-193); Chuan-Ming Li, Tzonelih Hwang and Narn-Yih Lee, Threshold-multisignature schemes where suspected forgery ... Contents: Moni Naor and Adi Shamir, Visual cryptography (1- 12); Laszlé Csirmaz, The size of a share must be large (13-22); Marten van Dijk, A linear construction of perfect secret sharing schemes (23- ...
We have presented cryptanalysis of improved CCH2 proxy multi-signature scheme and showed that improved CCH2 scheme is suffered from various attacks i.e. forgery attack and framing attack. ... We have represented time complexity, space complexity and computational overhead of improved CCH1 and CCH2 proxy multi-signature schemes. ... Time, Space and Computational overhead of improved CCH1 and CCH2 scheme This table shows the time, space and computational overhead of improved CCH1 and CCH2 proxy multisignature scheme with varying value ...doi:10.5815/ijcnis.2014.04.06 fatcat:32zvu665xzhqff5pwp3jgigtje
The rest of this paper is organized as follows: In Section 2, I briefly review of Burmester's scheme and give out the cryptanalysis on Burmester's scheme. ... In 2004, Harn L proposed a structured multisignature algorithm  , the size of this scheme is identical to that of an individual signature, and the verification process of the structured multi-signature ... It is well known Security Analysis of Burmester's Scheme Briefly Review of Burmester's Scheme  System Initialization Let p be a large prime, q a prime divisor of p-1, M is the message which to ...doi:10.14257/ijsia.2014.8.3.06 fatcat:mbnoxlihg5gq5bzujao4nmsqva
Then we propose a structured multisignature scheme against forgery attack. In the new scheme, we increase the signature parameter verification to improve security. ... There are some classic structured multi-signature programs, such as Burmester's, Harn's and Lin's schemes that can not resist inside attack and outside attack. ... In 2003, Kawauehi and Tada pointed out improvement scheme on the basis of literature  , and demonstrated its safety  . ...doi:10.5815/ijwmt.2011.06.10 fatcat:skkunxyck5hfhc43hkdadzrfvq
We compare the performance of four schemes , Kuo and Chen (2005) , Yong-Jun et al. (2007) , and Li et al. (2007) , with the performance of a scheme that has been proposed earlier by the authors of this ... In this scheme, a (t, n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t − 1 or fewer of them cannot do it. ... Acknowledgment The authors wish to thank many anonymous referees for their suggestions to improve this paper. ...doi:10.1155/2013/790257 fatcat:s3txzl2mrbghxof2gnjfd6f5w4
Most of the key authentication schemes require one or more trustworthy authorities to authenticate the key of a user. ... and it uses a designated password authentication mechanism. ... Review and Cryptanalysis of LHL Scheme To remedy the password guessing attacks and public key forging attacks of (Zhan et al., 1999; Lee and Wu, 2001; Horng and Yang, 1996) , the LHL scheme was proposed ...doi:10.15388/informatica.2008.198 fatcat:xcuddeu5kfbrtec5i7xi46lkqy
(Summary) 2004b:94067 94A60 (68P25) — (with Hwang, Shin-Jia; Tzeng, Shiang-Feng) A new digital multisignature scheme with distinguished signing authorities. (English summary) J/SE J. Inf. Sci. ... (Summary) 2004g:94067 94A62 (68P25, 94A60) — (with Hwang, Min-Shiang; Tzeng, Shiang-Feng) A new digital multisignature scheme with distinguished signing authorities. (English summary) J/SE J. Inf. ...
(English summary) 98f:94018 — (with Quisquater, Jean-Jacques) Cryptanalysis of RSA-type cryptosystems: a visit. (English summary) 98i:94020 Kabatyanskil, G. A. see Blakley, G. ... ., 98b:94011 94A Communication, information 94A60 Kelsey, John (with Schneier, Bruce; Wagner, David) Key-schedule cryptanalysis of IDEA, G-DES, GOST, SAFER, and triple-DES. ...
We study the instantiation of these two modes and the transitions between them. Our implementation and simulation measurements confirm the effectiveness of our design. ... In this paper we design and evaluate a security framework for multilevel ad hoc wireless networks with unmanned aerial vehicles (UAVs). ... Acknowledgments Mario Gerla was partially supported by Office of Naval Research MINUTEMAN project, grant number N00014-01-C-0016. ...doi:10.1002/wcm.75 fatcat:atgyh4etrbduviqt5uicpnrw6a
The proposed framework consists of four components (i.e., an authenticator, a client, a hardware wallet, and a smart contract), and it provides 2-factor authentication (2FA) performed in two stages of ... In this paper, we propose SmartOTPs, a smart-contract wallet framework that gives a flexible, usable, and secure way of managing crypto-tokens in a self-sovereign fashion. ... The n-of-m multisignature scheme is provided by Gnosis Wallet  , which currently holds a significant amount of Ether across various smart contracts. ...arXiv:1812.03598v4 fatcat:ss53iwh7qbcmvaqzgnsiqcgcey
(English summary ) Li, Yan Jun see Yang, Gang Li, Zeng Ti see Gao, Suo Gang, 2004f:94081 Li, Zichen (with Cheng, Jun-Xiang; Dai, Yiqi) Cryptanalysis and improvement of Piveteau signature scheme with message ... A scheme for the division of a secret for dataflows of a routable network. (Russian. ...
Algorithms and Theory of Computation Handbook
Acknowledgements We thank Anish Mathuria and Hossein Ghodosi for all their comments and suggestions which have greatly helped us improve our exposition. ... Ohta and Okamoto 67] propose a sequential multisignature scheme based on the Fiat-Shamir signature scheme. ... Harn 47] proposes three simultaneous multisignature schemes, based on the di culty of discrete logarithm. Two of these schemes do not require a trusted third party. ...doi:10.1201/9781420049503-c42 fatcat:xg65mukqofe2bhbjvuaznsycfm
Algorithms and Theory of Computation Handbook, Second Edition, Volume 2
Acknowledgements We thank Anish Mathuria and Hossein Ghodosi for all their comments and suggestions which have greatly helped us improve our exposition. ... Ohta and Okamoto 67] propose a sequential multisignature scheme based on the Fiat-Shamir signature scheme. ... Harn 47] proposes three simultaneous multisignature schemes, based on the di culty of discrete logarithm. Two of these schemes do not require a trusted third party. ...doi:10.1201/9781584888215-c13 fatcat:zsuahxcirzd5dbangxble4bczq
(English summary) 2002j:94030 Burmester, Mike (with Desmedt, Yvo; Doi, Hiroshi; Mambo, Masahiro; Okamoto, Eiji; Tada, Mitsuru; Yoshifuji, Yuko) A structured ElGamal-type multisignature scheme. ... On a type of isomorphism of linear and nonlinear signature analyzers. (Russian. ...
« Previous Showing results 1 — 15 out of 22 results