Sciweavers

MST
2006
97views more  MST 2006»
14 years 13 days ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi
CTRSA
2008
Springer
113views Cryptology» more  CTRSA 2008»
14 years 2 months ago
Aggregate Message Authentication Codes
We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on ...
Jonathan Katz, Andrew Y. Lindell