Sciweavers

2492 search results - page 18 / 499
» On the General Signature Trees
Sort
View
MYCRYPT
2005
Springer
123views Cryptology» more  MYCRYPT 2005»
14 years 1 months ago
Optimization of the MOVA Undeniable Signature Scheme
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ā€™04 as well as its generalization proposed at ...
Jean Monnerat, Yvonne Anne Oswald, Serge Vaudenay
FOGA
2007
13 years 9 months ago
Saddles and Barrier in Landscapes of Generalized Search Operators
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deļ...
Christoph Flamm, Ivo L. Hofacker, Bärbel M. R...
CGF
1999
86views more  CGF 1999»
13 years 7 months ago
Generalized View-Dependent Simplification
We propose a technique for performing view-dependent geometry and topology simplifications for level-of-detailbased renderings of large models. The algorithm proceeds by preproces...
Jihad El-Sana, Amitabh Varshney
FC
2005
Springer
97views Cryptology» more  FC 2005»
14 years 1 months ago
Time Capsule Signature
Abstract. We introduce a new cryptographic problem called time capsule signature. Time capsule signature is a ā€˜future signatureā€™ that becomes valid from a speciļ¬c future time...
Yevgeniy Dodis, Dae Hyun Yum
EUROCRYPT
2010
Springer
14 years 10 days 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...