Sciweavers

608 search results - page 17 / 122
» Interactive Oracle Proofs
Sort
View
ASIACRYPT
2003
Springer
15 years 8 months ago
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
Tatsuaki Okamoto, Jacques Stern
ASIACRYPT
2008
Springer
15 years 5 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
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
14 years 10 months ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
IMA
2005
Springer
126views Cryptology» more  IMA 2005»
15 years 8 months ago
Security Proof of Sakai-Kasahara's Identity-Based Encryption Scheme
Abstract. Identity-based encryption (IBE) is a special asymmetric encryption method where a public encryption key can be an arbitrary identifier and the corresponding private decr...
Liqun Chen, Zhaohui Cheng
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
15 years 7 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup