1,821 Hits in 5.3 sec

Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code [chapter]

Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hideki Imai
2002 Lecture Notes in Computer Science  
The focus of this paper is on methods for reducing memory requirements of unconditionally secure digital signatures.  ...  A major contribution of this paper is to propose two novel unconditionally secure digital signature schemes that have significantly shortened secret information for users.  ...  Two Novel Methods for Constructing Efficient and Unconditionally Secure Digital Signatures In this section, we show two constructions of unconditionally secure digital signature schemes, which are called  ... 
doi:10.1007/3-540-45664-3_5 fatcat:dldvl424ifbu5pxenluodbmwuq

Quantum signature scheme with single photons

Jian Wang, Quan Zhang, Chao-jing Tang
2006 Optoelectronics Letters  
Quantum digital signature combines quantum theory with classical digital signature. The main goal of this field is to take advantage of quantum effects to provide unconditionally secure signature.  ...  The efficiency analysis shows that the proposed scheme is an efficient scheme.  ...  Because classical digital signature is not unconditionally secure, some quantum signature schemes are proposed in recent years [1, 2, 8, 9, 10] .  ... 
doi:10.1007/bf03033549 fatcat:dtw7ih25hzbonprdi2aoijshrq

Towards a Framework for Supporting Unconditionally Secure Authentication Services within E-Government Infrastructures

Sufyan Al-Janabi
2016 Journal of University of Human Development  
The aim of this work is to show the importance and validation of including unconditionally secure authentication services within e-government infrastructures.  ...  One important category of cryptographic primitives that needs to be considered in this respect is the unconditionally secure message authentication codes (or A-codes).  ...  This efficiency can be further enhanced with supporting certain arithmetic types such as single-precision arithmetic [29] .  Unconditionally-secure digital signatures: These digital signature schemes  ... 
doi:10.21928/juhd.20160203.24 fatcat:gwpyir5dabgrrgrpkw4z5fyobu

How to Make Efficient Fail-stop Signatures [chapter]

Eugène van Heyst, Torben Pryds Pedersen
1993 Lecture Notes in Computer Science  
Furthermore a construction is shown of an undeniable signature scheme, which is unconditionally secure for thc signer, and which allows the signer LO convert undeniable signnturcs into fail-stop signatures  ...  FA-stop signaturcs (introduced in [WP89]) have the very nice property that the signer is secure against unlimited powerful forgers.  ...  Acknowledgements We wish to thank Birgit Pfitzmann for many discussions about fail-stop signatures and her comments to this paper.  ... 
doi:10.1007/3-540-47555-9_30 fatcat:icuheuc75vaavlxvz4az4u6u2y

Unconditionally Secure Digital Signature Schemes Admitting Transferability [chapter]

Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hideki Imai
2000 Lecture Notes in Computer Science  
Our scheme represents the first unconditionally secure signature that admits provably secure transfer of signatures.  ...  More specifically, we establish a model for unconditionally secure digital signatures in a group, and demonstrate practical schemes in that model.  ...  As a by-product, we note that our unconditionally secure digital signature scheme can be used as an A 3 -code and also as a DMRA.  ... 
doi:10.1007/3-540-44448-3_11 fatcat:5fjky6hchfdfzbruvwmmasjenu

New Constructions of Fail-Stop Signatures and Lower Bounds [chapter]

Eugène van Heijst, Torben Pryds Pedersen, Birgit Pfitzmann
1993 Lecture Notes in Computer Science  
Finally, we prove that with unconditionally secure signatures, like those presented by Chaum and Roijakkers at Crypto '90, the length of a signature is at least linear in the number of participants who  ...  This shows that such schemes cannot be as efficient as fail-stop signatures. CWI. h s l a a n 413, NL-1098 SJ Amsterdam  ...  Finally, we show that unconditionally secure signatures cannot be as efficient as fail-stop signatures: The entropy (and thus the length) of each unconditionally secure signature that can be tested by  ... 
doi:10.1007/3-540-48071-4_2 fatcat:4rjakojx3rg2lp55cvq7jcawwa

Security Notions for Unconditionally Secure Signature Schemes [chapter]

Junji Shikata, Goichiro Hanaoka, Yuliang Zheng, Hideki Imai
2002 Lecture Notes in Computer Science  
those for unconditionally secure authentication and signature schemes known to date.  ...  This paper focuses on notions for the security of digital signature schemes whose resistance against forgery is not dependent on unproven computational assumptions.  ...  A major contribution of this research is to establish a strong security notion for all digital signature schemes including unconditionally secure ones.  ... 
doi:10.1007/3-540-46035-7_29 fatcat:omerzpchybal3nfpoe2a4jwwgy

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

David Chaum, Eugène van Heijst, Birgit Pfitzmann
1992 Lecture Notes in Computer Science  
On the other hand, in many cases they are more efficient than previous signature schemes unconditionally secure for the signer.  ...  We present the first undeniable signature schemes where signers are unconditionally secure.  ...  Now, if one party uses signatures unconditionally secure for the signer, and the other party conventional ones, the former party is unconditionally secure.  ... 
doi:10.1007/3-540-46766-1_38 fatcat:mqw3kj7hr5hzzdxvjezntnwwma

