Time Capsule Signature, first formalized by Dodis and Yum in Financial Cryptography 2005, is a digital signature scheme which allows a signature to bear a (future) time t so that the signature will only be valid at time t or later, when a trusted third party called time server releases time-dependent information for checking the validity of a time capsule signature. Also, the actual signer of a...

We prove that the finite representation property holds for representation by partial functions for the signature consisting of composition, intersection, antidomain and range. It follows that the finite representation property holds for any expansion of this signature with the fixset, preferential union, maximum iterate and opposite operators. The proof shows that for all these signatures the s...

A sanitizable signature scheme is a signature scheme which, after the signer generates a valid signature of a message, allows a specific entity (sanitizer) to modify the message for hiding several parts. Existing sanitizable signature schemes require the message to be divided into pre-defined blocks before signing so that each block can be sanitized independently. However, there are cases where...

This paper discusses signature caching strategies to reduce power consumption for wireless broadcast and filtering services. The two-level signature scheme is used for indexing the information frames. A signature is considered as the basic caching entity in this paper. Four caching policies are compared in terms of tune-in time and access time. With reasonable access time delay, all of the cach...

Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first scheme that considers real-world threats and that is more realistic for remote elections. Their scheme, though, has quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has linear work factor. In this paper we first show that the Smith’s...

We propose an improved BIST architecture which supports on-chip comparison of signatures at no significant increase in area. The BILBO-based BIST architecture, used popularly in application-specific integrated circuits, suffers from two disadvantages. First, the initialization of the BILBO registers and the scanning out of the signatures are slow processes due to the sequential nature of these ...

Assuming P<GI<NP, the creation and verification of a digital signature of an arbitrary RDF graph cannot be done in polynomial time. However, it is possible to define a large class of canonicalizable RDF graphs, such that digital signatures for graphs in this class can be created and verified in O(nlog(n)). Without changing its meaning, an arbitrary RDF graph can be nondeterministically pre-cano...

An oo-line electronic coin system is presented that ooers multi-party security and unconditional privacy of payments. The system improves signiicantly on the eeciency of the previously most eecient such system known in the literature, due to application of a recently proposed technique called secret-key certiicates. By deenition of secret-key certiicates, pairs consisting of a public key and a ...

In this paper, we present two schemes for embedding multiple subliminal messages into one-time signature schemes (OTSSs) proposed by Lamport (1971, 1981) [35,36]. Our schemes have the advantage that the subliminal receivers cannot forge a valid signature since they do not share the signer’s secret key. Our schemes can also providemore than one independent subliminal message, and the numbers of ...

Signature files and inverted files are well-known index structures. In this paper we undertake a direct comparison of the two for searching for partially-specified queries in a large lexicon stored in main memory. Using n-grams to index lexicon terms, a bit-sliced signature file can be compressed to a smaller size than an inverted file if each n-gram sets only one bit in the term signature. Wit...