Results 261 to 270 of about 835,228 (309)
Some of the next articles are maybe not open access.

Classification of signature-only signature models

Science in China Series F: Information Sciences, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhengjun Cao, Mulan Liu
openaire   +1 more source

Security Arguments for Digital Signatures and Blind Signatures

Journal of Cryptology, 2000
This paper proves the security of a large class of signature schemes in the so-called random oracle model. This model assumes that the hash function used in a signature scheme behaves as a random function. However, it has been shown that there exist (contrived) schemes that are provably secure in the random oracle model, but not when used with a real ...
David Pointcheval, Jacques Stern
openaire   +2 more sources

Nominative Signature from Ring Signature

2007
Since the introduction of nominative signature (NS) in 1996, there have been a handful of schemes proposed and almost all of them have been found flawed. The only one which is secure requires multiround of communications between the nominator and the nominee for signature generation. In this paper, we propose a novel construction which is efficient and
Dennis Y. W. Liu   +3 more
openaire   +2 more sources

Ring Signature Based on ElGamal Signature

2006
Ring signature was first introduced by Rivest, Shamir and Tanman in 2001. In a ring signature, instead of revealing the actual identity of the message signer, it specifies a set of possible signers. The verifier can be convinced that the signature was indeed generated by one of the ring members, however, he is unable to tell which member actually ...
Jian Ren 0001, Lein Harn
openaire   +1 more source

A Signature Complexity Measure to Select Reference Signatures for Online Signature Verification

2015 International Conference of the Biometrics Special Interest Group (BIOSIG), 2015
This paper presents an original procedure for selecting the reference online signature instances of a writer, an important issue for any effective signature verifier. To this end, for each signature instance, we propose a novel complexity measure, by exploiting a global description of signatures in the frequency domain as well as a global statistical ...
Christian Kahindo   +2 more
openaire   +1 more source

On the Signature Trees and Balanced Signature Trees

21st International Conference on Data Engineering (ICDE'05), 2005
Advanced database application areas, such as computer aided design, office automation, digital libraries, data-mining as well as hypertext and multimedia systems need to handle complex data structures with set-valued attributes, which can be represented as bit strings, called signatures.
openaire   +2 more sources

On Signatures and Authentication

1983
The design of cryptographic protocols using trapdoor and one-way functions has received considerable attention in the past few years [1–8]. More recently, attention has been paid to provide rigorous correctness proofs based on simple mathematical assumptions, for example, in coin flipping (Blum [1]), mental poker (Goldwasser and Micali [4]).
Shafi Goldwasser   +2 more
openaire   +1 more source

Signatures on a ring

Mathematical Journal of Okayama University, 1992
If \(R\) is a ring with an identity and \(F\) is a field-like semigroup (i.e., a commutative semigroup with an identity element and a zero element such that \(F \backslash \{0\}\) is a group with a unique element \(-1\) of order 2) then a signature of \(R\) over \(F\) is a mapping \(\sigma : R \to F\) such that \(\sigma (-2) = - 1\), \(\sigma (ab ...
openaire   +3 more sources

A Signature

American Journal of Kidney Diseases, 2014
openaire   +2 more sources

Home - About - Disclaimer - Privacy