Sciweavers

2967 search results - page 403 / 594
» Cryptology
Sort
View
INDOCRYPT
2005
Springer
15 years 11 months ago
Completion Attacks and Weak Keys of Oleshchuk's Public Key Cryptosystem
This paper revisits a public key cryptosystem which is based on finite string-rewriting systems. We consider a new approach for cryptanalysis of such proposals—the so-called com...
Heiko Stamer
INDOCRYPT
2005
Springer
15 years 11 months ago
A Universally Composable Scheme for Electronic Cash
We propose a scheme for electronic cash based on symmetric primitives. The scheme is secure in the framework for universal composability assuming the existence of a symmetric CCA2-...
Mårten Trolin
SACRYPT
2005
Springer
15 years 11 months ago
SPA Resistant Left-to-Right Integer Recodings
We present two left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a s...
Nicolas Thériault
TCC
2005
Springer
141views Cryptology» more  TCC 2005»
15 years 11 months ago
Public-Key Steganography with Active Attacks
A complexity-theoretic model for public-key steganography with active attacks is introduced. The notion of steganographic security against adaptive chosen-covertext attacks (SS-CC...
Michael Backes, Christian Cachin
TCC
2005
Springer
102views Cryptology» more  TCC 2005»
15 years 11 months ago
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
Jonathan Katz, Yehuda Lindell