Sciweavers

657 search results - page 14 / 132
» A Version Numbering Scheme with a Useful Lexicographical Ord...
Sort
View
CTRSA
2001
Springer
120views Cryptology» more  CTRSA 2001»
13 years 12 months ago
Forward-Secure Threshold Signature Schemes
We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remain...
Michel Abdalla, Sara K. Miner, Chanathip Namprempr...
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 7 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 2 months ago
Block Detection of Multiple Symbol DPSK in a Statistically Unknown Time-Varying Channel
—We present a detection scheme for multiple-symbol DPSK for use in a statistically unknown time-varying channel. The scheme relies on a parametric representation of the timevaryi...
Nathan Ricklin, James R. Zeidler
RSA
2011
92views more  RSA 2011»
13 years 2 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
Wesley Pegden
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
13 years 10 months ago
Construction of Subdivision Surfaces by Fourth-Order Geometric Flows with G1 Boundary Conditions
In this paper, we present a method for constructing Loop’s subdivision surface patches with given G1 boundary conditions and a given topology of control polygon of the subdivisi...
Guoliang Xu, Qing Pan