Detailed Information

Cited 0 time in webofscience Cited 0 time in scopus
Metadata Downloads

Two-Input Functional Encryption for Inner Products from Bilinear Maps

Authors
Lee, KwangsuLee, Dong Hoon
Issue Date
6월-2018
Publisher
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
Keywords
functional encryption; multi-input functional encryption; inner product; bilinear maps
Citation
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E101A, no.6, pp.915 - 928
Indexed
SCIE
SCOPUS
Journal Title
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
Volume
E101A
Number
6
Start Page
915
End Page
928
URI
https://scholar.korea.ac.kr/handle/2021.sw.korea/75051
DOI
10.1587/transfun.E101.A.915
ISSN
0916-8508
Abstract
Functional encryption is a new paradigm of public-key encryption that allows a user to compute f (x) on encrypted data CT (x) with a private key SKf to finely control the revealed information. Multi-input functional encryption is an important extension of (single-input) functional encryption that allows the computation f (x(1); ... ; x(n)) on multiple ciphertexts CT (x(1)); ... ; CT (x(n)) with a private key SKf. Although multi-input functional encryption has many interesting applications like running SQL queries on encrypted database and computation on encrypted stream, current candidates are not yet practical since many of them are built on indistinguishability obfuscation. To solve this unsatisfactory situation, we show that practical two-input functional encryption schemes for inner products can be built based on bilinear maps. In this paper, we first propose a two-input functional encryption scheme for inner products in composite-order bilinear groups and prove its selective IND-security under simple assumptions. Next, we propose a two-client functional encryption scheme for inner products where each ciphertext can be associated with a time period and prove its selective IND-security. Furthermore, we show that our two-input functional encryption schemes in composite-order bilinear groups can be converted into schemes in prime-order asymmetric bilinear groups by using the asymmetric property of asymmetric bilinear groups.
Files in This Item
There are no files associated with this item.
Appears in
Collections
School of Cyber Security > Department of Information Security > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Lee, Dong Hoon photo

Lee, Dong Hoon
정보보호학과
Read more

Altmetrics

Total Views & Downloads

BROWSE