Hidden Cosets and Applications to Unclonable Cryptography
نویسندگان
چکیده
In 2012, Aaronson and Christiano introduced the idea of hidden subspace states to build public-key quantum money [STOC ’12]. Since then, this has been applied realize several other cryptographic primitives which enjoy some form unclonability.
منابع مشابه
Communicating by Cosets and Applications to Broadcast
We describe a constructive coset-based coding framework for the general broadcast problem. Our construction is inspired by the information-theoretic framework of Marton [16], who used the concept of random binning to provide the best-known achievable broadcast region to date. Our approach leverages our recent coset-based construction for the Slepian-Wolf coding problem. The key enabling idea is...
متن کاملDigital Physical Unclonable Functions: Architecture and Applications
of the Thesis Digital Physical Unclonable Functions: Architecture and Applications
متن کاملPhysically Unclonable Functions:Constructions, Properties and Applications
Physically unclonable functions or PUFs are innovative physical security primitives which produce unclonable and inherent instance-specific measurements of physical objects; PUFs are in many ways the inanimate equivalent of biometrics for human beings. Since they are able to securely generate and store secrets, PUFs allow to bootstrap the physical implementation of an information security syste...
متن کاملHardware-Based Public-Key Cryptography with Public Physically Unclonable Functions
A physically unclonable function (PUF) is a multiple-input, multipleoutput, large entropy physical system that is unreproducible due to its structural complexity. A public physically unclonable function (PPUF) is a PUF that is created so that its simulation is feasible but requires very large time even when ample computational resources are available. Using PPUFs, we have developed conceptually...
متن کاملon group rings and some of their applications to combinatorics and symmetric cryptography
we give a survey of recent applications of group rings to combinatorics and tocryptography, including their use in the di erential cryptanalysis of block ciphers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-84242-0_20