Sciweavers

2237 search results - page 65 / 448
» On the Security of Random Sources
Sort
View
144
Voted
ICNP
1998
IEEE
15 years 9 months ago
Evaluating the Overheads of Source-Directed Quality-of-Service Routing
Quality-of-service (QoS) routing satisfiesapplication performance requirements and optimizes network resource usage but effective path-selection schemes require the distribution o...
Anees Shaikh, Jennifer Rexford, Kang G. Shin
EUROCRYPT
2001
Springer
15 years 9 months ago
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
Mireille Fouquet, Pierrick Gaudry, Robert Harley
TIFS
2008
133views more  TIFS 2008»
15 years 4 months ago
Kerckhoffs-Based Embedding Security Classes for WOA Data Hiding
Abstract-- It has recently been discovered that using pseudorandom sequences as carriers in spread-spectrum techniques for data-hiding is not at all a sufficient condition for ensu...
François Cayre, Patrick Bas
CTRSA
2001
Springer
129views Cryptology» more  CTRSA 2001»
15 years 9 months ago
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
The Pintsov-Vanstone signature scheme with partial message recovery (PVSSR) is a variant of the Schnorr and Nyberg-Rueppel signature schemes. It produces very short signatures on ...
Daniel R. L. Brown, Donald Byron Johnson
EUROCRYPT
1994
Springer
15 years 9 months ago
Designated Confirmer Signatures
Abstract. We construct the first O(1)-size designated confirmer signatures (DCS) with security in the state-of-the-art model of Camenisch and Michels, Eurocrypt 2000, without rando...
David Chaum