Sciweavers

341 search results - page 5 / 69
» Paired bondage in trees
Sort
View
ACISP
2005
Springer
14 years 3 months ago
Dynamic Group Key Agreement in Tree-Based Setting
We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We p...
Ratna Dutta, Rana Barua
FUN
2007
Springer
91views Algorithms» more  FUN 2007»
14 years 4 months ago
High Spies (or How to Win a Programming Contest)
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
André H. Deutz, Rudy van Vliet, Hendrik Jan...
DM
1999
122views more  DM 1999»
13 years 9 months ago
Parking functions, valet functions and priority queues
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
Julian D. Gilbey, Louis H. Kalikow
IANDC
2011
148views more  IANDC 2011»
13 years 4 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
EUROCRYPT
2010
Springer
14 years 2 months ago
Bonsai Trees, or How to Delegate a Lattice Basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to resolve some important open problems in the area. Applications of bonsai trees include...
David Cash, Dennis Hofheinz, Eike Kiltz, Chris Pei...