Novel traveling quantum anonymous voting scheme via GHZ states

Based on traveling ballot mode,we propose a secure quantum anonymous voting via Greenberger–Horne–Zeilinger(GHZ)states.In this scheme,each legal voter performs unitary operation on corresponding position of particle sequence to encode his/her voting content.The voters have multiple ballot items to choose rather than just binary options“yes”or“no”.After counting votes phase,any participant who is interested in voting results can obtain the voting results.To improve the efficiency of the traveling quantum anonymous voting scheme,an optimization method based on grouping strategy is also presented.Compared with the most existing traveling quantum voting schemes,the proposed scheme is more practical because of its privacy,verifiability and non-repeatability.Furthermore,the security analysis shows that the proposed traveling quantum anonymous voting scheme can prevent various attacks and ensure high security.

RAISE:A Resilient Anonymous Information Sharing Environment

With the widespread application of cloud computing and network virtualization technologies,more and more enterprise applications are directly deployed in the cloud.However,the traditional TCP/IP network transmission model does not fully consider the information security issues caused by the uncontrollable internet environment.Network security communication solutions represented by encrypted virtual private networks(VPN)are facing multiple security threats.In fact,during the communication process,the user application needs to protect not only the content of the communication but also the behavior of the communication,such as the communication relationship,the communication protocol,and so on.Inspired by blockchain and software-defined networking technology,this paper proposes a resilient anonymous information sharing environment,RAISE.The RAISE system consists of user agents,a core switching network and a control cluster based on a consortium blockchain.User agents are responsible for segmenting,encrypting,and encapsulating user traffic.The core switching network forwards user traffic according to the rules issued by the controller,and the controller dynamically calculates the forwarding rules according to the security policy.Different from onion routing technology,RAISE adopts the controller to replace the onion routing model,which effectively overcomes the uncontrollability of nodes.The dispersed computing model is introduced to replace the TCP/IP pipeline transmission models,which overcomes the problems of anti-tracking and traffic hijacking that cannot be solved by VPNs.We propose a blockchain control plane framework,design the desired consensus algorithmand deploy a RAISE systemconsisting of 150 nodes in an internet environment.The experimental results show that the use of blockchain technology can effectively improve the reliability and security of the control plane.While maintaining high-performance network transmission,it further provides network communication security.

Identity-Based Edge Computing Anonymous Authentication Protocol

With the development of sensor technology and wireless communication technology,edge computing has a wider range of applications.The privacy protection of edge computing is of great significance.In the edge computing system,in order to ensure the credibility of the source of terminal data,mobile edge computing(MEC)needs to verify the signature of the terminal node on the data.During the signature process,the computing power of edge devices such as wireless terminals can easily become the bottleneck of system performance.Therefore,it is very necessary to improve efficiency through computational offloading.Therefore,this paper proposes an identitybased edge computing anonymous authentication protocol.The protocol realizes mutual authentication and obtains a shared key by encrypting the mutual information.The encryption algorithm is implemented through a thresholded identity-based proxy ring signature.When a large number of terminals offload computing,MEC can set the priority of offloading tasks according to the user’s identity and permissions,thereby improving offloading efficiency.Security analysis shows that the scheme can guarantee the anonymity and unforgeability of signatures.The probability of a malicious node forging a signature is equivalent to cracking the discrete logarithm puzzle.According to the efficiency analysis,in the case of MEC offloading,the computational complexity is significantly reduced,the computing power of edge devices is liberated,and the signature efficiency is improved.

Exploring“Enabling Behaviours”of Wives of Persons with Substance Use Disorder in Chapter 8 of the Big Book of Alcoholic Anonymous

Substance use disorder has a damaging effect on the family members of alcoholics and drug users.On the other hand,the reactions and behaviours of family members may negatively influence a person with substance use disorder.The behaviours of significant others of a person with substance use disorder that contribute to the maintenance of substance use disorder are called enabling.This study aimed to explore enabling behaviours of wives of persons with substance use disorder in Chapter 8 of Alcoholic Anonymous’Big Book by utilising qualitative content analysis.Alcoholics Anonymous(AA)is one of the most commonly used programs for recovery from alcoholism.The current study sought to help mental health professionals get a better understanding of the views and premises of the AA program in reference to enabling behaviours of wives by conducting a qualitative content analysis of the AA Big Book.The study also discusses the healthy behaviours suggested by the authors of the Big Book and the comprehensiveness of the text for the readers.

A Conditionally Anonymous Linkable Ring Signature for Blockchain Privacy Protection

