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)     

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

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

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

目前一些电子选举协议利用可链接环签名或一次性环签名来保护投票者的隐私,并防止重复投票的情况发生,但签名大小随投票人数的增大而增大,而简短可链接环签名大小始终固定不变,但已有简短可链接环签名算法效率较低。针对这些问题,利用累加器和基于知识证明的签名,构造新的高效的简短可链接环签名,结合匿名地址及星际文件系统,提出一种新的智能合约选举方案,分别设计了选举的创建、投票、计票等阶段的操作。对方案的不可伪造性、可链接性、匿名性、隐私性、公开验证性以及运行效率进行了证明和分析。最后进行了实验仿真评估,结果显示,随着投票者人数的增大,该方案选票的签名大小及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次广播通信,通信开销更低,易于实现。改进方案可用于在资源受限的网络环境下构建多对一的认证方案。     

浅谈RSA数字签名技术在综合船桥系统中的应用

随着Internet的快速发展,网络在综合船桥系统中得到了广泛的应用。在享受网络带来的便利的同时,它的各种弊端也日益显露,如网上数据传输的完整性等问题。为了很好地解决这一问题,将RSA数字签名和数字摘要应用于综合船桥系统中。在保证数据安全传输的同时,很好地验证了数据的完整性,同时完成了发送方的身份验证。     

公开密钥加密体系和数字签名技术的研究

为了保障网络中数据通信的安全、网上用户身份的识别和电子商务、电子政务中网上交易的安全 ,介绍了公开密钥加密体系 (PKI)和数字证书 (DC) ,以及RSA算法实现数字签名和多人签名技术的实施 ,并介绍了多种有效的数字签名方法 ,包括一对一签名、多重数字签名     

PKI安全体系在手机智能卡中的应用

介绍PKI系统和智能卡系统的基本原理和安全技术,重点研究PKI安全体系在手机智能卡中的应用。利用存储在卡中的PKI安全插件,为手机卡和SP应用之间提供身份认证、数字签名等服务支持,有效确保了手机智能卡在网络数据传输中的安全性、完整性。