Sciweavers

222 search results - page 3 / 45
» How to Forget a Secret
Sort
View
GECCO
2003
Springer
15 years 3 months ago
Secret Agents Leave Big Footprints: How to Plant a Cryptographic Trapdoor, and Why You Might Not Get Away with It
This paper investigates whether optimisation techniques can be used to evolve artifacts of cryptographic significance which are apparently secure, but which have hidden properties...
John A. Clark, Jeremy L. Jacob, Susan Stepney
DCC
2001
IEEE
15 years 9 months ago
How to Choose Secret Parameters for RSA-Type Cryptosystems over Elliptic Curves
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
Marc Joye, Jean-Jacques Quisquater, Tsuyoshi Takag...
CRYPTO
1995
Springer
100views Cryptology» more  CRYPTO 1995»
15 years 1 months ago
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Amir Herzberg, Stanislaw Jarecki, Hugo Krawczyk, M...
ACNS
2010
Springer
172views Cryptology» more  ACNS 2010»
15 years 1 months ago
Secure Sketch for Multiple Secrets
Secure sketches are useful in extending cryptographic schemes to biometric data since they allow recovery of fuzzy secrets under inevitable noise. In practice, secrets derived from...
Chengfang Fang, Qiming Li, Ee-Chien Chang
FORTE
2010
14 years 11 months ago
Forgetting the Time in Timed Process Algebra
Abstract. In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of syst...
Anton Wijs