首页> 外国专利> METHOD FOR CIPHERING AND DECIPHERING DIGITAL DATA, BASED ON AN IDENTITY, IN A MULTI-AUTHORITIES CONTEXT

METHOD FOR CIPHERING AND DECIPHERING DIGITAL DATA, BASED ON AN IDENTITY, IN A MULTI-AUTHORITIES CONTEXT

机译:多实体上下文中基于身份的数字数据加密和解密方法

摘要

In one embodiment, it is proposed a for ciphering digital data M being an element of a group custom-characterT, said group custom-characterT being part of a bilinear group of prime order p. The method can be executed by an electronic device, and is remarkable in that it comprises:applying a hash function to an identity associated to a recipient electronic device, delivering K+1 elements, each element belonging to said group custom-character, and K being an integer value greater than or equal to one;obtaining from common public parameters, shared by n trusted authorities servers, n being an integer value greater or equal to two, 2K generators of said group custom-character;obtaining K random element(s) belonging to custom-characterp;determining K+1 elements belonging to said group custom-character via exponentiations of combinations of generators from said 2K generators, with exponents being said K random element(s), said K+1 elements being a first part of a ciphertext of said digital data M;determining a product of said digital data M with K+1 elements belonging to said group custom-characterT, each of said K+1 elements belonging to said group custom-characterT being obtained via applying a pairing function on a combination of elements of a master public key associated to one of the n trusted authorities, said K random element(s) and output of said applying a hash function, delivering a second part of said ciphertext of said digital data M.
机译:在一个实施例中,提出了一种用于加密数字数据M的方法,该数字数据M是组“ T ,表示组” T 是双线性组的一部分素数p。该方法可以由电子设备执行,其显着之处在于包括: 将哈希函数应用于与接收方电子设备关联的身份,传递K + 1个元素,每个元素都属于所述组“,并且K是大于或等于1的整数; / ListItem> 从n个受信任的权威服务器共享的公共公用参数中获取,n是一个大于或等于所述组的2K个生成器的整数值“ ; 获得K个随机元素)属于“ p ; 确定属于所述组的K + 1个元素“通过组合的幂来自所述2K个生成器的多个生成器,其中指数是所述K个随机元素,所述K + 1个元素是所述数字数据M的密文的第一部分; 确定带有属于所述组的K + 1个元素的所述数字数据M的乘积“ T ,每个表示K + 1元素属于所述组“ T 是通过将配对函数应用于与n个受信机构之一相关的主公钥的元素组合而获得的,表示K个随机元素,所述应用散列函数的输出,传递所述数字数据M的所述密文的第二部分。

著录项

  • 公开/公告号US2017061833A1

    专利类型

  • 公开/公告日2017-03-02

    原文格式PDF

  • 申请/专利权人 THOMSON LICENSING;

    申请/专利号US201514792558

  • 发明设计人 BENOIT LIBERT;MARC JOYE;

    申请日2015-07-06

  • 分类号G09C1/00;H04L9/00;H04L9/14;H04L9/06;H04L9/30;

  • 国家 US

  • 入库时间 2022-08-21 13:48:03

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号