Witness Hiding Proofs and Applications

Witness hiding is a basic requirement for most cryptology protocols. The concept was proposed by Feige and Shamir several years ago. This thesis concentrates on witness hiding protocols and its applications.The possibility to divert a witness hiding protocol parallelly had been an open problem for some time. The parallel divertibility is not only of theoretical significance but also a crucial point for the security of some applications, for example, electronic cash, digital signatures, etc. It is proved, in this thesis, that with limited computational power, it is impossible to divert a witness hiding protocol parallelly to two independent verifiers with large probability.The thesis explores the applications of witness hiding protocols in anonymous credentials, election schemes, and group signatures. In an anonymous credential system, one user may have many pseudonyms. The credentials issued on one of a user's pseudonyms can be transferred to other pseudonyms by the user without revealing the links between pseudonyms. Election, as a practical model, is formally defined. Two election schemes are proposed and discussed. Especially the voting scheme is parallelized with electronic cash system so that some new tool can be introduced. Group signature is a kind of digital signature for a group of people such that only members of the group can sign messages on behalf of the group and without revealing which member has signed. But the signer can be identified by either an authority or a certain number of group members who hold some kind of auxiliary information. The new group signature schemes, based on witness hiding proofs, have several advantages, compared with the original scheme proposed by Chaum and Heijst. The most important improvement is that the signers can be identified by a majority of group members, which had been a open problem in the literature. In this thesis, some theoretical results about bounds of secret keys and auxiliary information have been proved

Optimized thermoelectric properties of Mo_3Sb_(7-x)Te_x with significant phonon scattering by electrons

Heavily doped compounds Mo_3Sb_(7−x)Te_x (x = 0, 1.0, 1.4, 1.8) were synthesized by solid state reaction and sintered by spark plasma sintering. Both X-ray diffraction and electron probe microanalysis indicated the maximum solubility of Te was around x = 1.8. The trends in the electrical transport properties can generally be understood using a single parabolic band model, which predicts that the extremely high carrier concentration of Mo_3Sb_7 (~10^(22) cm^(−3)) can be reduced to a nearly optimized level (~2 × 10^(21) cm^(−3)) for thermoelectric figure of merit (zT) by Te-substitution with x = 1.8. The increased lattice thermal conductivity by Te-doping was found to be due to the decreased Umklapp and electron–phonon scattering, according to a Debye model fitting. The thermoelectric figure of merit (zT) monotonously increased with increasing temperature and reached its highest value of about 0.51 at 850 K for the sample with x = 1.8, making these materials competitive with the state-of-the-art thermoelectric SiGe alloys. Evidence of significant electron–phonon scattering is found in the thermal conductivity

Group Signatures: Unconditional Security for Members

First a detailed definition of group signatures, originally suggested by Chaum and van {Heijst}, is given. Such signatures allow members of a group to sign messages anonymously on behalf of the group subject to the constraint that, in case of disputes later on, a designated authority can identify the signer. It is shown that if such schemes are to provide information theoretic anonymity, then the length of the secret information of the members and the authority increases with the number of members and the number of signatures each member is allowed to make. A dynamic scheme meeting these lower bounds is described. Unlike previous suggestions it protects each member unconditionally against framing, i.e.\ being held responsible for a signature made by someone else

Plastic Inorganic Semiconductors for Flexible Electronics

Featured with bendability and deformability, smartness and lightness, flexible materials and devices have wide applications in electronics, optoelectronics, and energy utilization. The key for flexible electronics is the integration of flexibility and decent electrical performance of semiconductors. It has long been realized that high-performance inorganic semiconductors are brittle, and the thinning-down-induced flexibility does not change the intrinsic brittleness. This inconvenient fact severely restricts the fabrication and service of inorganic semiconductors in flexible and deformable electronics. By contrast, flexible and soft polymers can be readily deformed but behave poorly in terms of electrical properties. Recently, Ag2S was discovered as the room-temperature ductile inorganic semiconductor. The intrinsic flexibility and plasticity of Ag2S are attributed to multicentered chemical bonding and solid linkage among easy slip planes. Furthermore, the electrical and thermoelectric properties of Ag2S can be readily optimized by Se/Te alloying while the ductility is maintained, giving birth to a high-efficiency full inorganic flexible thermoelectric device. This chapter briefly reviews this big discovery, relevant backgrounds, and research advances and tries to demonstrate a clear structure-performance correlation between crystal structure/chemical bonding and mechanical/electrical properties

Exploring the Potential of Large Language Models in Computational Argumentation

Computational argumentation has become an essential tool in various fields, including artificial intelligence, law, and public policy. It is an emerging research field in natural language processing (NLP) that attracts increasing attention. Research on computational argumentation mainly involves two types of tasks: argument mining and argument generation. As large language models (LLMs) have demonstrated strong abilities in understanding context and generating natural language, it is worthwhile to evaluate the performance of LLMs on various computational argumentation tasks. This work aims to embark on an assessment of LLMs, such as ChatGPT, Flan models and LLaMA2 models, under zero-shot and few-shot settings within the realm of computational argumentation. We organize existing tasks into 6 main classes and standardise the format of 14 open-sourced datasets. In addition, we present a new benchmark dataset on counter speech generation, that aims to holistically evaluate the end-to-end performance of LLMs on argument mining and argument generation. Extensive experiments show that LLMs exhibit commendable performance across most of these datasets, demonstrating their capabilities in the field of argumentation. We also highlight the limitations in evaluating computational argumentation and provide suggestions for future research directions in this field

A Differential Private Method for Distributed Optimization in Directed Networks via State Decomposition

In this paper, we study the problem of consensus-based distributed optimization where a network of agents, abstracted as a directed graph, aims to minimize the sum of all agents' cost functions collaboratively. In existing distributed optimization approaches (Push-Pull/AB) for directed graphs, all agents exchange their states with neighbors to achieve the optimal solution with a constant stepsize, which may lead to the disclosure of sensitive and private information. For privacy preservation, we propose a novel state-decomposition based gradient tracking approach (SD-Push-Pull) for distributed optimzation over directed networks that preserves differential privacy, which is a strong notion that protects agents' privacy against an adversary with arbitrary auxiliary information. The main idea of the proposed approach is to decompose the gradient state of each agent into two sub-states. Only one substate is exchanged by the agent with its neighbours over time, and the other one is kept private. That is to say, only one substate is visible to an adversary, protecting the privacy from being leaked. It is proved that under certain decomposition principles, a bound for the sub-optimality of the proposed algorithm can be derived and the differential privacy is achieved simultaneously. Moreover, the trade-off between differential privacy and the optimization accuracy is also characterized. Finally, a numerical simulation is provided to illustrate the effectiveness of the proposed approach