Results 251 to 260 of about 2,249,719 (290)
Some of the next articles are maybe not open access.
Nominative Signature from Ring Signature
2007Since 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 +1 more source
On the Signature Trees and Balanced Signature Trees
21st International Conference on Data Engineering (ICDE'05), 2005Advanced 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 +1 more source
Ring Signature Based on ElGamal Signature
2006Ring 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
Certificateless signature and blind signature
Journal of Electronics (China), 2008Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson. It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-based Public Key Cryptography (ID-PKC).
Lei Zhang, Futai Zhang
openaire +1 more source
On Signatures and Authentication
1983The 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
Signature Disguise or Signature Forgery?
Journal of the Forensic Science Society, 1986Abstract Signature identification and the questions of disguise, forgery and genuineness account for a significant proportion of a document examiner's case load. It is also one of the most demanding fields of document examination. To gather and evaluate a body of controlled data on the likely methods of producing disguised and forged signatures, 144 ...
openaire +1 more source
2016
When compiling Embedded Domain Specific Languages EDSLs into other languages, the compiler translates types in the source language into corresponding types in the target language. The translation is often driven by a small set of rules that map a single type in the source language into a single type in the target language.
Anders Persson, Emil Axelsson
openaire +1 more source
When compiling Embedded Domain Specific Languages EDSLs into other languages, the compiler translates types in the source language into corresponding types in the target language. The translation is often driven by a small set of rules that map a single type in the source language into a single type in the target language.
Anders Persson, Emil Axelsson
openaire +1 more source
2016
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 +2 more sources
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 +2 more sources