JOC
2010
13 years 7 months ago
2010
Let g be an element of prime order p in an abelian group and let Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, the secret key can be computed de...
ICITS
2009
13 years 10 months ago
2009
Abstract. This survey paper studies recent advances in the field of LeakageResilient Cryptography. This booming area is concerned with the design of cryptographic primitives resist...
ACMSE
2009
ACM
13 years 10 months ago
2009
ACM
Proxy re-encryption, abbreviated as PRE, is a cryptosystem which allows the proxy to re-encrypt a cirphertext without accessing the underlying message. The re-encryption protocol ...
PPL
2010
13 years 11 months ago
2010
It has been said that quantum cryptography in general o ers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, ...
TIT
2008
14 years 1 days ago
2008
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
FGCS
2000
14 years 12 days ago
2000
Conventional encryption technology often requires users to protect a secret key by selecting a password or passphrase. While a good passphrase will only be known to the user, it a...
TIFS
2008
14 years 15 days ago
2008
This paper presents a security analysis for data hiding methods based on nested lattice codes, extending the analysis provided by previous works to a more general scenario. The se...
TCS
2008
14 years 15 days ago
2008
Abstract. Cryptographic operations are essential for many security-critical systems. Reasoning about information flow in such systems is challenging because typical (noninterferenc...
IJSN
2006
14 years 17 days ago
2006
: This paper presents a survey of key evolving cryptosystems in the public key setting, focusing on two main approaches: `forward security' and `intrusion resilience'. Th...
CORR
2008
Springer
14 years 20 days ago
2008
Springer
We consider the problem of building robust fuzzy extractors, which allow two parties holding similar random variables W, W to agree on a secret key R in the presence of an active ...