GeoEnc: Geometric area based keys and policies in functional encryption systems

Mingwu Zhang, Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Functional encryption provides more sophisticated and flexible expression between the encryption key ek and decryption key dk by deriving from attribute vectors x and policy vector v, respectively. There is a function f(x, v) that determines what type of a user with a secret key dk can decrypt the ciphertext encrypted under ek. This allows an encryptor to specify a functional formula as a decryptable policy describing what users can learn from the ciphertext without knowing the decryptor's identities or public keys. In this paper, we explore two geometric-area-based key generation and functional encryption schemes (GeoEnc), where secret keys are associated with a point on a planar coordinate system and encrypt policies are associated with a line (GeoEncLine scheme) or a convex polygon (GeoEncHull scheme). If the attribute point lies on the line or inside the convex hull, the decryption key holder can decrypt the ciphertext associated with the geometric policy such as the line or the convex polygon. The proposed schemes have policy hiding as well as payload hiding characteristics. To the best of our knowledge, they are the first functional encryptions using geometric-area-based keys and policies. We give an evaluation of key distribution in a practical coordinate system and also give a security analysis with a hybrid model. The proposed schemes have many applications as sources for keys generation and policies encryption such as computer graphics security, network topology protection, secure routing and mobile networking, secure multiparty computation, secure GPS/GIS, military area protection, etc.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings
Pages241-258
Number of pages18
DOIs
Publication statusPublished - Jul 18 2011
Event16th Australasian Conference on Information Security and Privacy, ACISP 2011 - Melbourne, VIC, Australia
Duration: Jul 11 2011Jul 13 2011

Publication series

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

Other

Other16th Australasian Conference on Information Security and Privacy, ACISP 2011
CountryAustralia
CityMelbourne, VIC
Period7/11/117/13/11

Fingerprint

Encryption
Cryptography
Computer systems
Convex polygon
Network security
Line
Computer graphics
Geographic information systems
Attribute
Global positioning system
Secure multi-party Computation
Key Distribution
Topology
Policy
Security Analysis
Hybrid Model
Public key
Networking
Convex Hull
Network Topology

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Zhang, M., & Takagi, T. (2011). GeoEnc: Geometric area based keys and policies in functional encryption systems. In Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings (pp. 241-258). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6812 LNCS). https://doi.org/10.1007/978-3-642-22497-3_16

GeoEnc : Geometric area based keys and policies in functional encryption systems. / Zhang, Mingwu; Takagi, Tsuyoshi.

Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings. 2011. p. 241-258 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6812 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, M & Takagi, T 2011, GeoEnc: Geometric area based keys and policies in functional encryption systems. in Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6812 LNCS, pp. 241-258, 16th Australasian Conference on Information Security and Privacy, ACISP 2011, Melbourne, VIC, Australia, 7/11/11. https://doi.org/10.1007/978-3-642-22497-3_16
Zhang M, Takagi T. GeoEnc: Geometric area based keys and policies in functional encryption systems. In Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings. 2011. p. 241-258. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-22497-3_16
Zhang, Mingwu ; Takagi, Tsuyoshi. / GeoEnc : Geometric area based keys and policies in functional encryption systems. Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings. 2011. pp. 241-258 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b06aa06392e1402a9cfaf30f0369914e,
title = "GeoEnc: Geometric area based keys and policies in functional encryption systems",
abstract = "Functional encryption provides more sophisticated and flexible expression between the encryption key ek and decryption key dk by deriving from attribute vectors x→ and policy vector v→, respectively. There is a function f(x→, v→) that determines what type of a user with a secret key dk can decrypt the ciphertext encrypted under ek. This allows an encryptor to specify a functional formula as a decryptable policy describing what users can learn from the ciphertext without knowing the decryptor's identities or public keys. In this paper, we explore two geometric-area-based key generation and functional encryption schemes (GeoEnc), where secret keys are associated with a point on a planar coordinate system and encrypt policies are associated with a line (GeoEncLine scheme) or a convex polygon (GeoEncHull scheme). If the attribute point lies on the line or inside the convex hull, the decryption key holder can decrypt the ciphertext associated with the geometric policy such as the line or the convex polygon. The proposed schemes have policy hiding as well as payload hiding characteristics. To the best of our knowledge, they are the first functional encryptions using geometric-area-based keys and policies. We give an evaluation of key distribution in a practical coordinate system and also give a security analysis with a hybrid model. The proposed schemes have many applications as sources for keys generation and policies encryption such as computer graphics security, network topology protection, secure routing and mobile networking, secure multiparty computation, secure GPS/GIS, military area protection, etc.",
author = "Mingwu Zhang and Tsuyoshi Takagi",
year = "2011",
month = "7",
day = "18",
doi = "10.1007/978-3-642-22497-3_16",
language = "English",
isbn = "9783642224966",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "241--258",
booktitle = "Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings",

}