In recent years,the issue of preserving the privacy of parties involved in blockchain transactions has garnered significant attention.To ensure privacy protection for both sides of the transaction,many researchers are using ring signature technology instead of the original signature technology.However,in practice,identifying the signer of an illegal blockchain transaction once it has been placed on the chain necessitates a signature technique that offers conditional anonymity.Some illegals can conduct illegal transactions and evade the lawusing ring signatures,which offer perfect anonymity.This paper firstly constructs a conditionally anonymous linkable ring signature using the Diffie-Hellman key exchange protocol and the Elliptic Curve Discrete Logarithm,which offers a non-interactive process for finding the signer of a ring signature in a specific case.Secondly,this paper’s proposed scheme is proven correct and secure under Elliptic Curve Discrete Logarithm Assumptions.Lastly,compared to previous constructions,the scheme presented in this paper provides a non-interactive,efficient,and secure confirmation process.In addition,this paper presents the implementation of the proposed scheme on a personal computer,where the confirmation process takes only 2,16,and 24ms for ring sizes of 4,24 and 48,respectively,and the confirmation process can be combined with a smart contract on the blockchain with a tested millisecond level of running efficiency.In conclusion,the proposed scheme offers a solution to the challenge of identifying the signer of an illegal blockchain transaction,making it an essential contribution to the field.

A Novel Direct Anonymous Attestation Protocol Based on Zero Knowledge Proof for Different Trusted Domains

In order to solve the issue that existing direct anonymous attestation (DAA) scheme can not operate effectively in different domains,based on the original DAA scheme,a novel direct anonymous attestation protocol used in multi domains environment is proposed and designed,in which,the certificate issuer located in outside of domain can be considered as a proxy server to issue the DAA certificate for valid member nodes directly.Our designed mechanism accords with present trusted computing group (TCG) international specification,and can solve the problems of practical authentication and privacy information protection between different trusted domains efficiently.Compared with present DAA scheme,in our protocol,the anonymity,unforgeability can be guaranteed,and the replay-attack also can be avoided.It has important referenced and practical application value in trusted computing field.

A Novel Anonymous Authentication Scheme Based on Edge Computing in Internet of Vehicles

The vehicular cloud computing is an emerging technology that changes vehicle communication and underlying trafc management applications.However,cloud computing has disadvantages such as high delay,low privacy and high communication cost,which can not meet the needs of realtime interactive information of Internet of vehicles.Ensuring security and privacy in Internet of Vehicles is also regarded as one of its most important challenges.Therefore,in order to ensure the user information security and improve the real-time of vehicle information interaction,this paper proposes an anonymous authentication scheme based on edge computing.In this scheme,the concept of edge computing is introduced into the Internet of vehicles,which makes full use of the redundant computing power and storage capacity of idle edge equipment.The edge vehicle nodes are determined by simple algorithm of dening distance and resources,and the improved RSA encryption algorithm is used to encrypt the user information.The improved RSA algorithm encrypts the user information by reencrypting the encryption parameters.Compared with the traditional RSA algorithm,it can resist more attacks,so it is used to ensure the security of user information.It can not only protect the privacy of vehicles,but also avoid anonymous abuse.Simulation results show that the proposed scheme has lower computational complexity and communication overhead than the traditional anonymous scheme.

An Enhanced Direct Anonymous Attestation Scheme with Mutual Authentication for Network-Connected UAV Communication Systems

In network-connected UAV(NCUAV) communication systems, user authentication is replaced by platform identity authentication and integrity check because many NC-UAVs are operated without human intervention. Direct anonymous attestation(DAA) is an attractive cryptographic scheme that provides an elegant balance between platform authentication and anonymity. However, because of the low-level computing capability and limited transmission bandwidth in UAV, the existing DAA schemes are not suitable for NC-UAV communication systems. In this paper, we propose an enhanced DAA scheme with mutual authentication(MA-DAA scheme), which meets the security requirements of NC-UAV communication systems. The proposed MA-DAA scheme, which is based on asymmetric pairings, bundles the identities of trusted platform module(TPM) and Host to solve the malicious module changing attacks. Credential randomization, batch proof and verification, and mutual authentication are realized in the MA-DAA scheme. The computational workload in TPM and Host is reduced in order to meet the low computation and resource requirements in TPM and Host.The entire scheme and protocols are presented,and the security and efficiency of the proposed MA-DAA scheme are proved and analyzed.Our experiment results also confirm the high efficiency of the proposed scheme.

A Method to Implement Full Anonymous Attestation for Trusted Computing Platform

Trusted computing （TC） technology is brought out by trusted computing group （TCG） to make computing as safe and reliable as people expect. Attestation is one main function specified by TCG, which is the means by which a trusted computer assures a remote computer whose platform is not tampered with. There are two protocols that implement attestation without disclosing the platform＇s real identity, which are Privacy CA-based protocol and direct anonymous attestation （DAA） protocol. However, in the first protocol the privacy CA is the bottleneck and the platform＇s identity will be disclosed if the privacy CA is compromise, while DAA protocol can do profiling when dealing with rogue hardware device. In this paper, we propose a DAA-extended new approach to ensure full anonymous attestation that can not only detect a rogue TPM, but also reveal rogue TPM＇s real identity.

