Sciweavers

120 search results - page 2 / 24
» Construction of a Non-malleable Encryption Scheme from Any S...
Sort
View
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
13 years 9 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
CANS
2010
Springer
150views Cryptology» more  CANS 2010»
13 years 3 months ago
Predicate Encryption with Partial Public Keys
Abstract. Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release pa...
Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano
TCC
2005
Springer
169views Cryptology» more  TCC 2005»
13 years 10 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
PKC
2012
Springer
212views Cryptology» more  PKC 2012»
11 years 7 months ago
Public-Key Cryptography from New Multivariate Quadratic Assumptions
In this work, we study a new multivariate quadratic (MQ) assumption that can be used to construct public-key encryption schemes. In particular, we research in the following two di...
Yun-Ju Huang, Feng-Hao Liu, Bo-Yin Yang
CRYPTO
2010
Springer
170views Cryptology» more  CRYPTO 2010»
13 years 1 months ago
Securing Computation against Continuous Leakage
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
Shafi Goldwasser, Guy N. Rothblum