Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption

Tatsuaki Okamoto; Katsuyuki Takashima

doi:10.1007/978-3-642-25513-7_11

Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption

Tatsuaki Okamoto^*, Katsuyuki Takashima

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

62 Citations (Scopus)

Abstract

In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-size ciphertexts and the other features constant-size secret-keys. Our NIPE schemes imply an identity-based revocation (IBR) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption. Any previous IBR scheme with constant-size ciphertexts or constant-size secret-keys was not adaptively secure in the standard model. This paper also presents two zero inner-product encryption (ZIPE) schemes each of which has constant-size ciphertexts or constant-size secret-keys and is adaptively secure under the DLIN assumption in the standard model. They imply an identity-based broadcast encryption (IBBE) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption.

Original language	English
Title of host publication	Cryptology and Network Security - 10th International Conference, CANS 2011, Proceedings
Pages	138-159
Number of pages	22
DOIs	https://doi.org/10.1007/978-3-642-25513-7_11
Publication status	Published - 2011
Externally published	Yes
Event	10th International Conference on Cryptography and Network Security, CANS 2011 - Sanya, China Duration: 2011 Dec 10 → 2011 Dec 12

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7092 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th International Conference on Cryptography and Network Security, CANS 2011
Country/Territory	China
City	Sanya
Period	11/12/10 → 11/12/12

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-25513-7_11

Cite this

Okamoto, T., & Takashima, K. (2011). Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. In Cryptology and Network Security - 10th International Conference, CANS 2011, Proceedings (pp. 138-159). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7092 LNCS). https://doi.org/10.1007/978-3-642-25513-7_11

Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. / Okamoto, Tatsuaki; Takashima, Katsuyuki.
Cryptology and Network Security - 10th International Conference, CANS 2011, Proceedings. 2011. p. 138-159 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7092 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Okamoto, T & Takashima, K 2011, Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. in Cryptology and Network Security - 10th International Conference, CANS 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7092 LNCS, pp. 138-159, 10th International Conference on Cryptography and Network Security, CANS 2011, Sanya, China, 11/12/10. https://doi.org/10.1007/978-3-642-25513-7_11

Okamoto T, Takashima K. Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. In Cryptology and Network Security - 10th International Conference, CANS 2011, Proceedings. 2011. p. 138-159. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-25513-7_11

Okamoto, Tatsuaki ; Takashima, Katsuyuki. / Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption. Cryptology and Network Security - 10th International Conference, CANS 2011, Proceedings. 2011. pp. 138-159 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d6265e3ad235439a8204a2bd8f07a2c8,

title = "Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption",

abstract = "In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-size ciphertexts and the other features constant-size secret-keys. Our NIPE schemes imply an identity-based revocation (IBR) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption. Any previous IBR scheme with constant-size ciphertexts or constant-size secret-keys was not adaptively secure in the standard model. This paper also presents two zero inner-product encryption (ZIPE) schemes each of which has constant-size ciphertexts or constant-size secret-keys and is adaptively secure under the DLIN assumption in the standard model. They imply an identity-based broadcast encryption (IBBE) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption.",

author = "Tatsuaki Okamoto and Katsuyuki Takashima",

year = "2011",

doi = "10.1007/978-3-642-25513-7_11",

language = "English",

isbn = "9783642255120",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "138--159",

booktitle = "Cryptology and Network Security - 10th International Conference, CANS 2011, Proceedings",

note = "10th International Conference on Cryptography and Network Security, CANS 2011 ; Conference date: 10-12-2011 Through 12-12-2011",

}

TY - GEN

T1 - Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption

AU - Okamoto, Tatsuaki

AU - Takashima, Katsuyuki

PY - 2011

Y1 - 2011

N2 - In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-size ciphertexts and the other features constant-size secret-keys. Our NIPE schemes imply an identity-based revocation (IBR) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption. Any previous IBR scheme with constant-size ciphertexts or constant-size secret-keys was not adaptively secure in the standard model. This paper also presents two zero inner-product encryption (ZIPE) schemes each of which has constant-size ciphertexts or constant-size secret-keys and is adaptively secure under the DLIN assumption in the standard model. They imply an identity-based broadcast encryption (IBBE) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption.

AB - In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-size ciphertexts and the other features constant-size secret-keys. Our NIPE schemes imply an identity-based revocation (IBR) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption. Any previous IBR scheme with constant-size ciphertexts or constant-size secret-keys was not adaptively secure in the standard model. This paper also presents two zero inner-product encryption (ZIPE) schemes each of which has constant-size ciphertexts or constant-size secret-keys and is adaptively secure under the DLIN assumption in the standard model. They imply an identity-based broadcast encryption (IBBE) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption.

UR - http://www.scopus.com/inward/record.url?scp=83755161618&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83755161618&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25513-7_11

DO - 10.1007/978-3-642-25513-7_11

M3 - Conference contribution

AN - SCOPUS:83755161618

SN - 9783642255120

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 138

EP - 159

BT - Cryptology and Network Security - 10th International Conference, CANS 2011, Proceedings

T2 - 10th International Conference on Cryptography and Network Security, CANS 2011

Y2 - 10 December 2011 through 12 December 2011

ER -

Achieving short ciphertexts or short secret-keys for adaptively secure general inner-product encryption

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this