Sciweavers

45 search results - page 5 / 9
» Security Notions and Generic Constructions for Client Puzzle...
Sort
View
CTRSA
2005
Springer
154views Cryptology» more  CTRSA 2005»
13 years 11 months ago
Fast and Proven Secure Blind Identity-Based Signcryption from Pairings
We present the first blind identity-based signcryption (BIBSC). We formulate its security model and define the security notions of blindness and parallel one-more unforgeability ...
Tsz Hon Yuen, Victor K. Wei
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 6 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
EUROCRYPT
2008
Springer
13 years 7 months ago
Obfuscating Point Functions with Multibit Output
We study obfuscation of point functions with multibit output and other related functions. A point function with multibit output returns a string on a single input point and zero ev...
Ran Canetti, Ronny Ramzi Dakdouk
ASIACRYPT
2009
Springer
14 years 12 days ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
OOPSLA
2009
Springer
14 years 10 days ago
Self type constructors
Bruce and Foster proposed the language LOOJ, an extension of Java with the notion of MyType, which represents the type of a self reference and changes its meaning along with inher...
Chieri Saito, Atsushi Igarashi