Anonymous voting for multi-dimensional CV quantum system

We investigate the design of anonymous voting protocols,CV-based binary-valued ballot and CV-based multi-valued ballot with continuous variables（CV） in a multi-dimensional quantum cryptosystem to ensure the security of voting procedure and data privacy.The quantum entangled states are employed in the continuous variable quantum system to carry the voting information and assist information transmission,which takes the advantage of the GHZ-like states in terms of improving the utilization of quantum states by decreasing the number of required quantum states.It provides a potential approach to achieve the efficient quantum anonymous voting with high transmission security,especially in large-scale votes.

对于中国传统服装“开裆裤”的调查与研究——应用Anonymous Design为卧床癌病患者设计的下装研究

本文是日本学术振兴会科学研究费基金项目中以“应用Anonymous Design来为卧床癌症患者设计的下装研究”阶段性成果。在这项研究中,笔者于2019年2月对中国开裆裤进行了实物调研。开裆裤通常被认为是幼儿使用的、裆部有开口的裤子,其原型具有很悠久的历史,有不同的样式。关于Anonymous Design,没有统一的定义,笔者在这项研究中将其界定为“没有特定的作者或设计师设计过的物品。典型的例子如传统服装,它是前人的创造力与智慧的结果、产物、或行为。虽质朴但其易于使用的功能性得以长期被沿用,现代人认为“理所当然”的事物原点”。开裆裤完全符合笔者定义的Anonymous Design。本文主要论述笔者在中国进行的开裆裤调研成果,以及整理归纳开裆裤的结构和款式,并提出开裆裤的设计具有“卧床癌症患者使用的下装”所需的应用可能性。

An Anonymous Authentication Scheme for Plugin Electric Vehicles Joining to Charging/Discharging Station in Vehicle-to-Grid(V2G) Networks

Incorporating electric vehicles into smart grid,vehicle-to-Grid(V2G) makes it feasible to charge for large-scale electric vehicles,and in turn support electric vehicles,as mobile and distributed storage units,to discharge to smart grid.In order to provide reliable and efficient services,the operator of V2 G networks needs to monitor realtime status of every plug-in electric vehicle(PEV) and then evaluate current electricity storage capability.Anonymity,aggregation and dynamic management are three basic but crucial characteristics of which the services of V2 G networks should be.However,few of existing authentication schemes for V2 G networks could satisfy them simultaneously.In this paper,we propose a secure and efficient authentication scheme with privacy-preserving for V2 G networks.The scheme makes the charging/discharging station authenticate PEVs anonymously and manage them dynamically.Moreover,the monitoring data collected by the charging/discharging station could be sent to a local aggregator(LAG)in batch mode.In particular,time overheads during verification stage are independent with the number of involved PEVs,and there is no need to update the membership certificate and key pair before PEV logs out.

Characterization of 14 anonymous nuclear loci in Pinus thunbergii and their cross-species transferability

We characterized 14 anonymous nuclear loci from Pinus thunbergii Parl., an important pine species native to Japan. One hundred and twenty-six single nucleotide polymorphisms （SNPs） were identified from these loci, giving a frequency of 1 SNP per 51 bp. Nucleotide di- versity （0） ranged from 1.06 × 10^-3 to 11.87 × 10^-3, with all average of 4.99 × 10^-3. Only one locus （mK45） deviated significantly from the Hardy-Weinberg equilibrium. Thirteen of 14 loci were applicable in other pine species. These loci will be useful for nucleotide variation studies and will provide material for SNP-based marker development in P. thun- bergii and related species.

Chaotic maps and biometrics-based anonymous three-party authenticated key exchange protocol without using passwords

In three-party password authenticated key exchange （AKE） protocol, since two users use their passwords to establish a secure session key over an insecure communication channel with the help of the trusted server, such a protocol may suffer the password guessing attacks and the server has to maintain the password table. To eliminate the shortages of password- based AKE protocol, very recently, according to chaotic maps, Lee et al. [2015 Nonlinear Dyn. 79 2485] proposed a first three-party-authenticated key exchange scheme without using passwords, and claimed its security by providing a well- organized BAN logic test. Unfortunately, their protocol cannot resist impersonation attack, which is demonstrated in the present paper. To overcome their security weakness, by using chaotic maps, we propose a biometrics-based anonymous three-party AKE protocol with the same advantages. Further, we use the pi calculus-based formal verification tool ProVerif to show that our AKE protocol achieves authentication, security and anonymity, and an acceptable efficiency.

An Anonymous Payment Protocol withMobile Agents in Hostile Environments

