Sciweavers

738 search results - page 1 / 148
» Formal Methods: for All or for Chosen
Sort
View
CSEDU
2009
128views Education» more  CSEDU 2009»
13 years 7 months ago
Formal Methods: for All or for Chosen?
Victor V. Kuliamin, Vitaliy A. Omelchenko, Olga L....
TCC
2005
Springer
169views Cryptology» more  TCC 2005»
13 years 11 months ago
Chosen-Ciphertext Security of Multiple Encryption
Encryption of data using multiple, independent encryption schemes (“multiple encryption”) has been suggested in a variety of contexts, and can be used, for example, to protect ...
Yevgeniy Dodis, Jonathan Katz
CHES
2008
Springer
144views Cryptology» more  CHES 2008»
13 years 8 months ago
Collision-Based Power Analysis of Modular Exponentiation Using Chosen-Message Pairs
Abstract. This paper proposes new chosen-message power-analysis attacks against public-key cryptosystems based on modular exponentiation, which use specific input pairs to generate...
Naofumi Homma, Atsushi Miyamoto, Takafumi Aoki, Ak...
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
13 years 10 months ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny