2,165 Hits in 5.5 sec

Secure and Practical Tree-Structure Signature Schemes Based on Discrete Logarithms [chapter]

X. Y. Wang, L. C. Hui, K. P. Chow, W. W. Tsang, C. F. Chong, H. W. Chan
2000 Lecture Notes in Computer Science  
In this paper, we present another tree-structure signature scheme based on discrete logarithm problem modulo p, where p is a large prime.  ...  We can regard the scheme as an application of ELGamal signature scheme in tree-structure signature schemes.  ...  The scheme achieves the "ideal" security under the discrete logarithm assumption. In this paper, we propose an alternate tree-structure signature scheme also based on discrete logarithms.  ... 
doi:10.1007/978-3-540-46588-1_12 fatcat:ar7xq24m7fhnlm3tm6usqphxyq

Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer [chapter]

David Chaum, Eugène van Heijst, Birgit Pfitzmann
1992 Lecture Notes in Computer Science  
All the efficient schemes are based on a discrete logarithm assumption, and they are not cryptographically strong, i.e., proved to be as secure as the discrete logarithm.  ...  Interesting new subprotocols are efficient collision-free hash functions based on a discrete logarithm assumption, efficient perfectly hiding commitments for elements of Z Z p ( p prime), and fairly practical  ...  Acknowledgements We are happy to thank Manfred Böttger for initializing this cooperation and for saving us a lot of time by quickly spotting a principle problem in an early version of this scheme, Matthijs  ... 
doi:10.1007/3-540-46766-1_38 fatcat:mqw3kj7hr5hzzdxvjezntnwwma

An Efficient Elliptic Curve Discrete Logarithm based Trapdoor Hash Scheme without Key Exposure

Yi Sun, Xingyuan Chen, Xuehui Du
2013 Journal of Computers  
In this paper, an efficient trapdoor hash scheme without key exposure based on elliptic curve discrete logarithm is put forward and its security is analyzed, the scheme satisfies the five properties of  ...  The trapdoor hash function plays essential role in constructing certain secure digital signature, and signature scheme that composed by trapdoor hash function is widely applied in different fields.  ...  key exposure based on elliptic curve discrete logarithm, and analyses the security and performance of the scheme.  ... 
doi:10.4304/jcp.8.11.2851-2856 fatcat:o4t4qxha6fe3xl2bcxbinnpwoq

Post-Quantum Cryptography: State of the Art [chapter]

Johannes A. Buchmann, Denis Butin, Florian Göpfert, Albrecht Petzoldt
2016 Lecture Notes in Computer Science  
This paper gives an overview of the alternative public-key schemes that have the capability to resist quantum computer attacks and compares them.  ...  Public-key cryptography is indispensable for cyber security.  ...  The security of these schemes relies on the hardness of the integer factorization problem and the discrete logarithm problem.  ... 
doi:10.1007/978-3-662-49301-4_6 fatcat:ylrv42q33fegnidacywmkzmvme

Page 6319 of Mathematical Reviews Vol. , Issue 2002H [page]

2002 Mathematical Reviews  
(PRC-HK-CIS; Hong Kong) Secure and practical tree-structure signature schemes based on discrete logarithms.  ...  Summary: “In this paper, we present another tree-structure sig- nature scheme based on a discrete logarithm problem modulo p, where p is a large prime.  ... 

Page 4598 of Mathematical Reviews Vol. , Issue 2002F [page]

2002 Mathematical Reviews  
Chan, Secure and practical tree-structure signature schemes based on discrete logarithms (167-177); Sang Uk Shin and Kyung Hyune Rhee, All-or-nothing transform and remotely keyed en- cryption protocols  ...  , The composite discrete logarithm and secure authen- tication (113-128); David Pointcheval, Chosen-ciphertext security for any one-way cryptosystem (129-146).  ... 

The Impact of Quantum Computing on Present Cryptography

Vasileios Mavroeidis, Kamer Vishi, Mateusz D., Audun Jøsang
2018 International Journal of Advanced Computer Science and Applications  
cryptography, hash-based signatures and code-based cryptography.  ...  , quantum algorithms (Shor's and Grover's), public key encryption schemes affected, symmetric schemes affected, the impact on hash functions, and post quantum cryptography.  ...  discrete logarithms (e.g., DSA signatures and ElGamal encryption).  ... 
doi:10.14569/ijacsa.2018.090354 fatcat:odfnypuofnfkjkdq4wdd5yvabe

CMSS – An Improved Merkle Signature Scheme [chapter]

Johannes Buchmann, Luis Carlos Coronado García, Erik Dahmen, Martin Döring, Elena Klintsevich
2006 Lecture Notes in Computer Science  
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.  ...  The security of those schemes relies on the difficulty of factoring large composite integers and computing discrete logarithms.  ... 
doi:10.1007/11941378_25 fatcat:dy3ish4guvakjmgysnlsccrpdq

