Sciweavers

222 search results - page 5 / 45
» How to Forget a Secret
Sort
View
IJISEC
2010
87views more  IJISEC 2010»
14 years 8 months ago
How to construct identity-based signatures without the key escrow problem
The inherent key escrow problem is one of the main reasons for the slow adoption of identity-based cryptography. The existing solution for mitigating the key escrow problem is by a...
Tsz Hon Yuen, Willy Susilo, Yi Mu
CSFW
2012
IEEE
13 years 14 days ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...
CANS
2008
Springer
111views Cryptology» more  CANS 2008»
15 years 23 hour ago
Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...
Tiancheng Lou, Christophe Tartary
ACNS
2003
Springer
130views Cryptology» more  ACNS 2003»
15 years 3 months ago
Generalized Key-Evolving Signature Schemes or How to Foil an Armed Adversary
Key exposures, known or inconspicuous, are a real security threat. Recovery mechanisms from such exposures are required. For digital signatures such a recovery should ideally —an...
Gene Itkis, Peng Xie
JLP
2007
98views more  JLP 2007»
14 years 10 months ago
Tempus fugit: How to plug it
Secret or private information may be leaked to an external attacker through the timing behaviour of the system running the untrusted code. After introducing a formalisation of thi...
Alessandra Di Pierro, Chris Hankin, Igor Siveroni,...