Paper Info
Title
Structure preserving CCA secure encryption and applications
Abstract
In this paper we present the first CCA-secure public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular, it does not use hash-functions or interpret group elements as bit-strings. This makes our scheme a perfect building block for cryptographic protocols where parties for instance want to prove properties about ciphertexts to each other or to jointly compute ciphertexts. Our scheme is very efficient and is secure against adaptive chosen ciphertext attacks. We also provide a few example protocols for which our scheme is useful. For instance, we present an efficient protocol for two parties, Alice and Bob, that allows them to jointly encrypt a given function of their respective secret inputs such that only Bob learns the resulting ciphertext, yet they are both ensured of the computation's correctness. This protocol serves as a building block for our second contribution which is a set of protocols that implement the concept of so-called oblivious trusted third parties. This concept has been proposed before, but no concrete realization was known.
Year
DOI
Venue
2011
10.1007/978-3-642-25385-0_5
ASIACRYPT
Keywords
Field
DocType
perfect building block,ciphertext attack,cca secure encryption,building block,algebraic operation,resulting ciphertext,encryption scheme,example protocol,cryptographic protocol,cca-secure public key encryption,efficient protocol,public key encryption
Cryptographic protocol,Computer science,Attribute-based encryption,Deterministic encryption,Theoretical computer science,Encryption,40-bit encryption,Probabilistic encryption,Ciphertext,On-the-fly encryption
Conference
Volume
ISSN
Citations 
7073
0302-9743
19
PageRank 
References 
Authors
0.62
25
5
Name
Order
Citations
PageRank
Jan Camenisch16453366.63
Kristiyan Haralambiev256716.53
Markulf Kohlweiss3146965.13
Jorn Lapon4628.18
Vincent Naessens58619.70