Secure acknowledgment aggregation and multisignatures with limited robustness

Claude Castelluccia, Stanisław Jarecki, Jihye Kim, Gene Tsudik
2006 Computer Networks  
Multicast (one-to-many) and group communication is widespread in a variety of settings.  ...  Multicast security has been the subject of much attention in the research literature.  ...  In Appendix A we show how our robust multisignature scheme based on the discrete logarithm problem generalizes to other multisignature schemes, using as an example a scheme based on Guillou-Quisquater  ... 
doi:10.1016/j.comnet.2005.09.021 fatcat:purfrp6nonhs5naoeh6vj7lgxa

Fail-Stop Signatures

Torben Pryds Pedersen, Birgit Pfitzmann
1997 SIAM journal on computing (Print)  
They are efficient enough to be used in practice. Next, we prove lower bounds on the efficiency of any fail-stop signature scheme.  ...  This paper formally defines fail-stop signatures and shows their relation to ordinary digital signatures. A general construction and actual schemes derived from it follow.  ...  We also thank Ivan Damgård and Andreas Pfitzmann for several good ideas and Joachim Biskup, Gerrit Bleumer, David Chaum, and the anonymous referees for interesting comments.  ... 
doi:10.1137/s009753979324557x fatcat:tc6q6nnbj5hbnnwujwkyj6drrq

A Robust Multisignature Scheme with Applications to Acknowledgement Aggregation [chapter]

Claude Castelluccia, Stanisław Jarecki, Jihye Kim, Gene Tsudik
2005 Lecture Notes in Computer Science  
While the solution of [NM04], based on a multisignature scheme of Boldyreva [Bol03], relied on so-called "Gap Diffie-Hellman" groups, we propose a solution using a multisignature scheme which is secure  ...  under just the discrete logarithm assumption.  ...  A Robust Discrete-Log Based Multisignature Scheme Computational Setting and Initialization We propose a multisignature scheme based on an extension of the Schnorr signature scheme [Sch89] .  ... 
doi:10.1007/978-3-540-30598-9_14 fatcat:q5ln32zyqfda3orb4pah6hoiq4

On the Performance Analysis of SPHINCS+ Verification

Tae Gu KANG, Jinwoo LEE, Junyeng KIM, Dae Hyun YUM
2019 IEICE transactions on information and systems  
SPHINCS + , an updated version of SPHINCS, is a postquantum hash-based signature scheme submitted to the NIST postquantum cryptography standardization project.  ...  To evaluate its performance, SPHINCS + gives the theoretical number of function calls and the actual runtime of a reference implementation.  ...  discrete logarithm problem.  ... 
doi:10.1587/transinf.2019edl8131 fatcat:ncq2rhxpg5d3ve6tkuof4umtae

Digital signature scheme for information non-repudiation in blockchain: a state of the art review

Weidong Fang, Wei Chen, Wuxiong Zhang, Jun Pei, Weiwei Gao, Guohui Wang
2020 EURASIP Journal on Wireless Communications and Networking  
Secondly, the typical digital signature schemes in blockchain are classified and analyzed, and then the state-of-the-art digital signatures are investigated and compared in terms of application fields,  ...  Our works will facilitate to design efficient and secure digital signature algorithms in blockchain.  ...  WF mainly worked on the researched. WZ, WC, and JP revised this paper. WG and GW mainly added to and revised the related works. All of the authors equally contributed to reviewing the manuscript.  ... 
doi:10.1186/s13638-020-01665-w fatcat:wnp4uxzixzfzngxnerlkbewame

Efficient Divisible E-cash based on the P Signature

Yanling Huo, Haibin Wang, Xuguang Chai, Xia Liu
2014 International Journal of Multimedia and Ubiquitous Engineering  
This scheme is based on P-signature [13] , simulatable verifiable random functions [23] and Groth-Sahai proofs systems [17] .  ...  Our scheme is on-line and truly anonymous without a trusted third party.  ...  proofs and the one-more discrete logarithm assumption.  ... 
doi:10.14257/ijmue.2014.9.10.16 fatcat:ga4oig6yovfqzct7wj2wonir64

Efficient Proofs of Retrievability with Public Verifiability for Dynamic Cloud Storage [article]

Binanda Sengupta, Sushmita Ruj
2018 arXiv   pre-print
We also analyze security and performance of our scheme.  ...  In this work, we exploit the homomorphic hashing technique to design a publicly verifiable dynamic POR scheme that is more efficient (in terms of bandwidth required between the client and the server) than  ...  Given that the discrete logarithm assumption holds in G q and the underlying digital signature scheme is secure, the dynamic POR scheme described in Section 4 is secure according to Definition 3.  ... 
arXiv:1611.03982v6 fatcat:ysjhouigp5cr7nfijyxg3bqiei
« Previous Showing results 1 — 15 out of 2,165 results