Sciweavers

1538 search results - page 161 / 308
» Relative Randomness and Cardinality
Sort
View
CIE
2005
Springer
15 years 11 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
CTRSA
2005
Springer
121views Cryptology» more  CTRSA 2005»
15 years 11 months ago
Time-Selective Convertible Undeniable Signatures
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
Fabien Laguillaumie, Damien Vergnaud
140
Voted
ESA
2005
Springer
161views Algorithms» more  ESA 2005»
15 years 11 months ago
Cache-Oblivious Comparison-Based Algorithms on Multisets
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
Arash Farzan, Paolo Ferragina, Gianni Franceschini...
ICALP
2005
Springer
15 years 11 months ago
Hierarchical Group Signatures
We introduce the notion of hierarchical group signatures. This is a proper generalization of group signatures, which allows multiple group managers organized in a tree with the si...
Mårten Trolin, Douglas Wikström
ISPA
2005
Springer
15 years 11 months ago
ID-Based Proxy Signature Using Bilinear Pairings
Identity-based (ID-based) public key cryptosystem can be a good alternative for certificate-based public key setting, especially when efficient key management and moderate securit...
Jing Xu, Zhenfeng Zhang, Dengguo Feng