Sciweavers

215 search results - page 23 / 43
» Efficient Identity-Based Signatures Secure in the Standard M...
Sort
View
ASIACRYPT
2008
Springer
14 years 11 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
94
Voted
SCN
2008
Springer
142views Communications» more  SCN 2008»
14 years 9 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
15 years 3 months ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
ITIIS
2010
200views more  ITIIS 2010»
14 years 4 months ago
New Techniques for Anonymous HIBE with Short Ciphertexts in Prime Order Groups
Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key...
Kwangsu Lee, Dong Hoon Lee
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
15 years 3 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