Sciweavers

46 search results - page 6 / 10
» crypto 2005
Sort
View
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
AINA
2005
IEEE
13 years 9 months ago
Estimations on the Security Aspect of Brand's Electronic Cash Scheme
In Crypto’93, Stefan Brands [1] proposed a very efficient off-line electronic cash. Then, the subsequent researchers such as Ernest Foo [2,3], WK Yip [4] and Yiannis [5] develop...
Chang Yu Cheng, Jasmy Yunus, Kamaruzzaman Seman
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
14 years 1 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
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...