Securing Vehicle Communication Systems by the KLJN Key Exchange Protocol

Y. Saez, X. Cao, L. B. Kish, G. Pesti
2014 Fluctuation and Noise Letters  
We also propose a novel unconditionally secure vehicular communication architecture that utilizes the Kirchhoff-law-Johnson-noise (KLJN) key distribution scheme.  ...  We review the security requirements for vehicular communication networks and provide a critical assessment of some typical communication security solutions.  ...  keys and certificates and to perform authentication-related operations such as digital signatures and signatures verifications.  ... 
doi:10.1142/s0219477514500205 fatcat:hw6bj7w6qnehlcgtczayiqs5zq

Signing Perfect Currency Bonds [article]

Subhayan Roy Moulick, Prasanta K. Panigrahi
2015 arXiv   pre-print
We formally define a Quantum Cheque and present the first Unconditionally Secure Quantum Cheque Scheme and show it to be secure against any no-signaling adversary.  ...  Here, we do not discuss explicit constructions of digital signatures in detail, and instead use an unconditionally secure digital signature scheme, Π = (Gen, Sign, V rf y) as a black box.  ...  Suitable constructions of an unconditionally secure classical digital signature using multivariate polynomials have been proposed by Hanoka et al.  ... 
arXiv:1505.05251v2 fatcat:oeqmrkwr2rh4rcubpe66scl5ae

Non-degrading Erasure-Tolerant Information Authentication with an Application to Multicast Stream Authentication over Lossy Channels [chapter]

Yvo Desmedt, Goce Jakimoski
2006 Lecture Notes in Computer Science  
We also discuss efficient implementations and propose a provably secure stream authentication scheme that makes use of erasure-tolerant authentication codes.  ...  The concept of erasure-tolerant information authentication was recently introduced to study an unconditionally secure setting where it is allowed to lose a limited number of message letters during transmission  ...  An erasuretolerant digital signature scheme is considered unforgeable (secure) if there is no efficient adversary that can produce a forgery with non-negligible probability.  ... 
doi:10.1007/11967668_21 fatcat:rhj5g47dojc35peq445uao4bfy

Unconditionally secure digital signatures implemented in an 8-user quantum network [article]

Yoann Pelet, Ittoop Vergheese Puthoor, Natarajan Venkatachalam, Sören Wengerowsky, Martin Lončarić, Sebastian Philipp Neumann, Bo Liu, Željko Samec, Mario Stipčević, Rupert Ursin, Erika Andersson, John G. Rarity (+2 others)
2022 arXiv   pre-print
Here we present an experimental demonstration of an unconditionally secure digital signature (USS) protocol implemented for the first time, to the best of our knowledge, on a fully connected quantum network  ...  We show the feasibility of unconditionally secure signatures using only bi-partite entangled states distributed throughout the network and experimentally evaluate the performance of the protocol in real  ...  We would like to thank Thomas Scheidl for help with the software used to run the original experiment and Mohsen Razavi & Guillermo Currás Lorenzo for their help proving the security of the implementation  ... 
arXiv:2202.04641v2 fatcat:yjs5awziszhtdfkuo65fh2rsqe

On the Existence of Quantum Signature for Quantum Messages

Qin Li, Wai Hong Chan, Chunhui Wu, Zhonghua Wen
2013 International Journal of Theoretical Physics  
Quantum signature (QS) is used to authenticate the identity of the originator, ensure data integrity and provide non-repudiation service with unconditional security.  ...  However, all of the existing classical (digital) signature schemes whose security depends on the difficulty of solving some hard mathematical problems were threatened by last-increasing power of computers  ...  As Rivest predicted, digital signature may become one of the most fundamental and useful inventions of modern cryptography [3] .  ... 
doi:10.1007/s10773-013-1751-8 fatcat:wspmdbc2sfdm7hmnxpt2qy7otm

Arbitrated quantum signature schemes without using entangled states [article]

Xiangfu Zou, Daowen Qiu
2010 arXiv   pre-print
A digital signature is a mathematical scheme for demonstrating the authenticity of a digital message or document.  ...  ; and, it provides a higher efficiency in transmission and reduces the complexity of implementation.  ...  However, this is impossible due to the unconditionally secure quantum key distribution. Besides, the use of quantum one-time pad algorithm enhances the security. Thus, Bob cannot get the correct | ⟩.  ... 
arXiv:1003.2337v1 fatcat:uvo4tqdfmzbfhgocilrx3p7wly

Fail-Stop Signatures

Torben Pryds Pedersen, Birgit Pfitzmann
1997 SIAM journal on computing (Print)  
This type of security is strictly stronger than that achievable with ordinary digital signatures as introduced by Diffie and Hellman in 1976 and formally defined by Goldwasser, Micali, and Rivest in 1988  ...  They are efficient enough to be used in practice. Next, we prove lower bounds on the efficiency of any fail-stop signature scheme.  ...  Every secure fail-stop signature scheme can be used to construct an (equally efficient) secure digital signature scheme in the sense of [20] . Proof.  ... 
doi:10.1137/s009753979324557x fatcat:tc6q6nnbj5hbnnwujwkyj6drrq
« Previous Showing results 1 — 15 out of 1,821 results