首页> 外文会议>IMA conference on cryptography and coding >Revealing Encryption for Partial Ordering
【24h】

Revealing Encryption for Partial Ordering

机译:揭示部分订购的加密

获取原文

摘要

We generalize the cryptographic notion of Order Revealing Encryption (ORE) to arbitrary functions and we present a construction that allows to determine the (partial) ordering of two vectors i.e., given E(x) and E(y) it is possible to learn whether x = y, x > y, x < y or whether x and y are incomparable. This is the first non-trivial example of a Revealing Encryption (RE) scheme with output larger than one bit, and which does not rely on cryptographic obfuscation or multilinear maps.
机译:我们将顺序显示加密(ORE)的密码学概念推广到任意函数,并且我们提出一种结构,该结构允许确定两个向量的(部分)有序,即给定E(x)和E(y),则有可能了解是否x = y,x> y,x

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号