2601 search results - page 103 / 521 » Secure Rewarding Schemes |
138
click to vote
FSE
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. This paper addresses the security of symmetric cryptosystems in the blockwise adversarial model. At Crypto 2002, Joux, Martinet and Valette have proposed a new kind of at...
101
click to vote
AMC
2005
15 years 2 months ago
2005
Recently, Lee and Yang proposed a subliminal scheme which employs an access control in a hierarchy. In their scheme, chief users use a one-way hash function to compute their subord...
131
click to vote
ASIACRYPT
2008
Springer
15 years 5 months ago
2008
Springer
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...
119
click to vote
CCS
2007
ACM
15 years 9 months ago
2007
ACM
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
117
click to vote
ASIACRYPT
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Semantic security against chosen-ciphertext attacks (INDCCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is o...