A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Filters
Generic security-amplifying methods of ordinary digital signatures
2012
Information Sciences
Digital signatures are one of the most fundamental primitives in cryptography. ...
In the first paradigm, based on a weakly-secure signature scheme, the construction of a fully-secure signature scheme requires one-time signature additionally. ...
Acknowledgements This work is partially supported by the National Natural Science Foundation of China (No. 61100224) and Foundation for Distinguished Young Talents in Higher Education of Guangdong, China ...
doi:10.1016/j.ins.2012.03.006
fatcat:ggpf4bntifdmhen7lp5xl633oe
Generic Security-Amplifying Methods of Ordinary Digital Signatures
[chapter]
Applied Cryptography and Network Security
The new transformations from a weakly-secure signature scheme to fully-secure signature scheme are generic, simple, and provably secure in the standard model. ...
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), from any signatures satisfy ...
Acknowledgements This work was partially supported by the 2nd stage of Brain Korea 21 Project sponsored by the Ministry of Education and Human Resources Development, Korea. ...
doi:10.1007/978-3-540-68914-0_14
dblp:conf/acns/LiKZW08
fatcat:3ydm7s4aqrhqrgustb5z5uciwq
Bi-serial DNA Encryption Algorithm(BDEA)
[article]
2011
arXiv
pre-print
DNA cryptography is a emerging field of cryptography. ...
Data treatment is used to transform the plain text into cipher text which provides excellent security ...
The vast parallelism and extra ordinary information density inherent in DNA molecules are explored for cryptographic purpose such as encryption, authentication, and signature and so on. ...
arXiv:1101.2577v1
fatcat:hxtc3uhl3jcffizclow4cs2xnm
PCA: Jini-based Personal Card Assistant
[chapter]
1999
Lecture Notes in Computer Science
We describe how such an approach can be used for creating digital signatures: in particular, we can circumvent the problems involved with untrusted document viewers in this context. ...
We consider what sort of network infrastructure is required for using the PCA and outline how Jini can be used for integrating the PDA and smartcards into unknown service networks a mobile user is confronted ...
Klaus Huber for useful comments and suggestions on an earlier version of this paper. ...
doi:10.1007/3-540-46701-7_5
fatcat:uapchfyoe5bovpsp7eojk3ifsy
Print signatures for document authentication
2003
Proceedings of the 10th ACM conference on Computer and communication security - CCS '03
We present theoretical and experimental details on how to register as well as authenticate this print signature. The security analysis of this technique is also presented. ...
We finally provide experimental results to demonstrate the feasibility of the proposed method. ...
A digital signature is then generated for the identifier. The digital signature and the identifier are printed onto the same document using digital encoding methods such as bar codes or OCR fonts. ...
doi:10.1145/948129.948131
fatcat:62hl4sxufzcgtenb5f7npcmntm
Print signatures for document authentication
2003
Proceedings of the 10th ACM conference on Computer and communication security - CCS '03
We present theoretical and experimental details on how to register as well as authenticate this print signature. The security analysis of this technique is also presented. ...
We finally provide experimental results to demonstrate the feasibility of the proposed method. ...
A digital signature is then generated for the identifier. The digital signature and the identifier are printed onto the same document using digital encoding methods such as bar codes or OCR fonts. ...
doi:10.1145/948109.948131
dblp:conf/ccs/ZhuWK03
fatcat:bbpc3afqdvbefdu5bodv7msyje
An Elliptic-Curve-Based Hierarchical Cluster Key Management in Wireless Sensor Network
[chapter]
2013
Advances in Intelligent Systems and Computing
The proposed work uses digital signature scheme and encryptiondecryption mechanisms using elliptic curve cryptography(ECC). ...
Hence, security is a measure concern in WSN. Moreover, the limited energy, memory and computation capability of sensor nodes, lead to difficulty in implementing security mechanisms effectively. ...
In the above discussed methods we found that, authors concentrate on security and leave behind key generation time. ...
doi:10.1007/978-81-322-1665-0_38
fatcat:p7nf5hmb7zgujl6zbgxqes3j7y
Quantum Money from Hidden Subspaces
[article]
2012
arXiv
pre-print
Our security proofs use a new variant of Ambainis's quantum adversary method, and several other tools that might be of independent interest. ...
A main technical advance is to show that the "black-box" version of our scheme, where the polynomials are replaced by classical oracles, is unconditionally secure. ...
A (classical, public-key) digital signature scheme D consists of three probabilistic polynomial-time classical algorithms: • KeyGen, which takes as input a security parameter 0 n , and generates a key ...
arXiv:1203.4740v3
fatcat:4wsocmibvnh73l7td5pz7tlz6e
Design and Development of E-Passports Using Biometric Access Control System
2012
International Journal of Advanced Smart Sensor Network Systems
The specific choice of each country as to biometric security features to include makes a major difference in the level of security and privacy protection. ...
In its simplest form an electronic passport contains just a collection of read-only files, more advanced variants can include sophisticated cryptographic mechanisms protecting security of the document ...
Background of the Study Ordinary passport (Tourist passport, Regular passport, Passport). Issued to citizens and other nationals, and generally the most-issued type of passport. ...
doi:10.5121/ijassn.2012.2306
fatcat:lipmwtqpsbdzhgaqqquzlfuwaq
Cryptographic Authentication of Navigation Protocols
[article]
2005
arXiv
pre-print
We examine the security of existing radio navigation protocols and attempt to define secure, scalable replacements. ...
Running two verifications and a signature for a reasonablysecure digital signature algorithm takes several milliseconds on modern general-purpose microprocessors. ...
Any secure voice protocol will need to use a digitized voice signal, strongly bind the voice content to a timestamped signature, and provide a key-agreement method. These are well-solved problems. ...
arXiv:cs/0510022v1
fatcat:dzemly7445e3fen3rx4l7mzjgu
Strong Key-Insulated Signature Schemes
[chapter]
2002
Lecture Notes in Computer Science
First, we demonstrate a generic construction of a strong (N − 1, N) -key-insulated signature scheme using any standard signature scheme. ...
We then give a construction of a strong (t, N )-signature scheme whose security may be based on the discrete logarithm assumption in the random oracle model. ...
any of the remaining N − t periods; we elaborate for the specific case of digital signatures below. ...
doi:10.1007/3-540-36288-6_10
fatcat:rvsmqwgy6zgm3cxeocep4rs63u
Quantum money from hidden subspaces
2012
Proceedings of the 44th symposium on Theory of Computing - STOC '12
Our security proofs use a new variant of Ambainis's quantum adversary method, and several other tools that might be of independent interest. * MIT. . 1 The recent Bitcoin system is an interesting illustration ...
A main technical advance is to show that the "black-box" version of our scheme, where the polynomials are replaced by classical oracles, is unconditionally secure. ...
Foremost among these is a digital signature scheme secure against quantum chosen-message attacks. ...
doi:10.1145/2213977.2213983
dblp:conf/stoc/AaronsonC12
fatcat:km75up2etfa77go2a4yksa5im4
On the Security of Joint Signature and Encryption
[chapter]
2002
Lecture Notes in Computer Science
We then examine generic sequential composition methods of building signcryption from a signature and encryption scheme. ...
We suggest a natural and very slight relaxation of CCA2-security, which we call generalized CCA2-security (gCCA2). ...
We note that the conventional notion of digital signatures supports non-repudiation. ...
doi:10.1007/3-540-46035-7_6
fatcat:qiv7dnmeqjbjteuhvt6qbbqtje
Generation of an EDS Key Based on a Graphic Image of a Subject's Face Using the RC4 Algorithm
2021
Information
The test results of the random value generator show a satisfactory level of randomness, i.e., an average of 0.47 random generation (NIST test), with 95% accuracy of the system as a whole. ...
However, the closeness of the sequence generated by such a generator to a truly random one is questionable. ...
Over the course of our research, a Python application was developed that is capable of generating a key pair for subsequent use in digital signatures based on images of the subject's face, creating a digital ...
doi:10.3390/info12010019
fatcat:6nciil3z6bbhzpyiaovy553v2a
A Taxonomy Study on Securing Blockchain-based Industrial Applications: An Overview, Application Perspectives, Requirements, Attacks, Countermeasures, and Open Issues
[article]
2021
arXiv
pre-print
We also analyse and provide the classification of different security and privacy techniques used in these applications to enhance the advancement of security features. ...
application, security and privacy challenges, and requirements of Blockchain-based industrial applications, along with possible security threats and countermeasures. ...
. • Elliptic Curve Digital Signature Algorithm (ECDSA): This algorithm combines the elliptic curve cryptography and digital signature algorithms to generate the signature of data contents. ...
arXiv:2105.11665v1
fatcat:bsm7w2shjneajp425oddszr6ju
« Previous
Showing results 1 — 15 out of 3,295 results