More Efficient Identity-based Matchmaking Encryption Under Standard Model
Author:
Affiliation:

Clc Number:

TP306

  • Article
  • | |
  • Metrics
  • |
  • Reference [21]
  • | | | |
  • Comments
    Abstract:

    Identity-based matchmaking encryption is a new cryptographic primitive that allows both the receiver and the sender to specify each other’s identity and communicate with each other only when the identities match. Meanwhile, it provides a non-interactive secret handshake protocol to get rid of real-time interaction and further improve participant privacy. This study proposes an identity-based matchmaking encryption (IB-ME) scheme in prime-order groups under symmetric external Diffie-Hellman (SXDH) assumption under the standard model. Realizing short parameters and reducing the matchmaking times during decryption are the most efficient identity-based matchmaking encryption scheme. Additionally, this study also puts forward the first inner product with equality matchmaking encryption (IPE-ME) scheme under the SXDH assumption in the standard model. Technically, it first constructs two schemes in composite-order groups, then simulates them with dual pairing vector space (DPVS) into prime-order groups, and further reduces the parameter size by decreasing the required dimension of dual basis. Finally, for the proposed IPE-ME scheme, this study replaces the equality policy in the first layer of an IB-ME scheme with inner-product policy.

    Reference
    [1] Ateniese G, Francati D, Nuñez D, Venturi D. Match me if you can: Matchmaking encryption and its applications. Journal of Cryptology, 2021, 34(3): 16.
    [2] Balfanz D, Durfee G, Shankar N, Smetters D, Staddon J, Wong HC. Secret handshakes from pairing-based key agreements. In: Proc. of the 2003 Symp. on Security and Privacy. Berkeley: IEEE, 2003. 180–196.
    [3] Francati D, Guidi A, Russo L, Venturi D. Identity-based matchmaking encryption without random oracles. In: Proc. of the 22nd Int’l Conf. on Cryptology in India on Progress in Cryptology. Jaipur: Springer, 2021. 415–435.
    [4] Chen J, Li Y, Wen JM, Weng J. Identity-based matchmaking encryption from standard assumptions. In: Proc. of the 28th Int’l Conf. on the Theory and Application of Cryptology and Information Security on Advances in Cryptology. Taipei: Springer, 2022. 394–422.
    [5] Xu SM, Ning JT, Li YJ, Zhang YH, Xu GW, Huang XY, Deng RH. Match in my way: Fine-grained bilateral access control for secure cloud-fog computing. IEEE Trans. on Dependable and Secure Computing, 2022, 19(2): 1064–1077.
    [6] Xu SM, Ning JT, Ma JH, Huang XY, Pang HH, Deng RH. Expressive bilateral access control for Internet-of-Things in cloud-fog computing. In: Proc. of the 26th ACM Symp. on Access Control Models and Technologies. New York: Association for Computing Machinery, 2021. 143–154.
    [7] 聂旭云, 袁玉, 孙剑飞. 可穿刺的基于属性的匹配加密方案. 密码学报, 2022, 9(5): 883–898.
    Nie XY, Yuan Y, Sun JF. Puncturable attribute-based matchmaking encryption scheme. Journal of Cryptologic Research, 2022, 9(5): 883–898 (in Chinese with English abstract).
    [8] Okamoto T, Takashima K. Homomorphic encryption and signatures from vector decomposition. In: Proc. of the 2nd Int’l Conf. on Pairing-Based Cryptography. Egham: Springer, 2008. 57–74.
    [9] Okamoto T, Takashima K. Hierarchical predicate encryption for inner-products. In: Proc. of the 15th Int’l Conf. on the Theory and Application of Cryptology and Information Security on Advances in Cryptology. Tokyo: Springer, 2009. 214–231.
    [10] Chen J, Lim HW, Ling S, Wang HX, Wee H. Shorter identity-based encryption via asymmetric pairings. Designs, Codes and Cryptography, 2014, 73(3): 911–947.
    [11] Chen J, Gong JQ, Wee H. Improved inner-product encryption with adaptive security and full attribute-hiding. In: Proc. of the 24th Int’l Conf. on the Theory and Application of Cryptology and Information Security on Advances in Cryptology. Brisbane: Springer, 2018. 673–702.
    [12] Katz J, Sahai A, Waters B. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Proc. of the 27th Annual Int’l Conf. on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. Istanbul: Springer, 2008. 146–162.
    [13] Lewko A, Okamoto T, Sahai A, Takashima K, Waters B. Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In: Proc. of the 29th Annual Int’l Conf. on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. French Riviera: Springer, 2010. 62–91.
    [14] Okamoto T, Takashima K. Adaptively attribute-hiding (hierarchical) inner product encryption. In: Proc. of the 31st Annual Int’l Conf. on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. Cambridge: Springer, 2012. 591–608.
    [15] Wee H. Dual system encryption via predicate encodings. In: Proc. of the 11th Int’l Conf. on Theory of Cryptography. San Diego: Springer, 2014. 616–637.
    [16] Chen J, Lim HW, Ling S, Wang HX, Wee H. Shorter IBE and signatures via asymmetric pairings. In: Proc. of the 5th Int’l Conf. on Pairing-based Cryptography. Cologne: Springer, 2013. 122–140.
    [17] Chen J, Gay R, Wee H. Improved dual system ABE in prime-order groups via predicate encodings. In: Proc. of the 34th Annual Int’l Conf. on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology. Sofia: Springer, 2015. 595–624.
    [18] Boneh D, Goh E J, Nissim K. Evaluating 2-DNF formulas on ciphertexts. In: Proc. of the 2nd Theory of Cryptography Conf. on Theory of Cryptography. Cambridge: Springer, 2005. 325–341.
    [19] Lewko A, Waters B. New techniques for dual system encryption and fully secure HIBE with short ciphertexts. In: Proc. of the 7th Theory of Cryptography Conf. on Theory of Cryptography. Zurich: Springer, 2010. 455–479.
    [20] Waters B. Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions. In: Proc. of the 29th Annual Int’l Cryptology Conf. on Advances in Cryptology. Santa Barbara: Springer, 2009. 619–636.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

陈洁,楚乔涵,杜秋妍,高莹.标准模型下效率更高的身份基匹配加密.软件学报,2025,36(2):698-714

Copy
Share
Article Metrics
  • Abstract:426
  • PDF: 1761
  • HTML: 263
  • Cited by: 0
History
  • Received:June 12,2023
  • Revised:August 18,2023
  • Online: April 24,2024
You are the first2041542Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063