Sciweavers

50 search results - page 6 / 10
» Constructive Notions of Maximality for Ideals
Sort
View
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
15 years 1 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
ICPR
2000
IEEE
15 years 10 months ago
Attributed Tree Homomorphism Using Association Graphs
The matching of hierarchical relational structures is of significant interest in computer vision and pattern recognition. We have recently introduced a new solution to this proble...
Massimo Bartoli, Marcello Pelillo, Kaleem Siddiqi,...
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 7 months ago
Balanced Interval Coloring
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
Antonios Antoniadis, Falk Hüffner, Pascal Len...
PKC
2007
Springer
189views Cryptology» more  PKC 2007»
15 years 3 months ago
Parallel Key-Insulated Public Key Encryption Without Random Oracles
Abstract. Key-insulated cryptography is a crucial technique for protecting private keys. To strengthen the security of key-insulated protocols, Hanaoka, Hanaoka and Imai recently i...
Benoît Libert, Jean-Jacques Quisquater, Moti...
PODC
2010
ACM
14 years 11 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya