Sciweavers

2492 search results - page 16 / 499
» On the General Signature Trees
Sort
View
FC
2004
Springer
120views Cryptology» more  FC 2004»
14 years 28 days ago
Identity-Based Chameleon Hash and Applications
Chameleon signatures are non-interactive signatures based on a hash-and-sign paradigm, and similar in efficiency to regular signatures. The distinguishing characteristic of chamel...
Giuseppe Ateniese, Breno de Medeiros
CCS
2006
ACM
13 years 11 months ago
Multi-signatures in the plain public-Key model and a general forking lemma
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. However, existing schemes impose key s...
Mihir Bellare, Gregory Neven
PC
2006
103views Management» more  PC 2006»
13 years 7 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
IANDC
2008
101views more  IANDC 2008»
13 years 7 months ago
Trees with exponentially growing costs
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
Frank Schulz
JUCS
2006
126views more  JUCS 2006»
13 years 7 months ago
Behavioral Institutions and Refinements in Generalized Hidden Logics
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
Manuel A. Martins