46 search results - page 4 / 10 » crypto 2005 |
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
AMC
2005
13 years 7 months ago
2005
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public stri...