Sciweavers

386 search results - page 66 / 78
» Practical Security in Public-Key Cryptography
Sort
View
EUROCRYPT
2007
Springer
14 years 2 months ago
Simulatable Adaptive Oblivious Transfer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
Jan Camenisch, Gregory Neven, Abhi Shelat
DAC
2004
ACM
14 years 9 months ago
Security as a new dimension in embedded system design
The growing number of instances of breaches in information security in the last few years has created a compelling case for efforts towards secure electronic systems. Embedded sys...
Srivaths Ravi, Paul C. Kocher, Ruby B. Lee, Gary M...
PKC
2004
Springer
106views Cryptology» more  PKC 2004»
14 years 1 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...
FSE
2007
Springer
105views Cryptology» more  FSE 2007»
14 years 2 months ago
New Bounds for PMAC, TMAC, and XCBC
We provide new security proofs for PMAC, TMAC, and XCBC message authentication modes. The previous security bounds for these modes were σ2 /2n , where n is the block size in bits ...
Kazuhiko Minematsu, Toshiyasu Matsushima
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
14 years 1 months ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay