Algebraic properties of cryptosystem PGM

In the late 1970s Magliveras invented a private-key cryptographic system calledPermutation Group Mappings (PGM). PGM is based on the prolific existence of certain kinds of factorization sets, calledlogarithmic signatures, for finite permutation groups. PGM is an endomorphic system with message space ℤ_|G| for a given finite permutation groupG. In this paper we prove several algebraic properties of PGM. We show that the set of PGM transformations ℐ _G is not closed under functional composition and hence not a group. This set is 2-transitive on ℤ_|G| if the underlying groupG is not hamiltonian and not abelian. Moreover, if the order ofG is not a power of 2, then the set of transformations contains an odd permutation. An important consequence of these results is that the group generated by the set of transformations is nearly always the symmetric group ℒ_|G|. Thus, allowing multiple encryption, any permutation of the message space is attainable. This property is one of the strongest security conditions that can be offered by a private-key encryption system. S. S. Magliveras was supported in part by NSF/NSA Grant Number MDA904-82-H0001, by U.S. West Communications, and by the Center for Communication and Information Science of the University of Nebraska.     

Ownership-attached unblinding of blind signatures for untraceable electronic cash

In an untraceable electronic cash protocol based on blind signatures, an identified customer can withdraw a blinded electronic cash from the bank and the unblinding operation is adopted by the customer to transform the blinded electronic cash into a valid one. Before performing the operation, the blinded electronic cash is protected well since attackers cannot convert it into a valid electronic cash without the blinding factor corresponding to the operation. However, after unblinding, the electronic cash will suffer from the theft attacks since it is not protected by any security mechanism. This paper introduces a new unblinding operation called ownership-attached unblinding which attaches the identities of a designated payee and a specified transaction to the blinded electronic cash and then produces an ownership-attached electronic cash other than a bare one such that the cash can withstand the theft attacks during the entire transaction because it is valid for the designated payee and the specified transaction only. Furthermore, the proposed scheme does not largely increase the computation cost required for each customer so that it also is a customer efficient protection solution for untraceable electronic cash and especially suitable for mobile clients and smart-card users.     

Incorporating If...Then...Personality Signatures in Person Perception: Beyond the Person-Situation Dichotomy.

Three studies investigated conditions in which perceivers view dispositions and situations as interactive, rather than independent, causal forces when making judgments about another's personality. Study 1 showed that perceivers associated 5 common trait terms (e.g., friendly and shy) with characteristic if...then... (if situation a, then the person does x, but if situation b, then the person does y) personality signatures. Study 2 demonstrated that perceivers used information about a target's stable if...then... signature to infer the target's motives and traits; dispositional judgments were mediated by inferences about the target's motivations. Study 3 tested whether perceivers draw on if...then... signatures when making judgments about Big Five trait dimensions. Together, the findings indicate that perceivers take account of person-situation interactions (reflected in if...then... signatures) in everyday explanations of social behavior and personality dispositions. Boundary conditions are also discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

P2P网络中的匿名电子拍卖协议研究*

在P2P网络中实现电子拍卖的功能对于P2P技术具有重要意义,这将意味着电子商务同样可以在P2P网络中广泛应用.然而,匿名性、投标价保密性、抗勾结性等安全问题一直是电子拍卖研究的难点问题,一种合理的解决方法是将盲签名、知识证明、可验证的数字签名加密算法引入到电子拍卖协议中.这样不仅可以很好地解决P2P网络无中心服务器的不足,还使得系统的安全性能得到显著提高.     

基于FPGA的Leighton-Micali签名方案密钥生成的高速可配置实现

由于量子计算机的飞速发展,现代密码学面临着巨大的挑战。为了实现抗量子计算机攻击的加密,人们提出了许多新的加密方案,并对后量子密码学(Post-Quantum Cryptography,PQC)开展了标准化进程。Leighton-Micali签名(Leighton-Micali signature,LMS)是一种基于哈希的后量子签名方案,其私钥和公钥尺寸都较小,且安全性已被充分研究。LMS被互联网工程小组(Internet Engineering Task Force,IETF)选为PQC签名协议的标准方案,同时被美国国家标准技术局(National Institute of Standardsand Technology,NIST)选为一种PQC过渡方案。然而,密钥生成过程中的效率低下,成为了LMS实际应用中的瓶颈。在本文中,我们首次对LMS进行基于FPGA的硬件实现与加速。首先,在不损失安全性的基础上,我们将LMS中的主要哈希函数由SHA2替换为SHA3函数。其次,我们设计了一个软硬件协同系统,将核心的哈希运算用硬件进行实现,该系统在消耗较少资源的前提下,可完成LMS协议的所有过程:密钥生成、签名与验证。该系统为物联网(Internet of things,IoT)场景下资源受限的LMS应用提供了参考。接着,我们提出了一个高速的密钥生成架构来加速LMS。该架构中具有可配置性,支持LMS的所有参数集,内部的哈希模块根据使用场景进行设计与部署,且并行度经过精心设计,以使得架构同时达到低延迟和高硬件利用率。此外,设计中的控制逻辑被设计为在适应不同参数集的情况下保持一定程度的恒定功率,以抵御功率分析攻击。该架构使用Verilog实现,并在Xilinx Zynq UltraScale+MPSoC ZCU104 FPGA平台上实验。实验结果表明,与在Intel (R) Core (TM) i7-6850K 3.60GHz CPU上启用多线程的目前较优软件实现相比,本文中的设计在不同参数配置下可实现55x~2091x的加速;与最新的各平台LMS工作相比,本文中设计可实现超过17x的加速;与相近方案的FPGA工作相比,本文中设计可实现约70x的加速。     

一种门限可追踪的匿名签密方案

为解决匿名签密算法中签密者身份的追踪问题,提出了一种门限可追踪的匿名签密方案.该方案借助范德蒙行列式生成成员的公钥和私钥,通过在匿名签密过程中附加一些与签密者身份相关的额外信息,实现签密者身份的门限追踪.在不可分模型下,证明了该方案满足匿名性、门限可追踪性、不可伪造性和不相关性.     

结合简短可链接环签名的智能合约选举方案

目前一些电子选举协议利用可链接环签名或一次性环签名来保护投票者的隐私,并防止重复投票的情况发生,但签名大小随投票人数的增大而增大,而简短可链接环签名大小始终固定不变,但已有简短可链接环签名算法效率较低。针对这些问题,利用累加器和基于知识证明的签名,构造新的高效的简短可链接环签名,结合匿名地址及星际文件系统,提出一种新的智能合约选举方案,分别设计了选举的创建、投票、计票等阶段的操作。对方案的不可伪造性、可链接性、匿名性、隐私性、公开验证性以及运行效率进行了证明和分析。最后进行了实验仿真评估,结果显示,随着投票者人数的增大,该方案选票的签名大小及Gas消耗保持不变且较少,生成时间及验证时间增长缓慢且较少。     

基于彩色编码的多态蠕虫特征自动提取方法

快速而准确地提取蠕虫特征对于有效防御多态蠕虫的传播至关重要,但是目前的特征产生方法在噪音干扰下无法产生正确的蠕虫特征.提出基于彩色编码的特征自动提取算法CCSF(color coding signature finding)来解决有噪音干扰情况下的多态蠕虫特征提取问题.CCSF算法将可疑池中的n条序列分成m组,然后运用彩色编码对每组序列进行特征提取.通过对每组提取出来的特征集合进行过滤筛选,最终产生正确的蠕虫特征.采用多类蠕虫对CCSF算法进行测试,并与其他蠕虫特征提取方法进行比较,结果表明,CCSF算法能够在有噪音干扰的条件下准确地提取出多态蠕虫的特征,该特征不包含碎片,易于应用到IDS(intrusion detection system)中对多态蠕虫进行检测.     

基于倒排索引的密文数据库检索方法研究

针对实际密文数据库的应用,在全文检索倒排索引技术的基础上,设计了一种通过密文倒排索引文件对其进行快速检索的方法。密文索引文件中主要包含有索引项、相对应的记录主键等信息。检索时,通过用检索词匹配索引文件中的索引项,找到对应的记录主键集合,再根据记录主键集合查询密文数据库,获取相应的密文数据,进行解密即可获取明文数据信息。整个检索过程中不对数据库进行解密,从而实现了在不解密的情况下对密文数据库的快速检索。     

改进的签名长度固定的无证书聚合签名

现有的具有固定签名长度的无证书聚合签名(certificateless aggregate signatures, CLAS)方案要么存在安全缺陷,要么通信开销较大。提出一种改进的CLAS方案,由聚合人选择整数域上的随机参数替代状态信息,并且广播给所有签名者。在随机预言模型下,改进方案被规约为多项式时间敌手求解CDH(computational Diffie- Hellman)难题,具有可证明安全性。对比分析表明,改进CLAS方案的状态信息协商阶段仅需要1次广播通信,通信开销更低,易于实现。改进方案可用于在资源受限的网络环境下构建多对一的认证方案。