Sciweavers

73 search results - page 6 / 15
» Security of erasable memories against adaptive adversaries
Sort
View
TCC
2004
Springer
131views Cryptology» more  TCC 2004»
15 years 2 months ago
Rerandomizable and Replayable Adaptive Chosen Ciphertext Attack Secure Cryptosystems
Recently Canetti, Krawczyk and Nielsen defined the notion of replayable adaptive chosen ciphertext attack (RCCA) secure encryption. Essentially a cryptosystem that is RCCA secure ...
Jens Groth
SYNASC
2007
IEEE
142views Algorithms» more  SYNASC 2007»
15 years 3 months ago
An Extension of the RSA Trapdoor in a KEM/DEM Framework
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
Bogdan Groza
CRYPTO
2006
Springer
99views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Scalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
Ivan Damgård, Yuval Ishai
SACRYPT
2007
Springer
141views Cryptology» more  SACRYPT 2007»
15 years 3 months ago
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
Johannes Blömer, Volker Krummel
62
Voted
ASIACRYPT
2004
Springer
15 years 2 months ago
Asynchronous Proactive Cryptosystems Without Agreement (Extended Abstract)
d abstract) Bartosz Przydatek1 and Reto Strobl2 1 Department of Computer Science, ETH Z¨urich, Switzerland 2 IBM Research, Zurich Research Laboratory, Switzerland In this paper, w...
Bartosz Przydatek, Reto Strobl