By using Pedersen's verifiable secret sharing scheme and the theory of crossvalidation, we propose an a-nonymous payment protocol which have following features: protecting theconfidentiality of sensitive payment information from spying by malicioushosts; using a trustedthird party in a minimal way; verifying the validity of the share by the merchant; allowing agent toverify that the product which it is a-bout to receive is the one it is paying for; keeping thecustomer anonymous.

Anonymous data collection scheme for cloud-aided mobile edge networks

With the rapid spread of smart sensors,data collection is becoming more and more important in Mobile Edge Networks(MENs).The collected data can be used in many applications based on the analysis results of these data by cloud computing.Nowadays,data collection schemes have been widely studied by researchers.However,most of the researches take the amount of collected data into consideration without thinking about the problem of privacy leakage of the collected data.In this paper,we propose an energy-efficient and anonymous data collection scheme for MENs to keep a balance between energy consumption and data privacy,in which the privacy information of senors is hidden during data communication.In addition,the residual energy of nodes is taken into consideration in this scheme in particular when it comes to the selection of the relay node.The security analysis shows that no privacy information of the source node and relay node is leaked to attackers.Moreover,the simulation results demonstrate that the proposed scheme is better than other schemes in aspects of lifetime and energy consumption.At the end of the simulation part,we present a qualitative analysis for the proposed scheme and some conventional protocols.It is noteworthy that the proposed scheme outperforms the existing protocols in terms of the above indicators.

OBLIVIOUS TRANSFER WITH ACCESS CONTROL AND IDENTITY-BASED ENCRYPTION WITH ANONYMOUS KEY ISSUING

In ACM'CCS 2009,Camenisch,et al.proposed the Oblivious Transfer with Access Control(AC-OT) in which each item is associated with an attribute set and can only be available,on request,to the users who have all the attributes in the associated set.Namely,AC-OT achieves access control policy for conjunction of attributes.Essentially,the functionality of AC-OT is equivalent to the sim-plified version that we call AC-OT-SV:for each item,one attribute is associated with it,and it is requested that only the users who possess the associated attribute can obtain the item by queries.On one hand,AC-OT-SV is a special case of AC-OT when there is just one associated attribute with each item.On the other hand,any AC-OT can be realized by an AC-OT-SV.In this paper,we first present a concrete AC-OT-SV protocol which is proved to be secure in the model defined by Camenisch,et al..Then from the protocol,interestingly,a concrete Identity-Based Encryption(IBE) with Anonymous Key Issuing(AKI) is given which is just a direct application to AC-OT-SV.By comparison,we show that the AKI protocol we present is more efficient in communications than that proposed by Chow.

Anonymous and Unlinkable Membership Authentication with Illegal Privilege Transfer Detection

Anonymous authentication schemes, mostly based on the notion of group signatures, allow a group member to obtain membership from a server and gain access rights if the member can prove their authenticity to the verifier. However, existing authentication schemes are impractical because they neglect to provide an exclusive verification of the blacklist. In addition, the schemes are unaware of malicious members who are involved in privilege transferring. In this paper, a novel membership authentication scheme providing detection of membership transfer and proof of membership exclusiveness to the blacklist is proposed.

Data Anonymous Authentication for BIoMT with Proxy Group Signature

Along with the increase of wearable medical device,the privacy leakage problem in the process of transmission between these edge medical devices.The blockchain-enabled Internet of Medical Things(BIoMT)has been developed to reform traditional centralized medical system in recent years.This paper first introduces a data anonymous authentication model to protect user privacy and medical data in BIoMT.Then,a proxy group signature(PGS)scheme has been proposed based on lattice assumption.This scheme can well satisfy the anonymous authentication demand for the proposed model,and provide anti-quantum attack security for BIoMT in the future general quantum computer age.Moreover,the security analysis shows this PGS scheme is secure against the dynamical-almost-full anonymous and traceability.The efficiency comparison shows the proposed model and PGS scheme is more efficient and practical.

Security Considerations on Three-Factor Anonymous Authentication Scheme for WSNs

Wireless sensor networks (WSNs) are used to monitor various environmental conditions including movement, pollution level, temperature, humidity, and etc. Secure authentication is very important for the success of WSNs. Li et al. proposed a three-factor anonymous authentication scheme in WSNs over Internet of things (IoT). They argued that their authentication scheme achieves more security and functional features, which are required for WSNs over IoT. Especially, they insisted that their user authentication scheme provides security against sensor node impersonation attack, and resists session-specific temporary information attack and various other attacks. However, this paper shows some security weaknesses in Li et al.’s scheme, especially focused on sensor node masquerading attack, known session-specific temporary information attack and deficiency of perfect forward secrecy. Especially, security considerations are very important to the modern IoT based applications. Thereby, the result of this paper could be very helpful for the IoT security researches.