Sciweavers

1562 search results - page 133 / 313
» Mathematics, Cryptology, Security
Sort
View
ASIACRYPT
2008
Springer
13 years 10 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
CRYPTO
2008
Springer
120views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
The Random Oracle Model and the Ideal Cipher Model Are Equivalent
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...
Jean-Sébastien Coron, Jacques Patarin, Yann...
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
13 years 10 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell
PAIRING
2010
Springer
149views Cryptology» more  PAIRING 2010»
13 years 6 months ago
Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement
Abstract. We discuss the relationship between ID-based key agreement protocols, certificateless encryption and ID-based key encapsulation mechanisms. In particular we show how in s...
Dario Fiore, Rosario Gennaro, Nigel P. Smart
CISC
2009
Springer
199views Cryptology» more  CISC 2009»
13 years 6 months ago
Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing
Abstract. Certificateless cryptography introduced by Al-Riyami and Paterson eliminates the key escrow problem inherent in identity based cryptosystems. Even though building practic...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...