Abstract | ||
---|---|---|
We propose the notion of disavowable public key encryption with non-interactive opening (disavowable PKENO) where, for a ciphertext and a message, the receiver of the ciphertext can issue a proof that the plaintext of the ciphertext is NOT the message, and give a fairly practical construction. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1145/2714576.2714642 | IEICE Transactions |
Keywords | Field | DocType |
disavowability,groth-sahai proof,pkeno,public key cryptosystems | Symmetric-key algorithm,Internet privacy,Semantic security,Ciphertext indistinguishability,Computer security,Computer science,Deterministic encryption,Attribute-based encryption,Plaintext-aware encryption,Theoretical computer science,Key clustering,Ciphertext | Conference |
Volume | Issue | ISSN |
98-A | 12 | 0916-8508 |
Citations | PageRank | References |
1 | 0.38 | 13 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ai Ishida | 1 | 5 | 2.81 |
Keita Emura | 2 | 316 | 36.97 |
Goichiro Hanaoka | 3 | 910 | 101.53 |
Yusuke Sakai | 4 | 19 | 8.19 |
Keisuke Tanaka | 5 | 54 | 12.51 |