Sciweavers

1282 search results - page 100 / 257
» Signing on signing off
Sort
View
161
Voted
PKC
2012
Springer
212views Cryptology» more  PKC 2012»
13 years 8 months ago
Security of Blind Signatures Revisited
We revisit the definition of unforgeability of blind signatures as proposed by Pointcheval and Stern (Journal of Cryptology 2000). Surprisingly, we show that this established deļ¬...
Dominique Schröder, Dominique Unruh

Tutorial
5367views
17 years 5 months ago
An overview of the implementation of Level Set methods, including the use of the Narrow Band Method
An easy to follow tutorial that covers the implementation details of the Narrow Band Level Set Method. It also covers the numerical approximation for PDEs governing different types...
Jonas Larsen, Thomas Greve Kristensen
ICC
2007
IEEE
133views Communications» more  ICC 2007»
16 years 12 days ago
Blocking Unsolicited Voice Calls Using Decoys for the IMS
Abstract— Spam has been a serious problem for email causing frustration and annoyances to customers. This problem is growing at a fast rate with no signs of abating. Another form...
S. M. Akramus Salehin, Neco Ventura
ACNS
2007
Springer
112views Cryptology» more  ACNS 2007»
16 years 8 days ago
Merkle Signatures with Virtually Unlimited Signature Capacity
We propose GMSS, a new variant of the Merkle signature scheme. GMSS is the first Merkle-type signature scheme that allows a cryptographically unlimited (280 ) number of documents ...
Johannes Buchmann, Erik Dahmen, Elena Klintsevich,...
165
Voted
ISNN
2005
Springer
15 years 11 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu