Sciweavers

324 search results - page 44 / 65
» A new signature scheme without random oracles
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
EUROCRYPT
2008
Springer
13 years 10 months ago
Towards Key-Dependent Message Security in the Standard Model
Standard security notions for encryption schemes do not guarantee any security if the encrypted messages depend on the secret key. Yet it is exactly the stronger notion of security...
Dennis Hofheinz, Dominique Unruh
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
14 years 2 months ago
Optimistic Fair Exchange in a Multi-user Setting
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum
AMC
2005
147views more  AMC 2005»
13 years 8 months ago
Cryptanalysis of and improvement on the Hwang-Chen multi-proxy multi-signature schemes
Hwang and Chen recently proposed new multi-proxy multi-signature schemes that allow a group of authorized proxy signers to sign messages on behalf of a group of original signers. ...
Yuh-Dauh Lyuu, Ming-Luen Wu
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
14 years 11 days ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...