Sciweavers

135 search results - page 13 / 27
» Adaptive Security of Symbolic Encryption
Sort
View
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
EUROCRYPT
1999
Springer
14 years 2 months ago
New Public Key Cryptosystems Based on the Dependent-RSA Problems
Since the Diffie-Hellman paper, asymmetric encryption has been a very important topic, and furthermore ever well studied. However, between the efficiency of RSA and the security of...
David Pointcheval
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
14 years 1 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
ESORICS
2004
Springer
14 years 3 months ago
A Public-Key Encryption Scheme with Pseudo-random Ciphertexts
This work presents a practical public-key encryption scheme that offers security under adaptive chosen-ciphertext attack (CCA) and has pseudo-random ciphertexts, i.e. ciphertexts ...
Bodo Möller
CCS
2010
ACM
13 years 10 months ago
Symbolic security analysis of ruby-on-rails web applications
Many of today's web applications are built on frameworks that include sophisticated defenses against malicious adversaries. However, mistakes in the way developers deploy tho...
Avik Chaudhuri, Jeffrey S. Foster