75 research outputs found
Efficient Zero-Knowledge Proofs and Applications
Zero-knowledge proofs provide a means for a prover to convince a verifier that some claim is true and nothing more. The ability to prove statements while conveying zero information beyond their veracity has profound implications for cryptography and, especially, for its applicability to privacy-enhancing technologies. Unfortunately, the most common zero-knowledge techniques in the literature suffer from poor scalability, which limits their usefulness in many otherwise promising applications. This dissertation addresses the problem of designing communication- and computation-efficient protocols for zero-knowledge proofs and arguments of propositions that comprise many "simple" predicates. In particular, we propose a new formal model in which to analyze batch zero-knowledge protocols and perform the first systematic study of systems for batch zero-knowledge proofs and arguments of knowledge. In the course of this study, we suggest a general construction for batch zero-knowledge proof systems and use it to realize several new protocols suitable for proving knowledge of and relationships among large batches of discrete logarithm (DL) representations in prime-order groups. Our new protocols improve on existing protocols in several ways; for example, among the new protocols is one with lower asymptotic computation cost than any other such system in the literature. We also tackle the problem of constructing batch proofs of partial knowledge, proposing new protocols to prove knowledge of a DL that is equal to at least k-out-of-n other DLs, at most k-out-of-n other DLs, or exactly k-out-of-n other DLs. These constructions are particularly interesting as they prove some propositions that appear difficult to prove using existing techniques, even when efficiency is not a primary consideration. We illustrate the applicability of our new techniques by using them to construct efficient protocols for anonymous blacklisting and reputation systems
Practical unconditionally secure signature schemes and related protocols
The security guarantees provided by digital signatures are vital to many modern applications such as online banking, software distribution, emails and many more. Their ubiquity across digital communications arguably makes digital signatures one of the most important inventions in cryptography. Worryingly, all commonly used schemes – RSA, DSA and ECDSA – provide only computational security, and are rendered completely insecure by quantum computers. Motivated by this threat, this thesis focuses on unconditionally secure signature (USS) schemes – an information theoretically secure analogue of digital signatures. We present and analyse two new USS schemes. The first is a quantum USS scheme that is both information-theoretically secure and realisable with current technology. The scheme represents an improvement over all previous quantum USS schemes, which were always either realisable or had a full security proof, but not both. The second is an entirely classical USS scheme that uses minimal resources and is vastly more efficient than all previous schemes, to such an extent that it could potentially find real-world application. With the discovery of such an efficient classical USS scheme using only minimal resources, it is difficult to see what advantage quantum USS schemes may provide. Lastly, we remain in the information-theoretic security setting and consider two quantum protocols closely related to USS schemes – oblivious transfer and quantum money. For oblivious transfer, we prove new lower bounds on the minimum achievable cheating probabilities in any 1-out-of-2 protocol. For quantum money, we present a scheme that is more efficient and error tolerant than all previous schemes. Additionally, we show that it can be implemented using a coherent source and lossy detectors, thereby allowing for the first experimental demonstration of quantum coin creation and verification
Security and privacy in RFID systems
Vu que les tags RFID sont actuellement en phase de large déploiement dans le cadre de plusieurs applications (comme les paiements automatiques, le contrôle d'accès à distance, et la gestion des chaînes d approvisionnement), il est important de concevoir des protocoles de sécurité garantissant la protection de la vie privée des détenteurs de tags RFID. Or, la conception de ces protocoles est régie par les limitations en termes de puissance et de calcul de la technologie RFID, et par les modèles de sécurité qui sont à notre avis trop forts pour des systèmes aussi contraints que les tags RFID. De ce fait, on limite dans cette thèse le modèle de sécurité; en particulier, un adversaire ne peut pas observer toutes les interactions entre tags et lecteurs. Cette restriction est réaliste notamment dans le contexte de la gestion des chaînes d approvisionnement qui est l application cible de ce travail. Sous cette hypothèse, on présente quatre protocoles cryptographiques assurant une meilleure collaboration entre les différents partenaires de la chaîne d approvisionnement. D abord, on propose un protocole de transfert de propriété des tags RFID, qui garantit l authentification des tags en temps constant alors que les tags implémentent uniquement des algorithmes symétriques, et qui permet de vérifier l'authenticité de l origine des tags. Ensuite, on aborde le problème d'authenticité des produits en introduisant deux protocoles de sécurité qui permettent à un ensemble de vérificateurs de vérifier que des tags sans capacité de calcul ont emprunté des chemins valides dans la chaîne d approvisionnement. Le dernier résultat présenté dans cette thèse est un protocole d appariement d objets utilisant des tags sans capacité de calcul , qui vise l automatisation des inspections de sécurité dans la chaîne d approvisionnement lors du transport des produits dangereux. Les protocoles introduits dans cette thèse utilisent les courbes elliptiques et les couplages bilinéaires qui permettent la construction des algorithmes de signature et de chiffrement efficaces, et qui minimisent donc le stockage et le calcul dans les systèmes RFID. De plus, la sécurité de ces protocoles est démontrée sous des modèles formels bien définis qui prennent en compte les limitations et les contraintes des tags RFID, et les exigences strictes en termes de sécurité et de la protection de la vie privée des chaines d approvisionnement.While RFID systems are one of the key enablers helping the prototype of pervasive computer applications, the deployment of RFID technologies also comes with new privacy and security concerns ranging from people tracking and industrial espionage to produ ct cloning and denial of service. Cryptographic solutions to tackle these issues were in general challenged by the limited resources of RFID tags, and by the formalizations of RFID privacy that are believed to be too strong for such constrained devices. It follows that most of the existing RFID-based cryptographic schemes failed at ensuring tag privacy without sacrificing RFID scalability or RFID cost effectiveness. In this thesis, we therefore relax the existing definitions of tag privacy to bridge the gap between RFID privacy in theory and RFID privacy in practice, by assuming that an adversary cannot continuously monitor tags. Under this assumption, we are able to design sec ure and privacy preserving multi-party protocols for RFID-enabled supply chains. Namely, we propose a protocol for tag ownership transfer that features constant-time authentication while tags are only required to compute hash functions. Then, we tackle the problem of product genuineness verification by introducing two protocols for product tracking in the supply chain that rely on storage only tags. Finally, we present a solution for item matching that uses storage only tags and aims at the automation of safety inspections in the supply chain.The protocols presented in this manuscript rely on operations performed in subgroups of elliptic curves that allow for the construction of short encryptions and signatures, resulting in minimal storage requirements for RFID tags. Moreover, the privacy and the security of these protocols are proven under well defined formal models that take into account the computational limitations of RFID technology and the stringent privacy and security requirements of each targeted supply chain application.PARIS-Télécom ParisTech (751132302) / SudocSudocFranceF
Recommended from our members
A study of the environmental consciousness of small and medium-sized enterprises in the United Kingdom and Germany
Business enterprise produces goods and services through the orchestration of factors of production defined in essence by human consumption behaviour. The production and consumption of goods and services are also associated with environmental problems. These socially constructed problems, regardless of the implied incontrovertibility of their dangers, have drawn attention to the importance of sustainable development models as a means of minimising ecological risk. As a consequence of the ecological aspects of business enterprise and its interrelations between the social and physical environment the firm and corporate management have become focus points of attempts to ameliorate environmental change.
The ecological orientation of companies can be defined through their internal, social and economic characteristics as well as psychological factors, which are germane to corporate objectives. The development of corporate ecological orientations is on one hand dependent upon actual or anticipated external changes acting upon the operating frameworks of a firm and on the other hand the existence of relevant management values and intentions expressed through their strategic planning process.
In this research key features of the notion of environmental consciousness are identified and employed to investigate the corporate environmental consciousness of small and medium-sized enterprises in the United Kingdom and Germany. Environmental consciousness comprises cognitive, affective and conative aspects. Accordingly, the research involves an empirical examination of corporate values, attitudes towards environmental commitments and environmental action within firms. The examination is contextualised by socio-economic factors in which business enterprise is conducted in selected industry sectors within the United Kingdom and Germany. The study concludes with a synthesis of the research findings on environmental management practice and experiences of SMEs in each country
Privacy when Everyone is Watching: An SOK on Anonymity on the Blockchain
Blockchain technologies rely on a public ledger, where typically all transactions are pseudoanonymous
and fully traceable. This poses a major flaw in its large scale adoption of cryptocurrencies, the primary
application of blockchain technologies, as most individuals do not want to disclose their finances to the pub-
lic. Motivated by the explosive growth in private-Blockchain research, this Statement-of-Knowledge (SOK)
explores the ways to obtain privacy in this public ledger ecosystem. The authors first look at the underly-
ing technology underling all zero-knowledge applications on the blockchain: zk-SNARKs (zero-knowledge
Succinct Non-interactive ARguments of Knowledge). We then explore the two largest privacy coins as of
today, ZCash and Monero, as well as TornadoCash, a popular Ethereum Tumbler solution. Finally, we look at
the opposing incentives behind privacy solutions and de-anonymization techniques, and the future of privacy
on the blockchain
Political information, elections and public policy
This thesis contributes to the study of the role of information in elections and public
policy formation. Its main focus is on information acquisition and voting behaviour.
Chapter 1 discusses the motivation of this research and presents a survey of related
literature. Chapter 2 focuses on electoral turnout, Chapter 3 on public policy, and
Chapter 4 on mass media.
Chapter 2 studies the impact of information on electoral turnout. Since incentives to
be informed are correlated with other incentives to participate in public life, a model
of information acquisition and turnout is introduced to isolate potential instrumental
variables and try to establish a causal relation. Results are tested on the 1997 General
Election in Britain. It is shown that information, as well as ideology, matters for
turnout. It also contributes to explain the systematic correlation of turnout with
variables like education and income. Voters' knowledge of candidates and of other
political issues is also substantially influenced by mass media.
Chapter 3 presents a model that links the distribution of political knowledge with
redistributive policies. It argues that voters can have private incentives to be informed
about politics and that such incentives are correlated with income. Therefore
redistribution will be systematically lower than what the median voter theorem
predicts. Moreover, more inequality does not necessarily lead to an increase in
redistribution and constitutional restrictions might have unintended consequences.
In Chapter 4 it is argued that instrumentally motivated voters should increase their
demand for information when elections are close. In supplying news, mass media
should take into account information demand, as well as the value of customers to
advertisers and the cost of reaching marginal readers. Information supply should
therefore be larger in electoral constituencies where the contest is expected to be
closer, the population is on average more valuable for advertisers, and the population
density is higher. These conclusions are then tested with good results on data from the
1997 General Election in Britain
- …