Sciweavers

204 search results - page 27 / 41
» Provably Secure Metering Scheme
Sort
View
114
Voted
PKC
2004
Springer
106views Cryptology» more  PKC 2004»
15 years 6 months ago
On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?
In a practical system, a message is often encrypted more than once by different encryptions, here called multiple encryption, to enhance its security. Additionally, new features ...
Rui Zhang 0002, Goichiro Hanaoka, Junji Shikata, H...
CCS
2009
ACM
16 years 1 months ago
A generic construction of useful client puzzles
Denial of Service (DoS) attacks are serious threats for network societies. For dealing with DoS attacks, Jakobsson and Juels first proposed the notion of useful client puzzles (UC...
Rui Zhang 0002, Goichiro Hanaoka, Hideki Imai
ASIACRYPT
2009
Springer
15 years 7 months ago
Group Encryption: Non-interactive Realization in the Standard Model
Group encryption (GE) schemes, introduced at Asiacrypt’07, are an encryption analogue of group signatures with a number of interesting applications. They allow a sender to encryp...
Julien Cathalo, Benoît Libert, Moti Yung
97
Voted
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
15 years 6 months ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin
CHES
2011
Springer
240views Cryptology» more  CHES 2011»
14 years 19 days ago
Lightweight and Secure PUF Key Storage Using Limits of Machine Learning
A lightweight and secure key storage scheme using silicon Physical Unclonable Functions (PUFs) is described. To derive stable PUF bits from chip manufacturing variations, a lightwe...
Meng-Day (Mandel) Yu, David M'Raïhi, Richard ...