TY - GEN

T1 - GeoEnc

T2 - Geometric area based keys and policies in functional encryption systems

AU - Zhang, Mingwu

AU - Takagi, Tsuyoshi

PY - 2011/7/18

Y1 - 2011/7/18

N2 - Functional encryption provides more sophisticated and flexible expression between the encryption key ek and decryption key dk by deriving from attribute vectors x→ and policy vector v→, respectively. There is a function f(x→, v→) that determines what type of a user with a secret key dk can decrypt the ciphertext encrypted under ek. This allows an encryptor to specify a functional formula as a decryptable policy describing what users can learn from the ciphertext without knowing the decryptor's identities or public keys. In this paper, we explore two geometric-area-based key generation and functional encryption schemes (GeoEnc), where secret keys are associated with a point on a planar coordinate system and encrypt policies are associated with a line (GeoEncLine scheme) or a convex polygon (GeoEncHull scheme). If the attribute point lies on the line or inside the convex hull, the decryption key holder can decrypt the ciphertext associated with the geometric policy such as the line or the convex polygon. The proposed schemes have policy hiding as well as payload hiding characteristics. To the best of our knowledge, they are the first functional encryptions using geometric-area-based keys and policies. We give an evaluation of key distribution in a practical coordinate system and also give a security analysis with a hybrid model. The proposed schemes have many applications as sources for keys generation and policies encryption such as computer graphics security, network topology protection, secure routing and mobile networking, secure multiparty computation, secure GPS/GIS, military area protection, etc.

AB - Functional encryption provides more sophisticated and flexible expression between the encryption key ek and decryption key dk by deriving from attribute vectors x→ and policy vector v→, respectively. There is a function f(x→, v→) that determines what type of a user with a secret key dk can decrypt the ciphertext encrypted under ek. This allows an encryptor to specify a functional formula as a decryptable policy describing what users can learn from the ciphertext without knowing the decryptor's identities or public keys. In this paper, we explore two geometric-area-based key generation and functional encryption schemes (GeoEnc), where secret keys are associated with a point on a planar coordinate system and encrypt policies are associated with a line (GeoEncLine scheme) or a convex polygon (GeoEncHull scheme). If the attribute point lies on the line or inside the convex hull, the decryption key holder can decrypt the ciphertext associated with the geometric policy such as the line or the convex polygon. The proposed schemes have policy hiding as well as payload hiding characteristics. To the best of our knowledge, they are the first functional encryptions using geometric-area-based keys and policies. We give an evaluation of key distribution in a practical coordinate system and also give a security analysis with a hybrid model. The proposed schemes have many applications as sources for keys generation and policies encryption such as computer graphics security, network topology protection, secure routing and mobile networking, secure multiparty computation, secure GPS/GIS, military area protection, etc.

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

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

U2 - 10.1007/978-3-642-22497-3_16

DO - 10.1007/978-3-642-22497-3_16

M3 - Conference contribution

AN - SCOPUS:79960266628

SN - 9783642224966

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

SP - 241

EP - 258

BT - Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings

ER -