1956 lines
165 KiB
BibTeX
1956 lines
165 KiB
BibTeX
|
||
@incollection{canteaut_psi_2020,
|
||
location = {Cham},
|
||
title = {{PSI} from {PaXoS}: Fast, Malicious Private Set Intersection},
|
||
volume = {12106},
|
||
isbn = {978-3-030-45723-5 978-3-030-45724-2},
|
||
url = {https://link.springer.com/10.1007/978-3-030-45724-2_25},
|
||
shorttitle = {{PSI} from {PaXoS}},
|
||
abstract = {We present a 2-party private set intersection ({PSI}) protocol which provides security against malicious participants, yet is almost as fast as the fastest known semi-honest {PSI} protocol of Kolesnikov et al. ({CCS} 2016).},
|
||
pages = {739--767},
|
||
booktitle = {Advances in Cryptology – {EUROCRYPT} 2020},
|
||
publisher = {Springer International Publishing},
|
||
author = {Pinkas, Benny and Rosulek, Mike and Trieu, Ni and Yanai, Avishay},
|
||
editor = {Canteaut, Anne and Ishai, Yuval},
|
||
urldate = {2023-01-17},
|
||
date = {2020},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-030-45724-2_25},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {2020_Pinkas et al_PSI from PaXoS.pdf:/home/jaseg/Sync/Research/Zotero/2020_Pinkas et al_PSI from PaXoS.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{christin_scaling_2014,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Scaling Private Set Intersection to Billion-Element Sets},
|
||
volume = {8437},
|
||
isbn = {978-3-662-45471-8 978-3-662-45472-5},
|
||
url = {http://link.springer.com/10.1007/978-3-662-45472-5_13},
|
||
abstract = {We examine the feasibility of private set intersection ({PSI}) over massive datasets. {PSI}, which allows two parties to find the intersection of their sets without revealing them to each other, has numerous applications including to privacy-preserving data mining, location-based services and genomic computations. Unfortunately, the most efficient constructions only scale to sets containing a few thousand elements—even in the semi-honest model and over a {LAN}.},
|
||
pages = {195--215},
|
||
booktitle = {Financial Cryptography and Data Security},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
author = {Kamara, Seny and Mohassel, Payman and Raykova, Mariana and Sadeghian, Saeed},
|
||
editor = {Christin, Nicolas and Safavi-Naini, Reihaneh},
|
||
urldate = {2023-01-17},
|
||
date = {2014},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-662-45472-5_13},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {2014_Kamara et al_Scaling Private Set Intersection to Billion-Element Sets.pdf:/home/jaseg/Sync/Research/Zotero/2014_Kamara et al_Scaling Private Set Intersection to Billion-Element Sets.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{uzun_cryptographic_2021,
|
||
location = {Virtual Event Hong Kong},
|
||
title = {Cryptographic Key Derivation from Biometric Inferences for Remote Authentication},
|
||
isbn = {978-1-4503-8287-8},
|
||
url = {https://dl.acm.org/doi/10.1145/3433210.3437512},
|
||
doi = {10.1145/3433210.3437512},
|
||
eventtitle = {{ASIA} {CCS} '21: {ACM} Asia Conference on Computer and Communications Security},
|
||
pages = {629--643},
|
||
booktitle = {Proceedings of the 2021 {ACM} Asia Conference on Computer and Communications Security},
|
||
publisher = {{ACM}},
|
||
author = {Uzun, Erkam and Yagemann, Carter and Chung, Simon and Kolesnikov, Vladimir and Lee, Wenke},
|
||
urldate = {2023-01-17},
|
||
date = {2021-05-24},
|
||
langid = {english},
|
||
}
|
||
|
||
@article{heath_gram_nodate,
|
||
title = {{GRAM} with O(log2 n) Overhead},
|
||
abstract = {Garbled {RAM} ({GRAM}) is a powerful technique introduced by Lu and Ostrovsky that equips Garbled Circuit ({GC}) with a sublinear cost {RAM} without adding rounds of interaction. While multiple {GRAM} constructions are known, none are suitable for practice, due to costs that have high constants and poor scaling.},
|
||
author = {Heath, David and Kolesnikov, Vladimir and Ostrovsky, Rafail},
|
||
langid = {english},
|
||
file = {Heath et al_GRAM with O(log2 n) Overhead.pdf:/home/jaseg/Sync/Research/Zotero/Heath et al_GRAM with O(log2 n) Overhead.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{cominelli_even_2020,
|
||
location = {San Francisco, {CA}, {USA}},
|
||
title = {Even Black Cats Cannot Stay Hidden in the Dark: Full-band De-anonymization of Bluetooth Classic Devices},
|
||
isbn = {978-1-72813-497-0},
|
||
url = {https://ieeexplore.ieee.org/document/9152700/},
|
||
doi = {10.1109/SP40000.2020.00091},
|
||
shorttitle = {Even Black Cats Cannot Stay Hidden in the Dark},
|
||
eventtitle = {2020 {IEEE} Symposium on Security and Privacy ({SP})},
|
||
pages = {534--548},
|
||
booktitle = {2020 {IEEE} Symposium on Security and Privacy ({SP})},
|
||
publisher = {{IEEE}},
|
||
author = {Cominelli, Marco and Gringoli, Francesco and Patras, Paul and Lind, Margus and Noubir, Guevara},
|
||
urldate = {2023-01-19},
|
||
date = {2020-05},
|
||
file = {Cominelli et al_2020_Even Black Cats Cannot Stay Hidden in the Dark.pdf:/home/jaseg/Sync/Research/Zotero/Cominelli et al_2020_Even Black Cats Cannot Stay Hidden in the Dark.pdf:application/pdf},
|
||
}
|
||
|
||
@article{sculley_machine_nodate,
|
||
title = {Machine Learning: The High-Interest Credit Card of Technical Debt},
|
||
abstract = {Machine learning offers a fantastically powerful toolkit for building complex systems quickly. This paper argues that it is dangerous to think of these quick wins as coming for free. Using the framework of technical debt, we note that it is remarkably easy to incur massive ongoing maintenance costs at the system level when applying machine learning. The goal of this paper is highlight several machine learning specific risk factors and design patterns to be avoided or refactored where possible. These include boundary erosion, entanglement, hidden feedback loops, undeclared consumers, data dependencies, changes in the external world, and a variety of system-level anti-patterns.},
|
||
author = {Sculley, D and Holt, Gary and Golovin, Daniel and Davydov, Eugene and Phillips, Todd and Ebner, Dietmar and Chaudhary, Vinay and Young, Michael},
|
||
langid = {english},
|
||
file = {Sculley et al_Machine Learning.pdf:/home/jaseg/Sync/Research/Zotero/Sculley et al_Machine Learning.pdf:application/pdf},
|
||
}
|
||
|
||
@article{tyagi_orca_nodate,
|
||
title = {Orca: Blocklisting in Sender-Anonymous Messaging},
|
||
abstract = {Sender-anonymous end-to-end encrypted messaging allows sending messages to a recipient without revealing the sender’s identity to the messaging platform. Signal recently introduced a sender anonymity feature that includes an abuse mitigation mechanism meant to allow the platform to block malicious senders on behalf of a recipient.},
|
||
author = {Tyagi, Nirvan and Len, Julia and Miers, Ian and Ristenpart, Thomas},
|
||
langid = {english},
|
||
file = {Tyagi et al_Orca.pdf:/home/jaseg/Sync/Research/Zotero/Tyagi et al_Orca.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{wang_ghosttalk_2022,
|
||
title = {{GhostTalk}: Interactive Attack on Smartphone Voice System Through Power Line},
|
||
url = {http://arxiv.org/abs/2202.02585},
|
||
doi = {10.14722/ndss.2022.24254},
|
||
shorttitle = {{GhostTalk}},
|
||
abstract = {Inaudible voice command injection is one of the most threatening attacks towards voice assistants. Existing attacks aim at injecting the attack signals over the air, but they require the access to the authorized user’s voice for activating the voice assistants. Moreover, the effectiveness of the attacks can be greatly deteriorated in a noisy environment. In this paper, we explore a new type of channel, the power line side-channel, to launch the inaudible voice command injection. By injecting the audio signals over the power line through a modified charging cable, the attack becomes more resilient against various environmental factors and liveness detection models. Meanwhile, the smartphone audio output can be eavesdropped through the modified cable, enabling a highly-interactive attack.},
|
||
booktitle = {Proceedings 2022 Network and Distributed System Security Symposium},
|
||
author = {Wang, Yuanda and Guo, Hanqing and Yan, Qiben},
|
||
urldate = {2023-02-24},
|
||
date = {2022},
|
||
langid = {english},
|
||
eprinttype = {arxiv},
|
||
eprint = {2202.02585 [cs]},
|
||
keywords = {Computer Science - Cryptography and Security, dumb},
|
||
file = {2022_Wang et al_GhostTalk.pdf:/home/jaseg/Sync/Research/Zotero/2022_Wang et al_GhostTalk.pdf:application/pdf},
|
||
}
|
||
|
||
@article{ruchti_when_2022,
|
||
title = {When the Decoder Has to Look Twice: Glitching a {PUF} Error Correction},
|
||
rights = {Copyright (c) 2022 Jonas Ruchti, Michael Gruber, Michael Pehl},
|
||
issn = {2569-2925},
|
||
url = {https://tches.iacr.org/index.php/TCHES/article/view/9694},
|
||
doi = {10.46586/tches.v2022.i3.26-70},
|
||
shorttitle = {When the Decoder Has to Look Twice},
|
||
abstract = {Physical Unclonable Functions ({PUFs}) have been increasingly used as an alternative to non-volatile memory for the storage of cryptographic secrets. Research on side channel and fault attacks with the goal of extracting these secrets has begun to gain interest but no fault injection attack targeting the necessary error correction within a {PUF} device has been shown so far. This work demonstrates one such attack on a hardware fuzzy commitment scheme implementation and thus shows a new potential attack threat existing in current {PUF} key storage systems. After presenting evidence for the overall viability of the profiled attack by performing it on an {FPGA} implementation, countermeasures are analysed: we discuss the efficacy of hashing helper data with the {PUF}-derived key to prevent the attack as well as codeword masking, a countermeasure effective against a side channel attack. The analysis shows the limits of these approaches. First, we demonstrate the criticality of timing in codeword masking by confirming the attack’s effectiveness on ostensibly protected hardware. Second, our work shows a successful attack without helper data manipulation and thus the potential for sidestepping helper data hashing countermeasures.},
|
||
pages = {26--70},
|
||
journaltitle = {{IACR} Transactions on Cryptographic Hardware and Embedded Systems},
|
||
author = {Ruchti, Jonas and Gruber, Michael and Pehl, Michael},
|
||
urldate = {2023-02-24},
|
||
date = {2022-06-08},
|
||
langid = {english},
|
||
keywords = {clock glitch, fault attack, fuzzy commitment scheme, masking, physical unclonable function, safe error attack},
|
||
file = {Ruchti et al_2022_When the Decoder Has to Look Twice.pdf:/home/jaseg/Sync/Research/Zotero/Ruchti et al_2022_When the Decoder Has to Look Twice.pdf:application/pdf},
|
||
}
|
||
|
||
@article{wang_ghosttouch_nodate,
|
||
title = {{GhostTouch}: Targeted Attacks on Touchscreens without Physical Touch},
|
||
abstract = {Capacitive touchscreens have become the primary humanmachine interface for personal devices such as smartphones and tablets. In this paper, we present {GhostTouch}, the first active contactless attack against capacitive touchscreens. {GhostTouch} uses electromagnetic interference ({EMI}) to inject fake touch points into a touchscreen without the need to physically touch it. By tuning the parameters of the electromagnetic signal and adjusting the antenna, we can inject two types of basic touch events, taps and swipes, into targeted locations of the touchscreen and control them to manipulate the underlying device. We successfully launch the {GhostTouch} attacks on nine smartphone models. We can inject targeted taps continuously with a standard deviation of as low as 14.6 × 19.2 pixels from the target area, a delay of less than 0.5s and a distance of up to 40mm. We show the real-world impact of the {GhostTouch} attacks in a few proofof-concept scenarios, including answering an eavesdropping phone call, pressing the button, swiping up to unlock, and entering a password. Finally, we discuss potential hardware and software countermeasures to mitigate the attack.},
|
||
author = {Wang, Kai and Ji, Xiaoyu and Mitev, Richard and Sadeghi, Ahmad-Reza and Yan, Chen and Xu, Wenyuan},
|
||
langid = {english},
|
||
file = {Wang et al_GhostTouch.pdf:/home/jaseg/Sync/Research/Zotero/Wang et al_GhostTouch.pdf:application/pdf},
|
||
}
|
||
|
||
@article{nassi_lamphone_nodate,
|
||
title = {Lamphone: Passive Sound Recovery from a Desk Lamp’s Light Bulb Vibrations},
|
||
abstract = {In this paper, we introduce "Lamphone," an optical sidechannel attack used to recover sound from desk lamp light bulbs; such lamps are commonly used in home offices, which became a primary work setting during the {COVID}-19 pandemic. We show how fluctuations in the air pressure on the surface of a light bulb, which occur in response to sound and cause the bulb to vibrate very slightly (a millidegree vibration), can be exploited by eavesdroppers to recover speech passively, externally, and using equipment that provides no indication regarding its application. We analyze a light bulb’s response to sound via an electro-optical sensor and learn how to isolate the audio signal from the optical signal. We compare Lamphone to related methods presented in other studies and show that Lamphone can recover sound at high quality and lower volume levels that those methods. Finally, we show that eavesdroppers can apply Lamphone in order to recover speech at the sound level of a virtual meeting with fair intelligibility when the victim is sitting/working at a desk that contains a desk lamp with a light bulb from a distance of 35 meters.},
|
||
author = {Nassi, Ben and Pirutin, Yaron and Swissa, Raz and Shamir, Adi and Elovici, Yuval and Zadov, Boris},
|
||
langid = {english},
|
||
file = {Nassi et al_Lamphone.pdf:/home/jaseg/Sync/Research/Zotero/Nassi et al_Lamphone.pdf:application/pdf},
|
||
}
|
||
|
||
@article{kohls_verloc_nodate,
|
||
title = {{VerLoc}: Verifiable Localization in Decentralized Systems},
|
||
abstract = {We tackle the challenge of reliably determining the geolocation of nodes in decentralized networks, considering adversarial settings and without depending on any trusted landmarks. In particular, we consider active adversaries that control a subset of nodes, announce false locations and strategically manipulate measurements. To address this problem we propose, implement and evaluate {VerLoc}, a system that allows verifying the claimed geo-locations of network nodes in a fully decentralized manner. {VerLoc} securely schedules roundtrip time ({RTT}) measurements between randomly chosen pairs of nodes. Trilateration is then applied to the set of measurements to verify claimed geo-locations. We evaluate {VerLoc} both with simulations and in the wild using a prototype implementation integrated in the Nym network (currently run by thousands of nodes). We find that {VerLoc} can localize nodes in the wild with a median error of 60 km, and that in attack simulations it is capable of detecting and filtering out adversarial timing manipulations for network setups with up to 20 \% malicious nodes.},
|
||
author = {Kohls, Katharina and Diaz, Claudia},
|
||
langid = {english},
|
||
file = {Kohls_Diaz_VerLoc.pdf:/home/jaseg/Sync/Research/Zotero/Kohls_Diaz_VerLoc.pdf:application/pdf},
|
||
}
|
||
|
||
@online{nilges_cryptographic_2015,
|
||
title = {The Cryptographic Strength of Tamper-Proof Hardware},
|
||
url = {https://publikationen.bibliothek.kit.edu/1000051809},
|
||
abstract = {Tamper-proof hardware has found its way into our everyday life in various forms, be it {SIM} cards, credit cards or passports. Usually, a cryptographic key is embedded in these hardware tokens that allows the execution of simple cryptographic operations, such as encryption or digital signing. The inherent security guarantees of tamper-proof hardware, however, allow more complex and diverse applications.},
|
||
author = {Nilges, Tobias},
|
||
urldate = {2023-02-28},
|
||
date = {2015},
|
||
langid = {german},
|
||
doi = {10.5445/IR/1000051809},
|
||
file = {Nilges_2015_The Cryptographic Strength of Tamper-Proof Hardware.pdf:/home/jaseg/Sync/Research/Zotero/Nilges_2015_The Cryptographic Strength of Tamper-Proof Hardware.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{hutchison_embedded_2010,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Embedded {SFE}: Offloading Server and Network Using Hardware Tokens},
|
||
volume = {6052},
|
||
isbn = {978-3-642-14576-6 978-3-642-14577-3},
|
||
url = {http://link.springer.com/10.1007/978-3-642-14577-3_17},
|
||
shorttitle = {Embedded {SFE}},
|
||
abstract = {We consider Secure Function Evaluation ({SFE}) in the clientserver setting where the server issues a secure token to the client. The token is not trusted by the client and is not a trusted third party.},
|
||
pages = {207--221},
|
||
booktitle = {Financial Cryptography and Data Security},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
author = {Järvinen, Kimmo and Kolesnikov, Vladimir and Sadeghi, Ahmad-Reza and Schneider, Thomas},
|
||
editor = {Sion, Radu},
|
||
editorb = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard},
|
||
editorbtype = {redactor},
|
||
urldate = {2023-02-28},
|
||
date = {2010},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-642-14577-3_17},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Järvinen et al. - 2010 - Embedded SFE Offloading Server and Network Using .pdf:/home/jaseg/Zotero/storage/CRS7EPIW/Järvinen et al. - 2010 - Embedded SFE Offloading Server and Network Using .pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{bertino_correlated_2021,
|
||
location = {Cham},
|
||
title = {Correlated Randomness Teleportation via Semi-trusted Hardware—Enabling Silent Multi-party Computation},
|
||
volume = {12973},
|
||
isbn = {978-3-030-88427-7 978-3-030-88428-4},
|
||
url = {https://link.springer.com/10.1007/978-3-030-88428-4_34},
|
||
abstract = {With the advancement of the trusted execution environment ({TEE}) technologies, hardware-supported secure computing becomes increasingly popular due to its e ciency. During the protocol execution, typically, the players need to contact a third-party server for remote a estation, ensuring the validity of the involved trusted hardware component, such as Intel {SGX}, as well as the integrity of the computation result. When the hardware manufacturer is not fully trusted, sensitive information may be leaked to the third-party server through backdoors, steganography, and kleptography, etc. In this work, we introduce a new security notion called semi-trusted hardware model, where the adversary is allowed to passively or maliciously corrupt the hardware. erefore, she can learn the input of the hardware component and might also tamper its output. We then show how to utilize such semi-trusted hardwares for correlated randomness teleportation. When the semi-trusted hardware is instantiated by Intel {SGX}, to generate 10k random {OT}’s, our protocol is 24X and 450X faster than the {EMP}-{IKNP}-{ROT} in the {LAN} and {WAN} se ing, respectively. When {SGX} is used to teleport garbled circuits, the resulting two-party computation protocol is 5.3-5.7X and 43-47X faster than the {EMP}-{SH}2PC in the {LAN} and {WAN} se ing, respectively, for the {AES}-128, {SHA}-256, and {SHA}-512 evaluation. We also show how to achieve malicious security with li le overhead.},
|
||
pages = {699--720},
|
||
booktitle = {Computer Security – {ESORICS} 2021},
|
||
publisher = {Springer International Publishing},
|
||
author = {Lu, Yibiao and Zhang, Bingsheng and Zhou, Hong-Sheng and Liu, Weiran and Zhang, Lei and Ren, Kui},
|
||
editor = {Bertino, Elisa and Shulman, Haya and Waidner, Michael},
|
||
urldate = {2023-02-28},
|
||
date = {2021},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-030-88428-4_34},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Lu et al. - 2021 - Correlated Randomness Teleportation via Semi-trust.pdf:/home/jaseg/Zotero/storage/8PJMW2P5/Lu et al. - 2021 - Correlated Randomness Teleportation via Semi-trust.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{bellare_efficient_2013,
|
||
title = {Efficient Garbling from a Fixed-Key Blockcipher},
|
||
doi = {10.1109/SP.2013.39},
|
||
abstract = {We advocate schemes based on fixed-key {AES} as the best route to highly efficient circuit-garbling. We provide such schemes making only one {AES} call per garbled-gate evaluation. On the theoretical side, we justify the security of these methods in the random-permutation model, where parties have access to a public random permutation. On the practical side, we provide the Just Garble system, which implements our schemes. Just Garble evaluates moderate-sized garbled-circuits at an amortized cost of 23.2 cycles per gate (7.25 nsec), far faster than any prior reported results.},
|
||
eventtitle = {2013 {IEEE} Symposium on Security and Privacy},
|
||
pages = {478--492},
|
||
booktitle = {2013 {IEEE} Symposium on Security and Privacy},
|
||
author = {Bellare, Mihir and Hoang, Viet Tung and Keelveedhi, Sriram and Rogaway, Phillip},
|
||
date = {2013-05},
|
||
note = {{ISSN}: 1081-6011},
|
||
keywords = {Cryptography, Games, Garbled circuits, garbling schemes, Logic gates, multiparty computation, Protocols, random-permutation model, Semantics, timing study, Wires, Yao's protocol},
|
||
file = {Bellare et al_2013_Efficient Garbling from a Fixed-Key Blockcipher.pdf:/home/jaseg/Sync/Research/Zotero/Bellare et al_2013_Efficient Garbling from a Fixed-Key Blockcipher.pdf:application/pdf;IEEE Xplore Abstract Record:/home/jaseg/Zotero/storage/KRT9TT4P/stamp.html:text/html},
|
||
}
|
||
|
||
@article{evans_pragmatic_nodate,
|
||
title = {A Pragmatic Introduction to Secure Multi-Party Computation},
|
||
abstract = {Secure multi-party computation ({MPC}) has evolved from a theoretical curiosity in the 1980s to a tool for building real systems today. Over the past decade, {MPC} has been one of the most active research areas in both theoretical and applied cryptography. This book introduces several important {MPC} protocols, and surveys methods for improving the efficiency of privacy-preserving applications built using {MPC}. Besides giving a broad overview of the field and the insights of the main constructions, we overview the most currently active areas of {MPC} research and aim to give readers insights into what problems are practically solvable using {MPC} today and how different threat models and assumptions impact the practicality of different approaches.},
|
||
author = {Evans, David and Kolesnikov, Vladimir and Rosulek, Mike},
|
||
langid = {english},
|
||
file = {Evans et al. - A Pragmatic Introduction to Secure Multi-Party Com.pdf:/home/jaseg/Zotero/storage/4EH2UCP5/Evans et al. - A Pragmatic Introduction to Secure Multi-Party Com.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{dodis_mozmathbb_2022,
|
||
location = {Cham},
|
||
title = {Moz\$\${\textbackslash}mathbb \{Z\}\_\{2{\textasciicircum}k\}\$\$arella: Efficient Vector-{OLE} and Zero-Knowledge Proofs over \$\${\textbackslash}mathbb \{Z\}\_\{2{\textasciicircum}k\}\$\$},
|
||
volume = {13510},
|
||
isbn = {978-3-031-15984-8 978-3-031-15985-5},
|
||
url = {https://link.springer.com/10.1007/978-3-031-15985-5_12},
|
||
shorttitle = {Moz\$\${\textbackslash}mathbb \{Z\}\_\{2{\textasciicircum}k\}\$\$arella},
|
||
abstract = {Zero-knowledge proof systems are usually designed to support computations for circuits over F2 or Fp for large p, but not for computations over Z2k , which all modern {CPUs} operate on. Although Z2k -arithmetic can be emulated using prime moduli, this comes with an unavoidable overhead. Recently, Baum et al. ({CCS} 2021) suggested a candidate construction for a designated-verifier zero-knowledge proof system that natively runs over Z2k . Unfortunately, their construction requires preprocessed random vector oblivious linear evaluation ({VOLE}) to be instantiated over Z2k . Currently, it is not known how to efficiently generate such random {VOLE} in large quantities.},
|
||
pages = {329--358},
|
||
booktitle = {Advances in Cryptology – {CRYPTO} 2022},
|
||
publisher = {Springer Nature Switzerland},
|
||
author = {Baum, Carsten and Braun, Lennart and Munch-Hansen, Alexander and Scholl, Peter},
|
||
editor = {Dodis, Yevgeniy and Shrimpton, Thomas},
|
||
urldate = {2023-02-28},
|
||
date = {2022},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-031-15985-5_12},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Baum et al. - 2022 - Moz\$\$mathbb Z _ 2^k \$\$arella Efficient Vector-O.pdf:/home/jaseg/Zotero/storage/BDZCDH85/Baum et al. - 2022 - Moz\$\$mathbb Z _ 2^k \$\$arella Efficient Vector-O.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{malkin_sublinear_2021,
|
||
location = {Cham},
|
||
title = {Sublinear {GMW}-Style Compiler for {MPC} with Preprocessing},
|
||
volume = {12826},
|
||
isbn = {978-3-030-84244-4 978-3-030-84245-1},
|
||
url = {https://link.springer.com/10.1007/978-3-030-84245-1_16},
|
||
abstract = {We consider the efficiency of protocols for secure multiparty computation ({MPC}) with a dishonest majority. A popular approach for the design of such protocols is to employ preprocessing. Before the inputs are known, the parties generate correlated secret randomness, which is consumed by a fast and possibly “information-theoretic” online protocol.},
|
||
pages = {457--485},
|
||
booktitle = {Advances in Cryptology – {CRYPTO} 2021},
|
||
publisher = {Springer International Publishing},
|
||
author = {Boyle, Elette and Gilboa, Niv and Ishai, Yuval and Nof, Ariel},
|
||
editor = {Malkin, Tal and Peikert, Chris},
|
||
urldate = {2023-02-28},
|
||
date = {2021},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-030-84245-1_16},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Boyle et al. - 2021 - Sublinear GMW-Style Compiler for MPC with Preproce.pdf:/home/jaseg/Zotero/storage/XWQXDJCM/Boyle et al. - 2021 - Sublinear GMW-Style Compiler for MPC with Preproce.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{dodis_authenticated_2022,
|
||
location = {Cham},
|
||
title = {Authenticated Garbling from Simple Correlations},
|
||
volume = {13510},
|
||
isbn = {978-3-031-15984-8 978-3-031-15985-5},
|
||
url = {https://link.springer.com/10.1007/978-3-031-15985-5_3},
|
||
abstract = {We revisit the problem of constant-round malicious secure two-party computation by considering the use of simple correlations, namely sources of correlated randomness that can be securely generated with sublinear communication complexity and good concrete efficiency.},
|
||
pages = {57--87},
|
||
booktitle = {Advances in Cryptology – {CRYPTO} 2022},
|
||
publisher = {Springer Nature Switzerland},
|
||
author = {Dittmer, Samuel and Ishai, Yuval and Lu, Steve and Ostrovsky, Rafail},
|
||
editor = {Dodis, Yevgeniy and Shrimpton, Thomas},
|
||
urldate = {2023-02-28},
|
||
date = {2022},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-031-15985-5_3},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Dittmer et al. - 2022 - Authenticated Garbling from Simple Correlations.pdf:/home/jaseg/Zotero/storage/VE42VHUT/Dittmer et al. - 2022 - Authenticated Garbling from Simple Correlations.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{malkin_silver_2021,
|
||
location = {Cham},
|
||
title = {Silver: Silent {VOLE} and Oblivious Transfer from Hardness of Decoding Structured {LDPC} Codes},
|
||
volume = {12827},
|
||
isbn = {978-3-030-84251-2 978-3-030-84252-9},
|
||
url = {https://link.springer.com/10.1007/978-3-030-84252-9_17},
|
||
shorttitle = {Silver},
|
||
abstract = {We put forth new protocols for oblivious transfer extension and vector {OLE}, called Silver, for {SILent} Vole and oblivious {transfER}. Silver offers extremely high performances: generating 10 million random {OTs} on one core of a standard laptop requires only 300ms of computation and 122KB of communication. This represents 37\% less computation and ∼ 1300× less communication than the standard {IKNP} protocol, as well as ∼ 4× less computation and ∼ 14× less communication than the recent protocol of Yang et al. ({CCS} 2020). Silver is silent: after a one-time cheap interaction, two parties can store small seeds, from which they can later locally generate a large number of {OTs} while remaining offline. Neither {IKNP} nor Yang et al. enjoys this feature; compared to the best known silent {OT} extension protocol of Boyle et al. ({CCS} 2019), upon which we build up, Silver has 19× less computation, and the same communication. Due to its attractive efficiency features, Silver yields major efficiency improvements in numerous {MPC} protocols.},
|
||
pages = {502--534},
|
||
booktitle = {Advances in Cryptology – {CRYPTO} 2021},
|
||
publisher = {Springer International Publishing},
|
||
author = {Couteau, Geoffroy and Rindal, Peter and Raghuraman, Srinivasan},
|
||
editor = {Malkin, Tal and Peikert, Chris},
|
||
urldate = {2023-02-28},
|
||
date = {2021},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-030-84252-9_17},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Couteau et al_2021_Silver.pdf:/home/jaseg/Sync/Research/Zotero/Couteau et al_2021_Silver.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{krawczyk_functional_2014,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Functional Signatures and Pseudorandom Functions},
|
||
volume = {8383},
|
||
isbn = {978-3-642-54630-3 978-3-642-54631-0},
|
||
url = {http://link.springer.com/10.1007/978-3-642-54631-0_29},
|
||
abstract = {In this paper, we introduce two new cryptographic primitives: functional digital signatures and functional pseudorandom functions. In a functional signature scheme, in addition to a master signing key that can be used to sign any message, there are signing keys for a function f , which allow one to sign any message in the range of f . As a special case, this implies the ability to generate keys for predicates P , which allow one to sign any message m, for which P (m) = 1.},
|
||
pages = {501--519},
|
||
booktitle = {Public-Key Cryptography – {PKC} 2014},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
author = {Boyle, Elette and Goldwasser, Shafi and Ivan, Ioana},
|
||
editor = {Krawczyk, Hugo},
|
||
urldate = {2023-03-02},
|
||
date = {2014},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-642-54631-0_29},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Boyle et al. - 2014 - Functional Signatures and Pseudorandom Functions.pdf:/home/jaseg/Zotero/storage/YVIXUWDZ/Boyle et al. - 2014 - Functional Signatures and Pseudorandom Functions.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{bender_dangers_2021,
|
||
location = {Virtual Event Canada},
|
||
title = {On the Dangers of Stochastic Parrots: Can Language Models Be Too Big? 🦜},
|
||
isbn = {978-1-4503-8309-7},
|
||
url = {https://dl.acm.org/doi/10.1145/3442188.3445922},
|
||
doi = {10.1145/3442188.3445922},
|
||
shorttitle = {On the Dangers of Stochastic Parrots},
|
||
abstract = {The past 3 years of work in {NLP} have been characterized by the development and deployment of ever larger language models, especially for English. {BERT}, its variants, {GPT}-2/3, and others, most recently Switch-C, have pushed the boundaries of the possible both through architectural innovations and through sheer size. Using these pretrained models and the methodology of fine-tuning them for specific tasks, researchers have extended the state of the art on a wide array of tasks as measured by leaderboards on specific benchmarks for English. In this paper, we take a step back and ask: How big is too big? What are the possible risks associated with this technology and what paths are available for mitigating those risks? We provide recommendations including weighing the environmental and financial costs first, investing resources into curating and carefully documenting datasets rather than ingesting everything on the web, carrying out pre-development exercises evaluating how the planned approach fits into research and development goals and supports stakeholder values, and encouraging research directions beyond ever larger language models.},
|
||
eventtitle = {{FAccT} '21: 2021 {ACM} Conference on Fairness, Accountability, and Transparency},
|
||
pages = {610--623},
|
||
booktitle = {Proceedings of the 2021 {ACM} Conference on Fairness, Accountability, and Transparency},
|
||
publisher = {{ACM}},
|
||
author = {Bender, Emily M. and Gebru, Timnit and {McMillan}-Major, Angelina and Shmitchell, Shmargaret},
|
||
urldate = {2023-03-06},
|
||
date = {2021-03-03},
|
||
langid = {english},
|
||
file = {Bender et al. - 2021 - On the Dangers of Stochastic Parrots Can Language.pdf:/home/jaseg/Zotero/storage/ZWE8ES43/Bender et al. - 2021 - On the Dangers of Stochastic Parrots Can Language.pdf:application/pdf},
|
||
}
|
||
|
||
@article{melara_coniks_nodate,
|
||
title = {{CONIKS}: Bringing Key Transparency to End Users},
|
||
abstract = {We present {CONIKS}, an end-user key verification service capable of integration in end-to-end encrypted communication systems. {CONIKS} builds on transparency log proposals for web server certificates but solves several new challenges specific to key verification for end users. {CONIKS} obviates the need for global third-party monitors and enables users to efficiently monitor their own key bindings for consistency, downloading less than 20 {kB} per day to do so even for a provider with billions of users. {CONIKS} users and providers can collectively audit providers for non-equivocation, and this requires downloading a constant 2.5 {kB} per provider per day. Additionally, {CONIKS} preserves the level of privacy offered by today’s major communication services, hiding the list of usernames present and even allowing providers to conceal the total number of users in the system.},
|
||
author = {Melara, Marcela S and Blankstein, Aaron and Bonneau, Joseph and Felten, Edward W and Freedman, Michael J},
|
||
langid = {english},
|
||
file = {Melara et al. - CONIKS Bringing Key Transparency to End Users.pdf:/home/jaseg/Zotero/storage/TMI3LX3I/Melara et al. - CONIKS Bringing Key Transparency to End Users.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{muehlmann_mutual_2012,
|
||
title = {Mutual coupling modeling of {NFC} antennas by using open-source {CAD}/{FEM} tools},
|
||
url = {https://ieeexplore.ieee.org/document/6404553},
|
||
doi = {10.1109/RFID-TA.2012.6404553},
|
||
abstract = {Near Field Communication ({NFC}) antennas are not comparable to standard communication antennas used for traditional transmission services. The geometries are complex, narrow conductor cross-sections and long loops located close to materials sensitive to electromagnetic interaction, when integrated, make the application of analytical coupling formulations inapplicable, even when it comes down to non-linear relations forced by ferrite shielding. Commercial finite element ({FEM}) solvers are powerful, but they do not serve the needs of {NFC} applications due to complexity, inadequateness and code obscuration. An intensive open source code investigation has identified one alternative solver which is capable to deal with all {NFC} {RFID} related coupling effects one can imagine. Automated scripts, the tool-chain, and geometry macros have been developed for rapid prototyping of such. Amongst other open source tools listed, the {ElmerFEM} solver is the most promising solver for linear and non-linear quasi-static electro-magnetic ({EM}) {NFC} problems. The solver has a powerful interface and delivers results close to reality even when computational complexity is a trade of physical resolution and memory capacity of standard commercial workstations.},
|
||
eventtitle = {2012 {IEEE} International Conference on {RFID}-Technologies and Applications ({RFID}-{TA})},
|
||
pages = {393--397},
|
||
booktitle = {2012 {IEEE} International Conference on {RFID}-Technologies and Applications ({RFID}-{TA})},
|
||
author = {Muehlmann, U. and Gebhart, M. and Wobak, M.},
|
||
urldate = {2023-10-31},
|
||
date = {2012-11},
|
||
file = {2012_Muehlmann et al_Mutual coupling modeling of NFC antennas by using open-source CAD-FEM tools.pdf:/home/jaseg/Sync/Research/Zotero/2012_Muehlmann et al_Mutual coupling modeling of NFC antennas by using open-source CAD-FEM tools.pdf:application/pdf;IEEE Xplore Abstract Record:/home/jaseg/Zotero/storage/YTC9WVJE/6404553.html:text/html},
|
||
}
|
||
|
||
@article{dumitru_impostor_nodate,
|
||
title = {The Impostor Among {US}(B): Off-Path Injection Attacks on {USB} Communications},
|
||
abstract = {{USB} is the most prevalent peripheral interface in modern computer systems and its inherent insecurities make it an appealing attack vector. A well-known limitation of {USB} is that traffic is not encrypted. This allows on-path adversaries to trivially perform man-in-the-middle attacks. Off-path attacks that compromise the confidentiality of communications have also been shown to be possible. However, so far no off-path attacks that breach {USB} communications integrity have been demonstrated.},
|
||
author = {Dumitru, Robert and Genkin, Daniel and Wabnitz, Andrew and Yarom, Yuval},
|
||
langid = {english},
|
||
file = {Dumitru et al. - The Impostor Among US(B) Off-Path Injection Attac.pdf:/home/jaseg/Zotero/storage/KAKTBELB/Dumitru et al. - The Impostor Among US(B) Off-Path Injection Attac.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{rezmerita_self_2017,
|
||
location = {Cluj-Napoca, Romania},
|
||
title = {A self and mutual inductance calculation resonators with finite element analysis},
|
||
isbn = {978-1-5090-6565-3},
|
||
url = {http://ieeexplore.ieee.org/document/7974422/},
|
||
doi = {10.1109/MPS.2017.7974422},
|
||
abstract = {This paper presents how to implement the finite element method ({FEM}) to determine the magnetically coupled coils parameters. The method is applied for computing the parameters of the two resonators used in wireless power transfer ({WPT}). To compute the parameters corresponding to the resistance, self inductance, capacity and mutual inductance (R, L, C and M), we used {CEDRAT} Flux 2D software. The results of the 2D analyses are used to calculate the circuit’s parameters in order to compute the wireless power transferred to a load. Using {FEM} we realized two models: the first one in order to determine the values corresponding to L1, R1, L2, R2 and M and the second model to test its functioning in steady state. The two models differs by an electric circuit used to realize the coupling and the numerical models are modeled using the magnetic quasistationary state. The wireless power transfer efficiency depends on the coil’s shape which can play an important role in the operation of such devices.},
|
||
eventtitle = {2017 International Conference on Modern Power Systems ({MPS})},
|
||
pages = {1--4},
|
||
booktitle = {2017 International Conference on Modern Power Systems ({MPS})},
|
||
publisher = {{IEEE}},
|
||
author = {Rezmerita, Georgiana and Bobaru, Lavinia and Stanculescu, Marinela and Iordache, Mihai and Niculae, Dragos},
|
||
urldate = {2023-10-31},
|
||
date = {2017-06},
|
||
langid = {english},
|
||
file = {Rezmerita et al. - 2017 - A self and mutual inductance calculation resonator.pdf:/home/jaseg/Zotero/storage/QQZ7V3G4/Rezmerita et al. - 2017 - A self and mutual inductance calculation resonator.pdf:application/pdf},
|
||
}
|
||
|
||
@article{henzinger_one_nodate,
|
||
title = {One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval},
|
||
abstract = {We present {SimplePIR}, the fastest single-server private information retrieval scheme known to date. {SimplePIR}’s security holds under the learning-with-errors assumption. To answer a client’s query, the {SimplePIR} server performs fewer than one 32-bit multiplication and one 32-bit addition per database byte. {SimplePIR} achieves 10 {GB}/s/core server throughput, which approaches the memory bandwidth of the machine and the performance of the fastest two-server privateinformation-retrieval schemes (which require non-colluding servers). {SimplePIR} has relatively large communication costs: to make queries to a 1 {GB} database, the client must download a 121 {MB} “hint” about the database contents; thereafter, the client may make an unbounded number of queries, each requiring 242 {KB} of communication. We present a second single-server scheme, {DoublePIR}, that shrinks the hint to 16 {MB} at the cost of slightly higher per-query communication (345 {KB}) and slightly lower throughput (7.4 {GB}/s/core). Finally, we apply our new private-information-retrieval schemes, together with a novel data structure for approximate set membership, to the task of private auditing in Certificate Transparency. We achieve a strictly stronger notion of privacy than Google Chrome’s current approach with 13× more communication: 16 {MB} of download per week, along with 1.5 {KB} per {TLS} connection.},
|
||
author = {Henzinger, Alexandra and Hong, Matthew M and Corrigan-Gibbs, Henry and Meiklejohn, Sarah and Vaikuntanathan, Vinod},
|
||
langid = {english},
|
||
file = {Henzinger et al. - One Server for the Price of Two Simple and Fast S.pdf:/home/jaseg/Zotero/storage/CNLJAWPW/Henzinger et al. - One Server for the Price of Two Simple and Fast S.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{lin_inspire_2022,
|
||
location = {New York New York},
|
||
title = {{INSPIRE}: in - s torage p rivate i nformation re trieval via protocol and architecture co-design},
|
||
isbn = {978-1-4503-8610-4},
|
||
url = {https://dl.acm.org/doi/10.1145/3470496.3527433},
|
||
doi = {10.1145/3470496.3527433},
|
||
shorttitle = {{INSPIRE}},
|
||
abstract = {Private Information Retrieval ({PIR}) plays a vital role in secure, database-centric applications. However, existing {PIR} protocols explore a massive working space containing hundreds of {GiBs} of query and database data. As a consequence, {PIR} performance is severely bounded by storage communication, making it far from practical for real-world deployment.},
|
||
eventtitle = {{ISCA} '22: The 49th Annual International Symposium on Computer Architecture},
|
||
pages = {102--115},
|
||
booktitle = {Proceedings of the 49th Annual International Symposium on Computer Architecture},
|
||
publisher = {{ACM}},
|
||
author = {Lin, Jilan and Liang, Ling and Qu, Zheng and Ahmad, Ishtiyaque and Liu, Liu and Tu, Fengbin and Gupta, Trinabh and Ding, Yufei and Xie, Yuan},
|
||
urldate = {2023-10-31},
|
||
date = {2022-06-18},
|
||
langid = {english},
|
||
file = {Lin et al. - 2022 - INSPIRE in - s torage p rivate i nformation re tr.pdf:/home/jaseg/Zotero/storage/2TP8V3PI/Lin et al. - 2022 - INSPIRE in - s torage p rivate i nformation re tr.pdf:application/pdf},
|
||
}
|
||
|
||
@article{li_learning_nodate,
|
||
title = {Learning Normality is Enough: A Software-based Mitigation against Inaudible Voice Attacks},
|
||
abstract = {Inaudible voice attacks silently inject malicious voice commands into voice assistants to manipulate voice-controlled devices such as smart speakers. To alleviate such threats for both existing and future devices, this paper proposes {NormDetect}, a software-based mitigation that can be instantly applied to a wide range of devices without requiring any hardware modification. To overcome the challenge that the attack patterns vary between devices, we design a universal detection model that does not rely on audio features or samples derived from specific devices. Unlike existing studies’ supervised learning approach, we adopt unsupervised learning inspired by anomaly detection. Though the patterns of inaudible voice attacks are diverse, we find that benign audios share similar patterns in the time-frequency domain. Therefore, we can detect the attacks (the anomaly) by learning the patterns of benign audios (the normality). {NormDetect} maps spectrum features to a low-dimensional space, performs similarity queries, and replaces them with the standard feature embeddings for spectrum reconstruction. This results in a more significant reconstruction error for attacks than normality. Evaluation based on the 383,320 test samples we collected from 24 smart devices shows an average {AUC} of 99.48\% and {EER} of 2.23\%, suggesting the effectiveness of {NormDetect} in detecting inaudible voice attacks.},
|
||
author = {Li, Xinfeng and Ji, Xiaoyu and Yan, Chen and Li, Chaohao and Li, Yichen and Zhang, Zhenning and Xu, Wenyuan},
|
||
langid = {english},
|
||
file = {Li et al. - Learning Normality is Enough A Software-based Mit.pdf:/home/jaseg/Zotero/storage/3GAC8HBK/Li et al. - Learning Normality is Enough A Software-based Mit.pdf:application/pdf},
|
||
}
|
||
|
||
@article{sutardja_isolator-less_2018,
|
||
title = {Isolator-Less Near-Field {RFID} Reader for Sub-Cranial Powering/Data Link of Millimeter-Sized Implants},
|
||
volume = {53},
|
||
issn = {0018-9200, 1558-173X},
|
||
url = {https://ieeexplore.ieee.org/document/8356220/},
|
||
doi = {10.1109/JSSC.2018.2822673},
|
||
pages = {2032--2042},
|
||
number = {7},
|
||
journaltitle = {{IEEE} Journal of Solid-State Circuits},
|
||
shortjournal = {{IEEE} J. Solid-State Circuits},
|
||
author = {Sutardja, Christopher and Rabaey, Jan M.},
|
||
urldate = {2023-10-31},
|
||
date = {2018-07},
|
||
}
|
||
|
||
@article{wang_group-cross_2006,
|
||
title = {Group-Cross Symmetrical Inductor ({GCSI}): A New Inductor Structure With Higher Self-Resonance Frequency and\$Q\$Factor},
|
||
volume = {42},
|
||
issn = {0018-9464},
|
||
url = {http://ieeexplore.ieee.org/document/1634478/},
|
||
doi = {10.1109/TMAG.2006.873301},
|
||
shorttitle = {Group-Cross Symmetrical Inductor ({GCSI})},
|
||
pages = {1681--1686},
|
||
number = {6},
|
||
journaltitle = {{IEEE} Transactions on Magnetics},
|
||
shortjournal = {{IEEE} Trans. Magn.},
|
||
author = {Wang, Y.-Y. and Li, Z.-F.},
|
||
urldate = {2023-10-31},
|
||
date = {2006-06},
|
||
langid = {english},
|
||
}
|
||
|
||
@article{curran_modeling_2015,
|
||
title = {Modeling and characterization of {PCB} coils for inductive wireless charging},
|
||
volume = {2},
|
||
issn = {2052-8418},
|
||
url = {https://www.cambridge.org/core/product/identifier/S2052841815000147/type/journal_article},
|
||
doi = {10.1017/wpt.2015.14},
|
||
abstract = {Wireless charging is emerging as a viable technology in many industries, including consumer, medical, and sensor electronics. An investigation of design principles is conducted for a wireless charging platform that is designed to charge devices of different sizes and technologies, using only through vias. It is shown that at a 5 mm separation distance, a coupling coefficient can be achieved which varies from 0.12 to 0.37 when staggered hexagonal transmitter coils (approximately 5 cm across) are used with an unstaggered square receiver coil, which declines to 0.06–0.11 at 2 cm separation. Without design measures, the coupling coefficient will approach zero at certain positions. The quality factors of the coils can be improved by stacking the coils in parallel, enabling the use of only through-vias, while the inductance can be controlled horizontally by increasing the number of turns in the inductor.},
|
||
pages = {127--133},
|
||
number = {2},
|
||
journaltitle = {Wireless Power Transfer},
|
||
shortjournal = {Wirel Pow Transfer},
|
||
author = {Curran, Brian and Maaß, Uwe and Fotheringham, Gerhard and Stevens, Nobby and Ndip, Ivan and Lang, Klaus-Dieter},
|
||
urldate = {2023-10-31},
|
||
date = {2015-09},
|
||
langid = {english},
|
||
file = {Curran et al. - 2015 - Modeling and characterization of PCB coils for ind.pdf:/home/jaseg/Zotero/storage/G9UFDMFK/Curran et al. - 2015 - Modeling and characterization of PCB coils for ind.pdf:application/pdf},
|
||
}
|
||
|
||
@misc{noauthor_i_nodate,
|
||
title = {I Heated a Flash Drive to 160C and it Still Works! (Ovrdrive Update)},
|
||
url = {https://www.youtube.com/watch?v=LD9e73BYAnI},
|
||
}
|
||
|
||
@article{tobisch_physical_nodate,
|
||
title = {Physical systems for integrity protection and authentication},
|
||
author = {Tobisch, Johannes},
|
||
langid = {english},
|
||
}
|
||
|
||
@incollection{paillier_rf-dna_2007,
|
||
location = {Berlin, Heidelberg},
|
||
title = {{RF}-{DNA}: Radio-Frequency Certificates of Authenticity},
|
||
volume = {4727},
|
||
isbn = {978-3-540-74734-5 978-3-540-74735-2},
|
||
url = {http://link.springer.com/10.1007/978-3-540-74735-2_24},
|
||
shorttitle = {{RF}-{DNA}},
|
||
abstract = {A certificate of authenticity ({COA}) is an inexpensive physical object that has a random and unique multidimensional structure S which is hard to near-exactly replicate. An inexpensive device should be able to scan object’s physical “fingerprint,” i.e., obtain a set of features in the form of a multidimensional signal x that pseudo-uniquely represents S. For a given “fingerprint” x and without access to S, it should be computationally difficult to construct an object of fixed dimensions with a “fingerprint” y which is at a bounded proximity from x according to a standardized distance metric. We introduce objects that behave as {COAs} in the electromagnetic field. The objective is to complement {RFIDs} so that they are physically, not only digitally, unique and hard to replicate. By enabling this feature, we introduce a tag whose information about the product can be read within a relative far-field, and also whose authenticity can be reliably verified within its near-field. In order to counterfeit a tag, the adversary faces two difficulties – a computational and a manufacturing one. The computational difficulty stems from the hardness of solving linear inverse problems in the electromagnetic field. In order to create an actual tag, the adversary must also manufacture a multidimensional object with a specific three-dimensional topology, dielectric properties, and conductivity.},
|
||
pages = {346--363},
|
||
booktitle = {Cryptographic Hardware and Embedded Systems - {CHES} 2007},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
author = {{DeJean}, Gerald and Kirovski, Darko},
|
||
editor = {Paillier, Pascal and Verbauwhede, Ingrid},
|
||
urldate = {2023-12-19},
|
||
date = {2007},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-540-74735-2_24},
|
||
note = {{ISSN}: 0302-9743, 1611-3349
|
||
Series Title: Lecture Notes in Computer Science},
|
||
file = {DeJean and Kirovski - 2007 - RF-DNA Radio-Frequency Certificates of Authentici.pdf:/home/jaseg/Zotero/storage/Z5AD924B/DeJean and Kirovski - 2007 - RF-DNA Radio-Frequency Certificates of Authentici.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{ruhrmair_virtual_2015,
|
||
location = {San Jose, {CA}},
|
||
title = {Virtual Proofs of Reality and their Physical Implementation},
|
||
isbn = {978-1-4673-6949-7},
|
||
url = {https://ieeexplore.ieee.org/document/7163019/},
|
||
doi = {10.1109/SP.2015.12},
|
||
abstract = {We discuss the question of how physical statements can be proven over digital communication channels between two parties (a “prover” and a “verifier”) residing in two separate local systems. Examples include: (i) “a certain object in the prover’s system has temperature X◦C”, (ii) “two certain objects in the prover’s system are positioned at distance X”, or (iii) “a certain object in the prover’s system has been irreversibly altered or destroyed”. As illustrated by these examples, our treatment goes beyond classical security sensors in considering more general physical statements. Another distinctive aspect is the underlying security model: We neither assume secret keys in the prover’s system, nor do we suppose classical sensor hardware in his system which is tamperresistant and trusted by the verifier. Without an established name, we call this new type of security protocol a ”virtual proof of reality” or simply a “virtual proof” ({VP}).},
|
||
eventtitle = {2015 {IEEE} Symposium on Security and Privacy ({SP})},
|
||
pages = {70--85},
|
||
booktitle = {2015 {IEEE} Symposium on Security and Privacy},
|
||
publisher = {{IEEE}},
|
||
author = {Ruhrmair, Ulrich and Martinez-Hurtado, J.L. and Xu, Xiaolin and Kraeh, Christian and Hilgers, Christian and Kononchuk, Dima and Finley, Jonathan J. and Burleson, Wayne P.},
|
||
urldate = {2023-12-19},
|
||
date = {2015-05},
|
||
langid = {english},
|
||
file = {Ruhrmair et al. - 2015 - Virtual Proofs of Reality and their Physical Imple.pdf:/home/jaseg/Zotero/storage/9EWXN9MY/Ruhrmair et al. - 2015 - Virtual Proofs of Reality and their Physical Imple.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{martin_sealclub_2023,
|
||
location = {Austin {TX} {USA}},
|
||
title = {{SealClub}: Computer-aided Paper Document Authentication},
|
||
isbn = {9798400708862},
|
||
url = {https://dl.acm.org/doi/10.1145/3627106.3627176},
|
||
doi = {10.1145/3627106.3627176},
|
||
shorttitle = {{SealClub}},
|
||
abstract = {Paper documents, where digital signatures are not directly applicable, are still widely utilized due to usability and legal reasons. We propose a novel approach to authenticating paper documents by taking short videos of them with smartphones. Our solution combines cryptographic and image comparison techniques to detect and highlight semantic-changing attacks on rich documents, containing text and graphics. We provide geometrical arguments for the security of our novel comparison algorithm, and prove that its combination with a cryptographic protocol is secure against strong adversaries capable of compromising different system components. We also measure its accuracy on a set of 128 videos of paper documents and a set of 960 synthetically generated warped documents, half containing subtle forgeries. Our algorithm finds all forgeries accurately with no false positives. The highlighted regions are large enough to be visible to users, but small enough to precisely locate forgeries.},
|
||
eventtitle = {{ACSAC} '23: Annual Computer Security Applications Conference},
|
||
pages = {163--177},
|
||
booktitle = {Annual Computer Security Applications Conference},
|
||
publisher = {{ACM}},
|
||
author = {Martín, Ochoa and Hernán, Vanegas and Jorge, Toro-Pozo and David, Basin},
|
||
urldate = {2023-12-21},
|
||
date = {2023-12-04},
|
||
langid = {english},
|
||
file = {Martín et al. - 2023 - SealClub Computer-aided Paper Document Authentica.pdf:/home/jaseg/Zotero/storage/7D7R9GCM/Martín et al. - 2023 - SealClub Computer-aided Paper Document Authentica.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{murali_continuous_2023,
|
||
location = {Austin {TX} {USA}},
|
||
title = {Continuous Authentication Using Human-Induced Electric Potential},
|
||
isbn = {9798400708862},
|
||
url = {https://dl.acm.org/doi/10.1145/3627106.3627124},
|
||
doi = {10.1145/3627106.3627124},
|
||
abstract = {Most terminal devices authenticate users only once at the time of initial login, leaving the terminal unprotected during an active session when the original user leaves it unattended. To address this issue, continuous authentication has been proposed by automatically locking the terminal after a period of inactivity. However, it does not fully eliminate the risk of unauthorized access before the session expires. Recent research has also investigated the feasibility of using physiological and behavioral patterns as biometrics. This study presents a novel two-factor continuous authentication that explores a new form of signal called human-induced electric potential captured by wearables in contact with the user’s body. By analyzing this signal, we can determine the time of user-terminal interactions and compare it with information recorded by the terminal’s {OS}. If the original user remains on the same terminal, the two-source readings would match. Additionally, the proposed scheme includes an extra layer of protection by extracting terminal’s physical fingerprints from the human-induced electric potential to defend against advanced mimicry attacks. To test the effectiveness of our design, a low-cost wearable prototype is developed. Through extensive experiments, it is found that the proposed scheme has a low error rate of 2.3\%, with minimal computational and energy requirements.},
|
||
eventtitle = {{ACSAC} '23: Annual Computer Security Applications Conference},
|
||
pages = {409--423},
|
||
booktitle = {Annual Computer Security Applications Conference},
|
||
publisher = {{ACM}},
|
||
author = {Murali, Srinivasan and Jin, Wenqiang and Sivaraman, Vighnesh and Zhu, Huadi and Ji, Tianxi and Li, Pan and Li, Ming},
|
||
urldate = {2023-12-21},
|
||
date = {2023-12-04},
|
||
langid = {english},
|
||
file = {Murali et al. - 2023 - Continuous Authentication Using Human-Induced Elec.pdf:/home/jaseg/Zotero/storage/3XBD9Z7V/Murali et al. - 2023 - Continuous Authentication Using Human-Induced Elec.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{saeif_day-after-tomorrow_2023,
|
||
location = {Austin {TX} {USA}},
|
||
title = {The Day-After-Tomorrow: On the Performance of Radio Fingerprinting over Time},
|
||
isbn = {9798400708862},
|
||
url = {https://dl.acm.org/doi/10.1145/3627106.3627192},
|
||
doi = {10.1145/3627106.3627192},
|
||
shorttitle = {The Day-After-Tomorrow},
|
||
eventtitle = {{ACSAC} '23: Annual Computer Security Applications Conference},
|
||
pages = {439--450},
|
||
booktitle = {Annual Computer Security Applications Conference},
|
||
publisher = {{ACM}},
|
||
author = {Saeif, Alhazbi and Savio, Sciancalepore and Gabriele, Oligeri},
|
||
urldate = {2023-12-21},
|
||
date = {2023-12-04},
|
||
langid = {english},
|
||
file = {Saeif et al. - 2023 - The Day-After-Tomorrow On the Performance of Radi.pdf:/home/jaseg/Zotero/storage/LYZND7TS/Saeif et al. - 2023 - The Day-After-Tomorrow On the Performance of Radi.pdf:application/pdf},
|
||
}
|
||
|
||
@article{athalye_verifying_nodate,
|
||
title = {Verifying Hardware Security Modules with Information-Preserving Refinement},
|
||
abstract = {Knox is a new framework that enables developers to build hardware security modules ({HSMs}) with high assurance through formal verification. The goal is to rule out all hardware bugs, software bugs, and timing side channels. Knox’s approach is to relate an implementation’s wirelevel behavior to a functional specification stated in terms of method calls and return values with a new definition called information-preserving refinement ({IPR}). This definition captures the notion that the {HSM} implements its functional specification, and that it leaks no additional information through its wire-level behavior. The Knox framework provides support for writing specifications, importing {HSM} implementations written in Verilog and C code, and proving {IPR} using a combination of lightweight annotations and interactive proofs. To evaluate the {IPR} definition and the Knox framework, we verified three simple {HSMs}, including an {RFC} 6238compliant {TOTP} token. The {TOTP} token is written in 2950 lines of Verilog and 360 lines of C and assembly. Its behavior is captured in a succinct specification: aside from the definition of the {TOTP} algorithm, the spec is only 10 lines of code. In all three case studies, verification covers entire hardware and software stacks and rules out hardware/software bugs and timing side channels.},
|
||
author = {Athalye, Anish and Kaashoek, M Frans and Zeldovich, Nickolai},
|
||
langid = {english},
|
||
file = {Athalye et al. - Verifying Hardware Security Modules with Informati.pdf:/home/jaseg/Zotero/storage/E3KVIU4P/Athalye et al. - Verifying Hardware Security Modules with Informati.pdf:application/pdf},
|
||
}
|
||
|
||
@misc{sifferman_unlocking_2023,
|
||
title = {Unlocking the Performance of Proximity Sensors by Utilizing Transient Histograms},
|
||
url = {http://arxiv.org/abs/2308.13473},
|
||
abstract = {We provide methods which recover planar scene geometry by utilizing the transient histograms captured by a class of close-range time-of-flight ({ToF}) distance sensor. A transient histogram is a one dimensional temporal waveform which encodes the arrival time of photons incident on the {ToF} sensor. Typically, a sensor processes the transient histogram using a proprietary algorithm to produce distance estimates, which are commonly used in several robotics applications. Our methods utilize the transient histogram directly to enable recovery of planar geometry more accurately than is possible using only proprietary distance estimates, and consistent recovery of the albedo of the planar surface, which is not possible with proprietary distance estimates alone. This is accomplished via a differentiable rendering pipeline, which simulates the transient imaging process, allowing direct optimization of scene geometry to match observations. To validate our methods, we capture 3,800 measurements of eight planar surfaces from a wide range of viewpoints, and show that our method outperforms the proprietary-distance-estimate baseline by an order of magnitude in most scenarios. We demonstrate a simple robotics application which uses our method to sense the distance to and slope of a planar surface from a sensor mounted on the end effector of a robot arm.},
|
||
number = {{arXiv}:2308.13473},
|
||
publisher = {{arXiv}},
|
||
author = {Sifferman, Carter and Wang, Yeping and Gupta, Mohit and Gleicher, Michael},
|
||
urldate = {2023-12-21},
|
||
date = {2023-08-25},
|
||
langid = {english},
|
||
eprinttype = {arxiv},
|
||
eprint = {2308.13473 [cs]},
|
||
keywords = {Computer Science - Computer Vision and Pattern Recognition, Computer Science - Robotics},
|
||
file = {Sifferman et al. - 2023 - Unlocking the Performance of Proximity Sensors by .pdf:/home/jaseg/Zotero/storage/S2TLFNT7/Sifferman et al. - 2023 - Unlocking the Performance of Proximity Sensors by .pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{krachenfels_real-world_2021,
|
||
title = {Real-World Snapshots vs. Theory: Questioning the t-Probing Security Model},
|
||
url = {http://arxiv.org/abs/2009.04263},
|
||
doi = {10.1109/SP40001.2021.00029},
|
||
shorttitle = {Real-World Snapshots vs. Theory},
|
||
abstract = {Due to its sound theoretical basis and practical efficiency, masking has become the most prominent countermeasure to protect cryptographic implementations against physical sidechannel attacks ({SCAs}). The core idea of masking is to randomly split every sensitive intermediate variable during computation into at least t+1 shares, where t denotes the maximum number of shares that are allowed to be observed by an adversary without learning any sensitive information. In other words, it is assumed that the adversary is bounded either by the possessed number of probes (e.g., microprobe needles) or by the order of statistical analyses while conducting higher-order {SCA} attacks (e.g., differential power analysis). Such bounded models are employed to prove the {SCA} security of the corresponding implementations. Consequently, it is believed that given a sufficiently large number of shares, the vast majority of known {SCA} attacks are mitigated. In this work, we present a novel laser-assisted {SCA} technique, called Laser Logic State Imaging ({LLSI}), which offers an unlimited number of contactless probes, and therefore, violates the probing security model assumption. This technique enables us to take snapshots of hardware implementations, i.e., extract the logical state of all registers at any arbitrary clock cycle with a single measurement. To validate this, we mount our attack on masked {AES} hardware implementations and practically demonstrate the extraction of the full-length key in two different scenarios. First, we assume that the location of the registers (key and/or state) is known, and hence, their content can be directly read by a single snapshot. Second, we consider an implementation with unknown register locations, where we make use of multiple snapshots and a {SAT} solver to reveal the secrets.},
|
||
pages = {1955--1971},
|
||
booktitle = {2021 {IEEE} Symposium on Security and Privacy ({SP})},
|
||
author = {Krachenfels, Thilo and Ganji, Fatemeh and Moradi, Amir and Tajik, Shahin and Seifert, Jean-Pierre},
|
||
urldate = {2024-01-08},
|
||
date = {2021-05},
|
||
langid = {english},
|
||
eprinttype = {arxiv},
|
||
eprint = {2009.04263 [cs]},
|
||
keywords = {Computer Science - Cryptography and Security},
|
||
file = {Krachenfels et al. - 2021 - Real-World Snapshots vs. Theory Questioning the t.pdf:/home/jaseg/Zotero/storage/VAZQHSTV/Krachenfels et al. - 2021 - Real-World Snapshots vs. Theory Questioning the t.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{koblah_hardware_2022,
|
||
location = {Los Angeles {CA} {USA}},
|
||
title = {Hardware Moving Target Defenses against Physical Attacks: Design Challenges and Opportunities},
|
||
isbn = {978-1-4503-9878-7},
|
||
url = {https://dl.acm.org/doi/10.1145/3560828.3564010},
|
||
doi = {10.1145/3560828.3564010},
|
||
shorttitle = {Hardware Moving Target Defenses against Physical Attacks},
|
||
abstract = {The concept of moving target defense ({MTD}) has entrenched itself as a viable strategy to reverse the typical asymmetries in cyber warfare. {MTDs} are technologies that seek to make target systems dynamically change in order to limit the time and information available to complete an attack, increase the likelihood of detection, and/or deter attackers from proceeding. The benefits of {MTD} have been shown for network-, operating system-, and applicationlevel security. Hardware roots-of-trust, however, are static “sitting ducks", especially against physical attacks, and can therefore benefit from the dynamics brought about by {MTDs}. Although many {MTD} concepts seem transferable to hardware applications, there has hardly been any work to establish a functioning research pipeline for countermeasures to physical attacks. The aim of this paper is to introduce viable {MTD} concepts, describe the issues that they can address, and chart a path towards their realization for the community.},
|
||
eventtitle = {{CCS} '22: 2022 {ACM} {SIGSAC} Conference on Computer and Communications Security},
|
||
pages = {25--36},
|
||
booktitle = {Proceedings of the 9th {ACM} Workshop on Moving Target Defense},
|
||
publisher = {{ACM}},
|
||
author = {Koblah, David S. and Ganji, Fatemeh and Forte, Domenic and Tajik, Shahin},
|
||
urldate = {2024-01-08},
|
||
date = {2022-11-11},
|
||
langid = {english},
|
||
file = {Koblah et al. - 2022 - Hardware Moving Target Defenses against Physical A.pdf:/home/jaseg/Zotero/storage/4NYR9495/Koblah et al. - 2022 - Hardware Moving Target Defenses against Physical A.pdf:application/pdf},
|
||
}
|
||
|
||
@article{morimoto_simultaneous_2006,
|
||
title = {Simultaneous measurement of specific heat, thermal conductivity, and thermal diffusivity of modified barium titanate ceramics},
|
||
volume = {442},
|
||
issn = {00406031},
|
||
url = {https://linkinghub.elsevier.com/retrieve/pii/S0040603105005630},
|
||
doi = {10.1016/j.tca.2005.11.020},
|
||
pages = {14--17},
|
||
number = {1},
|
||
journaltitle = {Thermochimica Acta},
|
||
shortjournal = {Thermochimica Acta},
|
||
author = {Morimoto, Kohsuke and Sawai, Shinya and Hisano, Kumao and Yamamoto, Takashi},
|
||
urldate = {2024-01-30},
|
||
date = {2006-03},
|
||
langid = {english},
|
||
}
|
||
|
||
@article{shen_thermal_2020,
|
||
title = {Thermal Modeling and Design Optimization of {PCB} Vias and Pads},
|
||
volume = {35},
|
||
issn = {0885-8993, 1941-0107},
|
||
url = {https://ieeexplore.ieee.org/document/8706634/},
|
||
doi = {10.1109/TPEL.2019.2915029},
|
||
abstract = {Miniature power semiconductor devices mounted on printed circuit boards ({PCBs}) are normally cooled by means of {PCB} vias, copper pads, and/or heatsinks. Various reference {PCB} thermal designs have been provided by semiconductor manufacturers and researchers. However, the recommendations are not optimal, and there are some discrepancies among them, which may confuse electrical engineers. This paper aims to develop analytical thermal resistance models for {PCB} vias and pads, and further to obtain the optimal design for thermal resistance minimization. First, the {PCB} via array is thermally modeled in terms of multiple design parameters. A systematic parametric analysis leads to an optimal trajectory for the via diameter at different {PCB} specifications. Then, an axisymmetric thermal resistance model is developed for {PCB} thermal pads where the heat conduction, convection, and radiation all exist; due to the interdependence between the conductive/radiative heat transfer coefficients and the board temperatures, an algorithm is proposed to fast obtain the board-ambient thermal resistance and to predict the semiconductor junction temperature. Finally, the proposed thermal models and design optimization algorithms are verified by computational fluid dynamics simulations and experimental measurements.},
|
||
pages = {882--900},
|
||
number = {1},
|
||
journaltitle = {{IEEE} Transactions on Power Electronics},
|
||
shortjournal = {{IEEE} Trans. Power Electron.},
|
||
author = {Shen, Yanfeng and Wang, Huai and Blaabjerg, Frede and Zhao, Hui and Long, Teng},
|
||
urldate = {2024-01-30},
|
||
date = {2020-01},
|
||
langid = {english},
|
||
file = {Shen et al. - 2020 - Thermal Modeling and Design Optimization of PCB Vi.pdf:/home/jaseg/Zotero/storage/9JF534CK/Shen et al. - 2020 - Thermal Modeling and Design Optimization of PCB Vi.pdf:application/pdf},
|
||
}
|
||
|
||
@article{navas_mtd_2021,
|
||
title = {{MTD}, Where Art Thou? A Systematic Review of Moving Target Defense Techniques for {IoT}},
|
||
volume = {8},
|
||
rights = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/{IEEE}.html},
|
||
issn = {2327-4662, 2372-2541},
|
||
url = {https://ieeexplore.ieee.org/document/9270287/},
|
||
doi = {10.1109/JIOT.2020.3040358},
|
||
shorttitle = {{MTD}, Where Art Thou?},
|
||
pages = {7818--7832},
|
||
number = {10},
|
||
journaltitle = {{IEEE} Internet of Things Journal},
|
||
shortjournal = {{IEEE} Internet Things J.},
|
||
author = {Navas, Renzo E. and Cuppens, Frederic and Boulahia Cuppens, Nora and Toutain, Laurent and Papadopoulos, Georgios Z.},
|
||
urldate = {2024-04-04},
|
||
date = {2021-05-15},
|
||
file = {Navas et al_2021_MTD, Where Art Thou.pdf:/home/jaseg/Sync/Research/Zotero/Navas et al_2021_MTD, Where Art Thou.pdf:application/pdf},
|
||
}
|
||
|
||
@article{darco_secure_2016,
|
||
title = {Secure computation without computers},
|
||
volume = {651},
|
||
issn = {0304-3975},
|
||
url = {https://www.sciencedirect.com/science/article/pii/S0304397516303905},
|
||
doi = {10.1016/j.tcs.2016.08.003},
|
||
abstract = {The design of secure protocols which can be used without the aid of a computer and without cryptographic knowledge is an interesting and challenging research task. Indeed, protocols enjoying these features could be useful in a variety of settings where computers cannot be used or where people feel uncomfortable to interact with or trust a computer. In this paper we make a step in such a direction: we propose a novel method for performing secure two-party computations that, apart from the setup phase, requires neither a computing machinery nor cryptographic knowledge. By merging together in a suitable way two beautiful ideas of the 80's and the 90's, Yao's garbled circuit construction and Naor and Shamir's visual cryptography, respectively, we enable Alice and Bob to securely evaluate a function f(⋅,⋅) of their inputs, x and y, through a pure physical process. Indeed, once Alice has prepared a set of properly constructed transparencies (for this activity a computer is useful), Bob computes the function value f(x,y) by applying a sequence of simple steps which require the use of a pair of scissors, superposing transparencies, and the human visual system. Our construction builds on Kolesnikov's gate evaluation secret sharing schemes.},
|
||
pages = {11--36},
|
||
journaltitle = {Theoretical Computer Science},
|
||
shortjournal = {Theoretical Computer Science},
|
||
author = {D'Arco, Paolo and De Prisco, Roberto},
|
||
urldate = {2024-03-07},
|
||
date = {2016-10-25},
|
||
keywords = {Secure computation, Visual cryptography, Yao's construction},
|
||
file = {ScienceDirect Snapshot:/home/jaseg/Zotero/storage/9FIX6KMN/S0304397516303905.html:text/html},
|
||
}
|
||
|
||
@inproceedings{essex_oblivious_2012,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Oblivious Printing of Secret Messages in a Multi-party Setting},
|
||
isbn = {978-3-642-32946-3},
|
||
doi = {10.1007/978-3-642-32946-3_26},
|
||
series = {Lecture Notes in Computer Science},
|
||
abstract = {We propose oblivious printing, a novel approach to document printing in which a set of printers can cooperate to print a secret message—in human or machine readable form—without learning the message. We present multi-party protocols for obliviously printing a secret in three settings: obliviously printing the contents of a ciphertext, obliviously printing a randomized message, and generating and obliviously printing a {DSA}/Elgamal keypair. We propose an approach to improving the legibility of messages in the presence of numerous participants. Finally we propose some potential applications of oblivious printing in the context of electronic voting and digital cash.},
|
||
pages = {359--373},
|
||
booktitle = {Financial Cryptography and Data Security},
|
||
publisher = {Springer},
|
||
author = {Essex, Aleksander and Hengartner, Urs},
|
||
editor = {Keromytis, Angelos D.},
|
||
date = {2012},
|
||
langid = {english},
|
||
keywords = {Electronic Vote, Encrypt Image, Secret Message, Translation Table, Visual Cryptography},
|
||
file = {Essex_Hengartner_2012_Oblivious Printing of Secret Messages in a Multi-party Setting.pdf:/home/jaseg/Sync/Research/Zotero/Essex_Hengartner_2012_Oblivious Printing of Secret Messages in a Multi-party Setting.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{kolesnikov_gate_2005,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation},
|
||
isbn = {978-3-540-32267-2},
|
||
doi = {10.1007/11593447_8},
|
||
series = {Lecture Notes in Computer Science},
|
||
abstract = {We propose Gate Evaluation Secret Sharing ({GESS}) – a new kind of secret sharing, designed for use in secure function evaluation ({SFE}) with minimal interaction. The resulting simple and powerful {GESS} approach to {SFE} is a generalization of Yao’s garbled circuit technique.},
|
||
pages = {136--155},
|
||
booktitle = {Advances in Cryptology - {ASIACRYPT} 2005},
|
||
publisher = {Springer},
|
||
author = {Kolesnikov, Vladimir},
|
||
editor = {Roy, Bimal},
|
||
date = {2005},
|
||
langid = {english},
|
||
keywords = {Binary Input, Boolean Formula, Oblivious Transfer, Secret Sharing Scheme, Secure Multiparty Computation},
|
||
file = {Kolesnikov_2005_Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation.pdf:/home/jaseg/Sync/Research/Zotero/Kolesnikov_2005_Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{boldyreva_efficient_2019,
|
||
location = {Cham},
|
||
title = {Efficient Pseudorandom Correlation Generators: Silent {OT} Extension and More},
|
||
volume = {11694},
|
||
isbn = {978-3-030-26953-1 978-3-030-26954-8},
|
||
url = {http://link.springer.com/10.1007/978-3-030-26954-8_16},
|
||
shorttitle = {Efficient Pseudorandom Correlation Generators},
|
||
abstract = {Secure multiparty computation ({MPC}) often relies on sources of correlated randomness for better efficiency and simplicity. This is particularly useful for {MPC} with no honest majority, where input-independent correlated randomness enables a lightweight “non-cryptographic” online phase once the inputs are known. However, since the amount of correlated randomness typically scales with the circuit size of the function being computed, securely generating correlated randomness forms an efficiency bottleneck, involving a large amount of communication and storage.},
|
||
pages = {489--518},
|
||
booktitle = {Advances in Cryptology – {CRYPTO} 2019},
|
||
publisher = {Springer International Publishing},
|
||
author = {Boyle, Elette and Couteau, Geoffroy and Gilboa, Niv and Ishai, Yuval and Kohl, Lisa and Scholl, Peter},
|
||
editor = {Boldyreva, Alexandra and Micciancio, Daniele},
|
||
urldate = {2024-02-26},
|
||
date = {2019},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-030-26954-8_16},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Boyle et al. - 2019 - Efficient Pseudorandom Correlation Generators Sil.pdf:/home/jaseg/Zotero/storage/229Y6I5Z/Boyle et al. - 2019 - Efficient Pseudorandom Correlation Generators Sil.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{gollmann_faster_2017,
|
||
location = {Cham},
|
||
title = {Faster Secure Multi-party Computation of {AES} and {DES} Using Lookup Tables},
|
||
volume = {10355},
|
||
isbn = {978-3-319-61203-4 978-3-319-61204-1},
|
||
url = {https://link.springer.com/10.1007/978-3-319-61204-1_12},
|
||
abstract = {We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party ‘{TinyTable}’ protocol of Damg˚ard et al. ({ePrint} 2016). Like {TinyTable}, an attractive feature of our protocol is a very fast and simple online evaluation phase. We also give a new method for efficiently implementing the preprocessing material required for the online phase using arithmetic circuits over characteristic two fields. This improves over the suggested method from {TinyTable} by at least a factor of 50.},
|
||
pages = {229--249},
|
||
booktitle = {Applied Cryptography and Network Security},
|
||
publisher = {Springer International Publishing},
|
||
author = {Keller, Marcel and Orsini, Emmanuela and Rotaru, Dragos and Scholl, Peter and Soria-Vazquez, Eduardo and Vivek, Srinivas},
|
||
editor = {Gollmann, Dieter and Miyaji, Atsuko and Kikuchi, Hiroaki},
|
||
urldate = {2024-02-26},
|
||
date = {2017},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-319-61204-1_12},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Keller et al. - 2017 - Faster Secure Multi-party Computation of AES and D.pdf:/home/jaseg/Zotero/storage/M6LSM6ML/Keller et al. - 2017 - Faster Secure Multi-party Computation of AES and D.pdf:application/pdf},
|
||
}
|
||
|
||
@article{noauthor_renesas_nodate,
|
||
title = {Renesas {RA}6T1 Group User's Manual: Hardware},
|
||
langid = {english},
|
||
file = {Renesas RA6T1 Group User's Manual Hardware.pdf:/home/jaseg/Zotero/storage/IZHL79MX/Renesas RA6T1 Group User's Manual Hardware.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{gevorgian_line_2001,
|
||
location = {London, England},
|
||
title = {Line Capacitance and Impedance of Coplanar-Strip Waveguides on Substrates with Multiple Dielectric Layers},
|
||
url = {http://ieeexplore.ieee.org/document/4140229/},
|
||
doi = {10.1109/EUMA.2001.339161},
|
||
abstract = {Closed form formulas for the basic parameters of Coplanar-Strip line on a finite thickness substrate are reviewed. New, improved formulas are derived using conformal mapping technique.},
|
||
eventtitle = {31st European Microwave Conference, 2001},
|
||
pages = {1--4},
|
||
booktitle = {31st European Microwave Conference, 2001},
|
||
publisher = {{IEEE}},
|
||
author = {Gevorgian, S. and Berg, H.},
|
||
urldate = {2024-04-16},
|
||
date = {2001-10},
|
||
langid = {english},
|
||
file = {Gevorgian and Berg - 2001 - Line Capacitance and Impedance of Coplanar-Strip W.pdf:/home/jaseg/Zotero/storage/922VM3UC/Gevorgian and Berg - 2001 - Line Capacitance and Impedance of Coplanar-Strip W.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{preneel_efficient_2018,
|
||
location = {Cham},
|
||
title = {Efficient Unconditionally Secure Signatures Using Universal Hashing},
|
||
volume = {10892},
|
||
isbn = {978-3-319-93386-3 978-3-319-93387-0},
|
||
url = {https://link.springer.com/10.1007/978-3-319-93387-0_8},
|
||
abstract = {Digital signatures are one of the most important cryptographic primitives. In this work we construct an information-theoretically secure signature scheme which, unlike prior schemes, enjoys a number of advantageous properties such as short signature length and high generation efficiency, to name two. In particular, we extend symmetric-key message authentication codes ({MACs}) based on universal hashing to make them transferable, a property absent from traditional {MAC} schemes. Our main results are summarised as follows.},
|
||
pages = {143--162},
|
||
booktitle = {Applied Cryptography and Network Security},
|
||
publisher = {Springer International Publishing},
|
||
author = {Amiri, Ryan and Abidin, Aysajan and Wallden, Petros and Andersson, Erika},
|
||
editor = {Preneel, Bart and Vercauteren, Frederik},
|
||
urldate = {2024-06-19},
|
||
date = {2018},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-319-93387-0_8},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Amiri et al. - 2018 - Efficient Unconditionally Secure Signatures Using .pdf:/home/jaseg/Zotero/storage/2EYFTVCY/Amiri et al. - 2018 - Efficient Unconditionally Secure Signatures Using .pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{dunkelman_secure_2022,
|
||
location = {Cham},
|
||
title = {Secure Multiparty Computation with Sublinear Preprocessing},
|
||
volume = {13275},
|
||
isbn = {978-3-031-06943-7 978-3-031-06944-4},
|
||
url = {https://link.springer.com/10.1007/978-3-031-06944-4_15},
|
||
pages = {427--457},
|
||
booktitle = {Advances in Cryptology – {EUROCRYPT} 2022},
|
||
publisher = {Springer International Publishing},
|
||
author = {Boyle, Elette and Gilboa, Niv and Ishai, Yuval and Nof, Ariel},
|
||
editor = {Dunkelman, Orr and Dziembowski, Stefan},
|
||
urldate = {2024-06-06},
|
||
date = {2022},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-031-06944-4_15},
|
||
}
|
||
|
||
@inproceedings{blanton_private_2012,
|
||
location = {Seoul Korea},
|
||
title = {Private and oblivious set and multiset operations},
|
||
isbn = {978-1-4503-1648-4},
|
||
url = {https://dl.acm.org/doi/10.1145/2414456.2414479},
|
||
doi = {10.1145/2414456.2414479},
|
||
eventtitle = {{ASIA} {CCS} '12: 7th {ACM} Symposium on Information, Compuer and Communications Security},
|
||
pages = {40--41},
|
||
publisher = {{ACM}},
|
||
author = {Blanton, Marina and Aguiar, Everaldo},
|
||
urldate = {2024-06-06},
|
||
date = {2012-05-02},
|
||
langid = {english},
|
||
}
|
||
|
||
@article{bennett_generalized_1995,
|
||
title = {Generalized privacy amplification},
|
||
volume = {41},
|
||
rights = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/{IEEE}.html},
|
||
issn = {00189448},
|
||
url = {http://ieeexplore.ieee.org/document/476316/},
|
||
doi = {10.1109/18.476316},
|
||
abstract = {This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard, and Robert for a special scenario. Privacy amplification is a process that allows two parties to distill a secret key from a common random variable about which an eavesdropper has partial information. The two parties generally know nothing about the eavesdropper’s information except that it satisfies a certain constraint. The results have applications to unconditionally secure secret-key agreement protocols and quantum cryptography, and they yield results on wiretap and broadcast channels for a considerably strengthened definition of secrecy capacity.},
|
||
pages = {1915--1923},
|
||
number = {6},
|
||
journaltitle = {{IEEE} Transactions on Information Theory},
|
||
shortjournal = {{IEEE} Trans. Inform. Theory},
|
||
author = {Bennett, C.H. and Brassard, G. and Crepeau, C. and Maurer, U.M.},
|
||
urldate = {2024-05-29},
|
||
date = {1995-11},
|
||
langid = {english},
|
||
file = {Bennett et al. - 1995 - Generalized privacy amplification.pdf:/home/jaseg/Zotero/storage/RP8LVYDL/Bennett et al. - 1995 - Generalized privacy amplification.pdf:application/pdf},
|
||
}
|
||
|
||
@article{portmann_key_2014,
|
||
title = {Key Recycling in Authentication},
|
||
volume = {60},
|
||
rights = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/{IEEE}.html},
|
||
issn = {0018-9448, 1557-9654},
|
||
url = {https://ieeexplore.ieee.org/document/6797875/},
|
||
doi = {10.1109/TIT.2014.2317312},
|
||
abstract = {In their seminal work on authentication, Wegman and Carter propose that to authenticate multiple messages, it is sufficient to reuse the same hash function as long as each tag is encrypted with a one-time pad. They argue that because the one-time pad is perfectly hiding, the hash function used remains completely unknown to the adversary. Since their proof is not composable, we revisit it using a composable security framework. It turns out that the above argument is insufficient: if the adversary learns whether a corrupted message was accepted or rejected, information about the hash function is leaked, and after a bounded finite amount of rounds it is completely known. We show however that this leak is very small: Wegman and Carter’s protocol is still ε-secure, if ε-almost strongly universal2 hash functions are used. This implies that the secret key corresponding to the choice of hash function can be reused in the next round of authentication without any additional error than this ε. We also show that if the players have a mild form of synchronization, namely that the receiver knows when a message should be received, the key can be recycled for any arbitrary task, not only new rounds of authentication.},
|
||
pages = {4383--4396},
|
||
number = {7},
|
||
journaltitle = {{IEEE} Transactions on Information Theory},
|
||
shortjournal = {{IEEE} Trans. Inform. Theory},
|
||
author = {Portmann, Christopher},
|
||
urldate = {2024-05-29},
|
||
date = {2014-07},
|
||
langid = {english},
|
||
file = {Portmann - 2014 - Key Recycling in Authentication.pdf:/home/jaseg/Zotero/storage/N2G8VMNP/Portmann - 2014 - Key Recycling in Authentication.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{maurer_authentication_2013,
|
||
location = {Istanbul, Turkey},
|
||
title = {Authentication amplification by synchronization},
|
||
isbn = {978-1-4799-0446-4},
|
||
url = {http://ieeexplore.ieee.org/document/6620719/},
|
||
doi = {10.1109/ISIT.2013.6620719},
|
||
abstract = {Information-theoretic message authentication is traditionally defined as the task of authenticating a message, transmitted over an insecure channel, using a secret key shared between sender and receiver. Previous results have investigated the trade-offs between key size, message size, and the adversary’s cheating probability.},
|
||
eventtitle = {2013 {IEEE} International Symposium on Information Theory ({ISIT})},
|
||
pages = {2711--2714},
|
||
booktitle = {2013 {IEEE} International Symposium on Information Theory},
|
||
publisher = {{IEEE}},
|
||
author = {Maurer, Ueli},
|
||
urldate = {2024-05-29},
|
||
date = {2013-07},
|
||
langid = {english},
|
||
file = {Maurer - 2013 - Authentication amplification by synchronization.pdf:/home/jaseg/Zotero/storage/S4I6UBNX/Maurer - 2013 - Authentication amplification by synchronization.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{voloshynovskiy_information-theoretic_2006,
|
||
location = {San Jose, {CA}},
|
||
title = {Information-theoretic analysis of electronic and printed document authentication},
|
||
url = {http://proceedings.spiedigitallibrary.org/proceeding.aspx?doi=10.1117/12.641940},
|
||
doi = {10.1117/12.641940},
|
||
abstract = {In this paper we consider the problem of document authentication in electronic and printed forms. We formulate this problem from the information-theoretic perspectives and present the joint source-channel coding theorems showing the performance limits in such protocols. We analyze the security of document authentication methods and present the optimal attacking strategies with corresponding complexity estimates that, contrarily to the existing studies, crucially rely on the information leaked by the authentication protocol. Finally, we present the results of experimental validation of the developed concept that justifies the practical efficiency of the elaborated framework.},
|
||
eventtitle = {Electronic Imaging 2006},
|
||
pages = {60721D},
|
||
author = {Voloshynovskiy, Sviatoslav and Koval, Oleksiy and Villan, Renato and Topak, Emre and Vila Forcén, José Emilio and Deguillaume, Frederic and Rytsar, Yuriy and Pun, Thierry},
|
||
editor = {Delp {III}, Edward J. and Wong, Ping Wah},
|
||
urldate = {2024-05-29},
|
||
date = {2006-02-02},
|
||
langid = {english},
|
||
file = {Voloshynovskiy et al. - 2006 - Information-theoretic analysis of electronic and p.pdf:/home/jaseg/Zotero/storage/EGDJZN37/Voloshynovskiy et al. - 2006 - Information-theoretic analysis of electronic and p.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{hutchison_unconditionally_2013,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Unconditionally Secure and Universally Composable Commitments from Physical Assumptions},
|
||
volume = {8270},
|
||
isbn = {978-3-642-42044-3 978-3-642-42045-0},
|
||
url = {http://link.springer.com/10.1007/978-3-642-42045-0_6},
|
||
abstract = {We present a constant-round unconditional black-box compiler that transforms any ideal (i.e., statistically-hiding and statistically-binding) straight-line extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to {UC}-security [9]. We exemplify the usefulness of our compiler by providing two (constant-round) instantiations of ideal straight-line extractable commitment based on (malicious) {PUFs} [37] and stateless tamper-proof hardware tokens [27], therefore achieving the rst unconditionally {UC}-secure commitment with malicious {PUFs} and stateless tokens, respectively. Our constructions are secure for adversaries creating arbitrarily malicious stateful {PUFs}/tokens.},
|
||
pages = {100--119},
|
||
booktitle = {Advances in Cryptology - {ASIACRYPT} 2013},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
author = {Damgård, Ivan and Scafuro, Alessandra},
|
||
editor = {Sako, Kazue and Sarkar, Palash},
|
||
editorb = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard},
|
||
editorbtype = {redactor},
|
||
urldate = {2024-05-29},
|
||
date = {2013},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-642-42045-0_6},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Damgård and Scafuro - 2013 - Unconditionally Secure and Universally Composable .pdf:/home/jaseg/Zotero/storage/PXJ2VHWV/Damgård and Scafuro - 2013 - Unconditionally Secure and Universally Composable .pdf:application/pdf},
|
||
}
|
||
|
||
@article{fernandez-hernandez_navigation_2016,
|
||
title = {A Navigation Message Authentication Proposal for the Galileo Open Service},
|
||
volume = {63},
|
||
issn = {2161-4296},
|
||
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/navi.125},
|
||
doi = {10.1002/navi.125},
|
||
abstract = {{GNSS} vulnerabilities have become evident in the last decade. Authentication of the {GNSS} signals and data can be an important building block contributing to mitigating these vulnerabilities. This paper presents a Navigation Message Authentication ({NMA}) scheme based on the Timed Efficient Stream Loss-tolerant Authentication ({TESLA}) protocol and a novel concept based on a single one-way chain for all senders and cross-authentication. The paper presents an {NMA} implementation in the Galileo Open Service ({OS}) navigation message that should provide similar navigation performance to data-authenticated users and standard non-authenticated users in terms of time to first fix, accuracy, and availability even in difficult reception conditions. The proposal also maintains a high level of signal unpredictability to help receivers protect against replay attacks. The scheme and implementation proposed yield significant improvements compared to the state of the art, offering the opportunity for Galileo to become the reference {GNSS} in civil navigation authentication. Copyright © 2016 Institute of Navigation},
|
||
pages = {85--102},
|
||
number = {1},
|
||
journaltitle = {{NAVIGATION}},
|
||
author = {Fernández-Hernández, Ignacio and Rijmen, Vincent and Seco-Granados, Gonzalo and Simon, Javier and Rodríguez, Irma and Calle, J. David},
|
||
urldate = {2024-05-29},
|
||
date = {2016},
|
||
langid = {english},
|
||
note = {\_eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1002/navi.125},
|
||
file = {Fernández-Hernández et al_2016_A Navigation Message Authentication Proposal for the Galileo Open Service.pdf:/home/jaseg/Sync/Research/Zotero/Fernández-Hernández et al_2016_A Navigation Message Authentication Proposal for the Galileo Open Service.pdf:application/pdf;Snapshot:/home/jaseg/Zotero/storage/IVWSDIZC/navi.html:text/html},
|
||
}
|
||
|
||
@article{alomair_information_nodate,
|
||
title = {Information Theoretically Secure Encryption with Almost Free Authentication},
|
||
abstract = {In cryptology, secure channels enable the exchange of messages in a confidential and authenticated manner. The literature of cryptology is rich with proposals and analysis that address the secure communication over public (insecure) channels. In this work, we propose an information theoretically secure direction for the construction of secure channels. First, we propose a method of achieving unconditionally secure authentication with half the amount of key material required by traditional unconditionally secure message authentication codes ({MACs}). Key reduction is achieved by utilizing the special structure of the authenticated encryption system. That is, authentication exploits the secrecy of the message to reduce the key material required for authentication. After the description of our method, since key material is the most important concern in unconditionally secure authentication, given the message is encrypted with a perfectly secret one-time pad cipher, we extend our method to achieve unconditionally secure authentication with almost free key material. That is, we propose a method for unconditionally authenticating arbitrarily long messages with much shorter keys. Finally, we will show how the special structure of the authenticated encryption systems can be exploited to achieve provably secure authentication that is very efficient for the authentication of short messages.},
|
||
author = {Alomair, Basel},
|
||
langid = {english},
|
||
file = {Alomair - Information Theoretically Secure Encryption with A.pdf:/home/jaseg/Zotero/storage/ITYF3KAN/Alomair - Information Theoretically Secure Encryption with A.pdf:application/pdf},
|
||
}
|
||
|
||
@article{gonzalez_information_2013,
|
||
title = {Information Theoretically Secure, Enhanced Johnson Noise Based Key Distribution over the Smart Grid with Switched Filters},
|
||
volume = {8},
|
||
issn = {1932-6203},
|
||
url = {https://dx.plos.org/10.1371/journal.pone.0070206},
|
||
doi = {10.1371/journal.pone.0070206},
|
||
abstract = {We introduce a protocol with a reconfigurable filter system to create non-overlapping single loops in the smart power grid for the realization of the Kirchhoff-Law-Johnson-(like)-Noise secure key distribution system. The protocol is valid for onedimensional radial networks (chain-like power line) which are typical of the electricity distribution network between the utility and the customer. The speed of the protocol (the number of steps needed) versus grid size is analyzed. When properly generalized, such a system has the potential to achieve unconditionally secure key distribution over the smart power grid of arbitrary geometrical dimensions.},
|
||
pages = {e70206},
|
||
number = {7},
|
||
journaltitle = {{PLoS} {ONE}},
|
||
shortjournal = {{PLoS} {ONE}},
|
||
author = {Gonzalez, Elias and Kish, Laszlo B. and Balog, Robert S. and Enjeti, Prasad},
|
||
editor = {Abbott, Derek},
|
||
urldate = {2024-05-29},
|
||
date = {2013-07-25},
|
||
langid = {english},
|
||
file = {Gonzalez et al. - 2013 - Information Theoretically Secure, Enhanced Johnson.pdf:/home/jaseg/Zotero/storage/Z5G4ZLGR/Gonzalez et al. - 2013 - Information Theoretically Secure, Enhanced Johnson.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{goos_information_1999,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Information Theoretically Secure Communication in the Limited Storage Space Model},
|
||
volume = {1666},
|
||
isbn = {978-3-540-66347-8 978-3-540-48405-9},
|
||
url = {http://link.springer.com/10.1007/3-540-48405-1_5},
|
||
abstract = {We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-storage-space model postulates an eavesdropper who can execute arbitrarily complex computations, and is only limited in the total amount of storage space (not computation space) available to him. The bound on the storage space can be arbitrarily large (e.g. terabytes), as long as it is fixed. Given this bound, the protocol guarantees that the probability of the eavesdropper of gaining any information on the message is exponentially small. The proof of our main results utilizes a novel combination of linear algebra and Kolmogorov complexity considerations.},
|
||
pages = {65--79},
|
||
booktitle = {Advances in Cryptology — {CRYPTO}’ 99},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
author = {Goos, Gerhard and Hartmanis, Juris and van Leeuwen, Jan and Aumann, Yonatan and Rabin, Michael O.},
|
||
editor = {Wiener, Michael},
|
||
urldate = {2024-05-29},
|
||
date = {1999},
|
||
langid = {english},
|
||
doi = {10.1007/3-540-48405-1_5},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Goos et al. - 1999 - Information Theoretically Secure Communication in .pdf:/home/jaseg/Zotero/storage/J7DQKVVH/Goos et al. - 1999 - Information Theoretically Secure Communication in .pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{goos_information-theoretically_1997,
|
||
location = {Berlin, Heidelberg},
|
||
title = {Information-Theoretically Secure Secret-Key Agreement by {NOT} Authenticated Public Discussion},
|
||
volume = {1233},
|
||
isbn = {978-3-540-62975-7 978-3-540-69053-5},
|
||
url = {http://link.springer.com/10.1007/3-540-69053-0_15},
|
||
abstract = {All information-theoretically secure key agreement protocols (e.g. based on quantum cryptography or on noisy channels) described in the literature are secure only against passive adversaries in the sense that they assume the existence of an authenticated public channel. The goal of this paper is to investigate information-theoretic security even against active adversaries with complete control over the communication channel connecting the two parties who want to agree on a secret key. Several impossibility results are proved and some scenarios are characterized in which secret-key agreement secure against active adversaries is possible. In particular, when each of the parties, including the adversary, can observe a sequence of random variables that are correlated between the parties, the rate at which key agreement against active adversaries is possible is characterized completely: it is either 0 or equal to the rate achievable against passive adversaries, and the condition for distinguishing between the two cases is given.},
|
||
pages = {209--225},
|
||
booktitle = {Advances in Cryptology — {EUROCRYPT} ’97},
|
||
publisher = {Springer Berlin Heidelberg},
|
||
author = {Maurer, Ueli},
|
||
editor = {Fumy, Walter},
|
||
editorb = {Goos, Gerhard and Hartmanis, Juris and van Leeuwen, Jan},
|
||
editorbtype = {redactor},
|
||
urldate = {2024-05-29},
|
||
date = {1997},
|
||
langid = {english},
|
||
doi = {10.1007/3-540-69053-0_15},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Maurer - 1997 - Information-Theoretically Secure Secret-Key Agreem.pdf:/home/jaseg/Zotero/storage/Y24TQ9UT/Maurer - 1997 - Information-Theoretically Secure Secret-Key Agreem.pdf:application/pdf},
|
||
}
|
||
|
||
@article{laudenbach_continuous-variable_2018,
|
||
title = {Continuous-Variable Quantum Key Distribution with Gaussian Modulation -- The Theory of Practical Implementations},
|
||
volume = {1},
|
||
issn = {2511-9044, 2511-9044},
|
||
url = {http://arxiv.org/abs/1703.09278},
|
||
doi = {10.1002/qute.201800011},
|
||
abstract = {Quantum key distribution using weak coherent states and homodyne detection is a promising candidate for practical quantum-cryptographic implementations due to its compatibility with existing telecom equipment and high detection efficiencies. However, despite the actual simplicity of the protocol, the security analysis of this method is rather involved compared to discrete-variable {QKD}. In this article we review the theoretical foundations of continuous-variable quantum key distribution ({CV}-{QKD}) with Gaussian modulation and rederive the essential relations from scratch in a pedagogical way. The aim of this paper is to be as comprehensive and self-contained as possible in order to be well intelligible even for readers with little pre-knowledge on the subject. Although the present article is a theoretical discussion of {CV}-{QKD}, its focus lies on practical implementations, taking into account various kinds of hardware imperfections and suggesting practical methods to perform the security analysis subsequent to the key exchange. Apart from a review of well known results, this manuscript presents a set of new original noise models which are helpful to get an estimate of how well a given set of hardware will perform in practice.},
|
||
pages = {1800011},
|
||
number = {1},
|
||
journaltitle = {Advanced Quantum Technologies},
|
||
shortjournal = {Adv Quantum Tech},
|
||
author = {Laudenbach, Fabian and Pacher, Christoph and Fung, Chi-Hang Fred and Poppe, Andreas and Peev, Momtchil and Schrenk, Bernhard and Hentschel, Michael and Walther, Philip and Hübel, Hannes},
|
||
urldate = {2024-05-27},
|
||
date = {2018-08},
|
||
langid = {english},
|
||
eprinttype = {arxiv},
|
||
eprint = {1703.09278 [quant-ph]},
|
||
keywords = {Quantum Physics},
|
||
file = {Laudenbach et al. - 2018 - Continuous-Variable Quantum Key Distribution with .pdf:/home/jaseg/Zotero/storage/I7UL2SKX/Laudenbach et al. - 2018 - Continuous-Variable Quantum Key Distribution with .pdf:application/pdf},
|
||
}
|
||
|
||
@misc{bartusek_cryptography_2023,
|
||
title = {Cryptography with Certified Deletion},
|
||
url = {http://arxiv.org/abs/2207.01754},
|
||
abstract = {We propose a unifying framework that yields an array of cryptographic primitives with certified deletion. These primitives enable a party in possession of a quantum ciphertext to generate a classical certificate that the encrypted plaintext has been information-theoretically deleted, and cannot be recovered even given unbounded computational resources.},
|
||
number = {{arXiv}:2207.01754},
|
||
publisher = {{arXiv}},
|
||
author = {Bartusek, James and Khurana, Dakshita},
|
||
urldate = {2024-05-23},
|
||
date = {2023-04-20},
|
||
langid = {english},
|
||
eprinttype = {arxiv},
|
||
eprint = {2207.01754 [quant-ph]},
|
||
keywords = {Computer Science - Cryptography and Security, Quantum Physics},
|
||
file = {Bartusek and Khurana - 2023 - Cryptography with Certified Deletion.pdf:/home/jaseg/Zotero/storage/PT8K829W/Bartusek and Khurana - 2023 - Cryptography with Certified Deletion.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{impagliazzo_personal_1995,
|
||
location = {Minneapolis, {MN}, {USA}},
|
||
title = {A personal view of average-case complexity},
|
||
isbn = {978-0-8186-7052-7},
|
||
url = {http://ieeexplore.ieee.org/document/514853/},
|
||
doi = {10.1109/SCT.1995.514853},
|
||
eventtitle = {Structure in Complexity Theory. Tenth Annual {IEEE} Conference},
|
||
pages = {134--147},
|
||
booktitle = {Proceedings of Structure in Complexity Theory. Tenth Annual {IEEE} Conference},
|
||
publisher = {{IEEE} Comput. Soc. Press},
|
||
author = {Impagliazzo, R.},
|
||
urldate = {2024-05-22},
|
||
date = {1995},
|
||
file = {Impagliazzo_1995_A personal view of average-case complexity.pdf:/home/jaseg/Sync/Research/Zotero/Impagliazzo_1995_A personal view of average-case complexity.pdf:application/pdf},
|
||
}
|
||
|
||
@online{noauthor_ieee_nodate,
|
||
title = {{IEEE} Xplore Full-Text {PDF}:},
|
||
url = {https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=514853},
|
||
urldate = {2024-05-22},
|
||
file = {IEEE Xplore Full-Text PDF\::/home/jaseg/Zotero/storage/U6BHG3AD/stamp.html:text/html},
|
||
}
|
||
|
||
@article{lella_security_2023,
|
||
title = {On the Security of Quantum Key Distribution Networks},
|
||
volume = {7},
|
||
rights = {http://creativecommons.org/licenses/by/3.0/},
|
||
issn = {2410-387X},
|
||
url = {https://www.mdpi.com/2410-387X/7/4/53},
|
||
doi = {10.3390/cryptography7040053},
|
||
abstract = {The main purpose of a quantum key distribution network is to provide secret keys to any users or applications requiring a high level of security, ideally such as to offer the best protection against any computational attack, even of a quantum nature. The keys shared through a point-to-point link between a source and a detector using a quantum key distribution protocol can be proven information-theoretically secure based on the quantum information theory. However, evaluating the security of a quantum key distribution network, especially if it is based on relay nodes, goes far beyond the quantum security of its single quantum links, involving aspects of conventional security for devices and their communication channels. In this contribution, we perform a rigorous threat analysis based on the most recent recommendations and practical network deployment security issues. We show that, at least in the current state of our understanding of quantum cryptography, quantum key distribution networks can only offer computational security and that their security in practical implementations in the shorter term requires resorting to post-quantum cryptography.},
|
||
pages = {53},
|
||
number = {4},
|
||
journaltitle = {Cryptography},
|
||
author = {Lella, Eufemia and Schmid, Giovanni},
|
||
urldate = {2024-05-22},
|
||
date = {2023-12},
|
||
langid = {english},
|
||
note = {Number: 4
|
||
Publisher: Multidisciplinary Digital Publishing Institute},
|
||
keywords = {post-quantum cryptography, quantum key distribution, security controls, threat analysis, unconditional secrecy},
|
||
file = {Lella_Schmid_2023_On the Security of Quantum Key Distribution Networks.pdf:/home/jaseg/Sync/Research/Zotero/Lella_Schmid_2023_On the Security of Quantum Key Distribution Networks.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{restelli_quantum_2009,
|
||
location = {San Jose, {CA}},
|
||
title = {Quantum key distribution at {GHz} transmission rates},
|
||
url = {http://proceedings.spiedigitallibrary.org/proceeding.aspx?doi=10.1117/12.809461},
|
||
doi = {10.1117/12.809461},
|
||
abstract = {Quantum key distribution ({QKD}) channels are typically realized by transmitting and detecting single photons, and therefore suffer from dramatic reductions in throughput due to both channel loss and noise. These shortcomings can be mitigated by applying telecommunications clock-recovery techniques to maximize the bandwidth of the single-photon channel and minimize the system’s exposure to noise. We demonstrate a {QKD} system operating continuously at a quantum-channel transmission rate of 1.25 {GHz}, with dedicated data-handling hardware and error-correction/privacy amplification. We discuss the design and performance of our system and highlight issues which limit our maximum transmission and key production rates.},
|
||
eventtitle = {{SPIE} {OPTO}: Integrated Optoelectronic Devices},
|
||
pages = {72360L},
|
||
author = {Restelli, Alessandro and Bienfang, Joshua C. and Mink, Alan and Clark, Charles W.},
|
||
editor = {Arakawa, Yasuhiko and Sasaki, Masahide and Sotobayashi, Hideyuki},
|
||
urldate = {2024-05-22},
|
||
date = {2009-01-24},
|
||
langid = {english},
|
||
file = {Restelli et al. - 2009 - Quantum key distribution at GHz transmission rates.pdf:/home/jaseg/Zotero/storage/XDSSUQKY/Restelli et al. - 2009 - Quantum key distribution at GHz transmission rates.pdf:application/pdf},
|
||
}
|
||
|
||
@article{lucamarini_overcoming_2018,
|
||
title = {Overcoming the rate–distance limit of quantum key distribution without quantum repeaters},
|
||
volume = {557},
|
||
issn = {0028-0836, 1476-4687},
|
||
url = {https://www.nature.com/articles/s41586-018-0066-6},
|
||
doi = {10.1038/s41586-018-0066-6},
|
||
pages = {400--403},
|
||
number = {7705},
|
||
journaltitle = {Nature},
|
||
shortjournal = {Nature},
|
||
author = {Lucamarini, M. and Yuan, Z. L. and Dynes, J. F. and Shields, A. J.},
|
||
urldate = {2024-05-21},
|
||
date = {2018-05},
|
||
langid = {english},
|
||
file = {Lucamarini et al. - 2018 - Overcoming the rate–distance limit of quantum key .pdf:/home/jaseg/Zotero/storage/NUNHFGTD/Lucamarini et al. - 2018 - Overcoming the rate–distance limit of quantum key .pdf:application/pdf},
|
||
}
|
||
|
||
@article{huttner_long-range_2022,
|
||
title = {Long-range {QKD} without trusted nodes is not possible with current technology},
|
||
volume = {8},
|
||
issn = {2056-6387},
|
||
url = {https://www.nature.com/articles/s41534-022-00613-4},
|
||
doi = {10.1038/s41534-022-00613-4},
|
||
pages = {108},
|
||
number = {1},
|
||
journaltitle = {npj Quantum Information},
|
||
shortjournal = {npj Quantum Inf},
|
||
author = {Huttner, Bruno and Alléaume, Romain and Diamanti, Eleni and Fröwis, Florian and Grangier, Philippe and Hübel, Hannes and Martin, Vicente and Poppe, Andreas and Slater, Joshua A. and Spiller, Tim and Tittel, Wolfgang and Tranier, Benoit and Wonfor, Adrian and Zbinden, Hugo},
|
||
urldate = {2024-05-21},
|
||
date = {2022-09-09},
|
||
langid = {english},
|
||
file = {Huttner et al_2022_Long-range QKD without trusted nodes is not possible with current technology.pdf:/home/jaseg/Sync/Research/Zotero/Huttner et al_2022_Long-range QKD without trusted nodes is not possible with current technology.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{barnett_securing_2011,
|
||
location = {Dubai, United Arab Emirates},
|
||
title = {Securing a quantum key distribution relay network using secret sharing},
|
||
isbn = {978-1-61284-118-2},
|
||
url = {http://ieeexplore.ieee.org/document/5752491/},
|
||
doi = {10.1109/IEEEGCC.2011.5752491},
|
||
abstract = {We present a simple new technique to secure quantum key distribution relay networks using secret sharing. Previous techniques have relied on creating distinct physical paths in order to create the shares. We show, however, how this can be achieved on a single physical path by creating distinct logical channels. The technique utilizes a random ‘drop-out’ scheme to ensure that an attacker must compromise all of the relays on the channel in order to access the key.},
|
||
eventtitle = {2011 {IEEE} {GCC} Conference and Exhibition ({GCC})},
|
||
pages = {143--145},
|
||
booktitle = {2011 {IEEE} {GCC} Conference and Exhibition ({GCC})},
|
||
publisher = {{IEEE}},
|
||
author = {Barnett, S. M. and Phoenix, S. J. D.},
|
||
urldate = {2024-05-21},
|
||
date = {2011-02},
|
||
langid = {english},
|
||
file = {Barnett and Phoenix - 2011 - Securing a quantum key distribution relay network .pdf:/home/jaseg/Zotero/storage/4PL34JUV/Barnett and Phoenix - 2011 - Securing a quantum key distribution relay network .pdf:application/pdf},
|
||
}
|
||
|
||
@article{wang_topological_2020,
|
||
title = {Topological optimization of hybrid quantum key distribution networks},
|
||
volume = {28},
|
||
issn = {1094-4087},
|
||
url = {https://opg.optica.org/abstract.cfm?URI=oe-28-18-26348},
|
||
doi = {10.1364/OE.401672},
|
||
abstract = {With the growing complexity of quantum key distribution ({QKD}) network structures, aforehand topology design is of great significance to support a large-number of nodes over a large-spatial area. However, the exclusivity of quantum channels, the limitation of key generation capabilities, the variety of {QKD} protocols and the necessity of untrusted-relay selection, make the optimal topology design a very complicated task. In this research, a hybrid {QKD} network is studied for the first time from the perspective of topology, by analyzing the topological differences of various {QKD} protocols. In addition, to make full use of hybrid networking, an analytical model for optimal topology calculation is proposed, to reach the goal of best secure communication service by optimizing the deployment of various {QKD} devices and the selection of untrusted-relays under a given cost limit. Plentiful simulation results show that hybrid networking and untrusted-relay selection can bring great performance advantages, and then the universality and effectiveness of the proposed analytical model are verified.},
|
||
pages = {26348},
|
||
number = {18},
|
||
journaltitle = {Optics Express},
|
||
shortjournal = {Opt. Express},
|
||
author = {Wang, Yaxing and Li, Qiong and Mao, Haokun and Han, Qi and Huang, Furong and Xu, Hongwei},
|
||
urldate = {2024-05-21},
|
||
date = {2020-08-31},
|
||
langid = {english},
|
||
file = {Wang et al. - 2020 - Topological optimization of hybrid quantum key dis.pdf:/home/jaseg/Zotero/storage/S93U8AF3/Wang et al. - 2020 - Topological optimization of hybrid quantum key dis.pdf:application/pdf},
|
||
}
|
||
|
||
@article{wang_cascading_2021,
|
||
title = {Cascading attack on trusted-relay quantum key distribution networks},
|
||
volume = {73},
|
||
issn = {0253-6102, 1572-9494},
|
||
url = {https://iopscience.iop.org/article/10.1088/1572-9494/abeedc},
|
||
doi = {10.1088/1572-9494/abeedc},
|
||
abstract = {Trusted relays are the main state-of-the-art way to realize quantum key distribution networks. However, it is hard to require that all nodes in the network are fully trusted. In a multipath keytransmission mechanism, the nodes can be weakly trusted because the secret key can be split into many parts and each part is transmitted to the receiver through a different path. However, if the capacity of a node’s quantum key pool is poorly designed, an attacker, Eve may eavesdrop on the communicating parties’ secret message by initiating a redirection attack. In this paper, we show that Eve can trigger a cascading collapse effect by collapsing one of the edges in the network and forcing the communication parties to transmit the message through the nodes controlled by Eve. The influence of the traffic transfer ratio and the control parameters of the edge load on the breakdown probability of the edge are analyzed using a simulation. In order to effectively defend against the cascading attack, it is important for the designer to handle the relationship between the traffic and the capacity of the quantum key pool of each node in the network.},
|
||
pages = {065105},
|
||
number = {6},
|
||
journaltitle = {Communications in Theoretical Physics},
|
||
shortjournal = {Commun. Theor. Phys.},
|
||
author = {Wang, Jian and Liu, Xing-tong},
|
||
urldate = {2024-05-21},
|
||
date = {2021-06-01},
|
||
langid = {english},
|
||
file = {Wang and Liu - 2021 - Cascading attack on trusted-relay quantum key dist.pdf:/home/jaseg/Zotero/storage/KBKFVCHU/Wang and Liu - 2021 - Cascading attack on trusted-relay quantum key dist.pdf:application/pdf},
|
||
}
|
||
|
||
@article{lo_measurement-device-independent_2012,
|
||
title = {Measurement-Device-Independent Quantum Key Distribution},
|
||
volume = {108},
|
||
rights = {http://link.aps.org/licenses/aps-default-license},
|
||
issn = {0031-9007, 1079-7114},
|
||
url = {https://link.aps.org/doi/10.1103/PhysRevLett.108.130503},
|
||
doi = {10.1103/PhysRevLett.108.130503},
|
||
pages = {130503},
|
||
number = {13},
|
||
journaltitle = {Physical Review Letters},
|
||
shortjournal = {Phys. Rev. Lett.},
|
||
author = {Lo, Hoi-Kwong and Curty, Marcos and Qi, Bing},
|
||
urldate = {2024-05-21},
|
||
date = {2012-03-30},
|
||
langid = {english},
|
||
file = {Lo et al. - 2012 - Measurement-Device-Independent Quantum Key Distrib.pdf:/home/jaseg/Zotero/storage/Y7DKAXM6/Lo et al. - 2012 - Measurement-Device-Independent Quantum Key Distrib.pdf:application/pdf},
|
||
}
|
||
|
||
@article{yang_quantum_2018,
|
||
title = {Quantum key distribution network: Optimal secret-key-aware routing method for trust relaying},
|
||
volume = {15},
|
||
issn = {1673-5447},
|
||
url = {https://ieeexplore.ieee.org/document/8300270/},
|
||
doi = {10.1109/CC.2018.8300270},
|
||
shorttitle = {Quantum key distribution network},
|
||
abstract = {Since the {QKD} network can overcome the distance limitation and expand the point-to-point {QKD} system to a multi-user key distribution system, some testing {QKD} networks have been built. However, all of this previous research seldom focused on the routing mechanism of {QKD} network in detail. Therefore, this paper focuses on the routing issue in trust relaying {QKD} network, builds a model of the trust relaying {QKD} network and proposes a secret-key-aware routing method. In our method, a dynamic model for the residual local key is proposed to forecast the residual local key quantity of each {QKD} link more accurately, and the cost of {QKD} link and relaying path are defined by multiple affecting factors, e.g. the generation, consumption rate and the local key depletion index. The proposed method is implemented and evaluated in a simulation environment. The simulation results show that our routing method can increase the success rate of key exchange, make all the {QKD} links participate key exchange with almost equal opportunity to achieve load balance, and trade off the local key generation and consumption of each {QKD} link. Therefore, our proposed method can contribute to effectively improve the holistic performance of the trust relaying {QKD} network.},
|
||
pages = {33--45},
|
||
number = {2},
|
||
journaltitle = {China Communications},
|
||
shortjournal = {China Commun.},
|
||
author = {Yang, Chao and Zhang, Hongqi and Su, Jinhai},
|
||
urldate = {2024-05-21},
|
||
date = {2018-02},
|
||
langid = {english},
|
||
file = {Yang et al. - 2018 - Quantum key distribution network Optimal secret-k.pdf:/home/jaseg/Zotero/storage/9BBJ86AQ/Yang et al. - 2018 - Quantum key distribution network Optimal secret-k.pdf:application/pdf},
|
||
}
|
||
|
||
@article{cao_hybrid_2021,
|
||
title = {Hybrid Trusted/Untrusted Relay-Based Quantum Key Distribution Over Optical Backbone Networks},
|
||
volume = {39},
|
||
issn = {0733-8716, 1558-0008},
|
||
url = {https://ieeexplore.ieee.org/document/9373434/},
|
||
doi = {10.1109/JSAC.2021.3064662},
|
||
abstract = {Quantum key distribution ({QKD}) has demonstrated a great potential to provide future-proofed security, especially for 5G and beyond communications. As the critical infrastructure for 5G and beyond communications, optical networks can offer a cost-effective solution to {QKD} deployment utilizing the existing fiber resources. In particular, measurement-device-independent {QKD} shows its ability to extend the secure distance with the aid of an untrusted relay. Compared to the trusted relay, the untrusted relay has obviously better security, since it does not rely on any assumption on measurement and even allows to be accessed by an eavesdropper. However, it cannot extend {QKD} to an arbitrary distance like the trusted relay, such that it is expected to be combined with the trusted relay for large-scale {QKD} deployment. In this work, we study the hybrid trusted/untrusted relay based {QKD} deployment over optical backbone networks and focus on cost optimization during the deployment phase. A new network architecture of hybrid trusted/untrusted relay based {QKD} over optical backbone networks is described, where the node structures of the trusted relay and untrusted relay are elaborated. The corresponding network, cost, and security models are formulated. To optimize the deployment cost, an integer linear programming model and a heuristic algorithm are designed. Numerical simulations verify that the cost-optimized design can significantly outperform the benchmark algorithm in terms of deployment cost and security level. Up to 25\% cost saving can be achieved by deploying {QKD} with the hybrid trusted/untrusted relay scheme while keeping much higher security level relative to the conventional point-to-point {QKD} protocols that are only with the trusted relays.},
|
||
pages = {2701--2718},
|
||
number = {9},
|
||
journaltitle = {{IEEE} Journal on Selected Areas in Communications},
|
||
shortjournal = {{IEEE} J. Select. Areas Commun.},
|
||
author = {Cao, Yuan and Zhao, Yongli and Li, Jun and Lin, Rui and Zhang, Jie and Chen, Jiajia},
|
||
urldate = {2024-05-21},
|
||
date = {2021-09},
|
||
langid = {english},
|
||
file = {Cao et al. - 2021 - Hybrid TrustedUntrusted Relay-Based Quantum Key D.pdf:/home/jaseg/Zotero/storage/7DI3CGYK/Cao et al. - 2021 - Hybrid TrustedUntrusted Relay-Based Quantum Key D.pdf:application/pdf},
|
||
}
|
||
|
||
@article{yu_secret-key_2022,
|
||
title = {Secret-Key Provisioning With Collaborative Routing in Partially-Trusted-Relay-based Quantum-Key-Distribution-Secured Optical Networks},
|
||
volume = {40},
|
||
rights = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/{IEEE}.html},
|
||
issn = {0733-8724, 1558-2213},
|
||
url = {https://ieeexplore.ieee.org/document/9721069/},
|
||
doi = {10.1109/JLT.2022.3153992},
|
||
pages = {3530--3545},
|
||
number = {12},
|
||
journaltitle = {Journal of Lightwave Technology},
|
||
shortjournal = {J. Lightwave Technol.},
|
||
author = {Yu, Xiaosong and Liu, Yuhang and Zou, Xingyu and Cao, Yuan and Zhao, Yongli and Nag, Avishek and Zhang, Jie},
|
||
urldate = {2024-05-21},
|
||
date = {2022-06-15},
|
||
langid = {english},
|
||
file = {Yu et al. - 2022 - Secret-Key Provisioning With Collaborative Routing.pdf:/home/jaseg/Zotero/storage/Q2LQVJM7/Yu et al. - 2022 - Secret-Key Provisioning With Collaborative Routing.pdf:application/pdf},
|
||
}
|
||
|
||
@article{xu_measurement-device-independent_2015,
|
||
title = {Measurement-device-independent quantum cryptography},
|
||
volume = {21},
|
||
issn = {1077-260X, 1558-4542},
|
||
url = {http://arxiv.org/abs/1409.5157},
|
||
doi = {10.1109/JSTQE.2014.2381460},
|
||
abstract = {In theory, quantum key distribution ({QKD}) provides information-theoretic security based on the laws of physics. Owing to the imperfections of real-life implementations, however, there is a big gap between the theory and practice of {QKD}, which has been recently exploited by several quantum hacking activities. To fill this gap, a novel approach, called measurementdevice-independent {QKD} ({mdiQKD}), has been proposed. It can remove all side-channels from the measurement unit, arguably the most vulnerable part in {QKD} systems, thus offering a clear avenue towards secure {QKD} realisations. Here, we review the latest developments in the framework of {mdiQKD}, together with its assumptions, strengths and weaknesses.},
|
||
pages = {148--158},
|
||
number = {3},
|
||
journaltitle = {{IEEE} Journal of Selected Topics in Quantum Electronics},
|
||
shortjournal = {{IEEE} J. Select. Topics Quantum Electron.},
|
||
author = {Xu, Feihu and Curty, Marcos and Qi, Bing and Lo, Hoi-Kwong},
|
||
urldate = {2024-05-21},
|
||
date = {2015-05},
|
||
langid = {english},
|
||
eprinttype = {arxiv},
|
||
eprint = {1409.5157 [quant-ph]},
|
||
keywords = {Quantum Physics},
|
||
file = {Xu et al. - 2015 - Measurement-device-independent quantum cryptograph.pdf:/home/jaseg/Zotero/storage/WYVII6DL/Xu et al. - 2015 - Measurement-device-independent quantum cryptograph.pdf:application/pdf},
|
||
}
|
||
|
||
@article{marhoefer_applicability_nodate,
|
||
title = {Applicability of Quantum Cryptography for Securing Mobile Communication Networks},
|
||
abstract = {After 20 years of basic research, quantum cryptography has meanwhile led to first commercial products. Its progress has triggered high publicity and additional R\&D funding. The aim of this paper is to evaluate the status of quantum cryptography regarding its practical applicability for securing (mobile) communication networks. With that aim in mind, the paper presents a survey of the state-of-the-art, an analysis of its practical constraints and still open R\&D challenges, and some candidate applications for securing mobile communication networks. First industrial applications of quantum cryptography have become reality; more applications may soon reach practical maturity due to recent technological progress.},
|
||
author = {Marhoefer, Michael and Wimberger, Ilse and Poppe, Andreas},
|
||
langid = {english},
|
||
file = {Marhoefer et al. - Applicability of Quantum Cryptography for Securing.pdf:/home/jaseg/Zotero/storage/FCPRRWEK/Marhoefer et al. - Applicability of Quantum Cryptography for Securing.pdf:application/pdf},
|
||
}
|
||
|
||
@article{wegman_new_1981,
|
||
title = {New hash functions and their use in authentication and set equality},
|
||
volume = {22},
|
||
rights = {https://www.elsevier.com/tdm/userlicense/1.0/},
|
||
issn = {00220000},
|
||
url = {https://linkinghub.elsevier.com/retrieve/pii/0022000081900337},
|
||
doi = {10.1016/0022-0000(81)90033-7},
|
||
pages = {265--279},
|
||
number = {3},
|
||
journaltitle = {Journal of Computer and System Sciences},
|
||
shortjournal = {Journal of Computer and System Sciences},
|
||
author = {Wegman, Mark N. and Carter, J.Lawrence},
|
||
urldate = {2024-05-21},
|
||
date = {1981-06},
|
||
langid = {english},
|
||
}
|
||
|
||
@article{yang_fpga-based_2021,
|
||
title = {An {FPGA}-Based {LDPC} Decoder With Ultra-Long Codes for Continuous-Variable Quantum Key Distribution},
|
||
volume = {9},
|
||
rights = {https://creativecommons.org/licenses/by/4.0/legalcode},
|
||
issn = {2169-3536},
|
||
url = {https://ieeexplore.ieee.org/document/9376906/},
|
||
doi = {10.1109/ACCESS.2021.3065776},
|
||
abstract = {In this paper, we propose a good decoding performance, low-complexity, and high-speed decoder architecture for ultra-long quasi-cyclic {LDPC} codes by using the layered sum-product decoding scheme. To reduce implementation complexity and hardware resource consumption, the messages in the iteration process are uniformly quantified and the function (x) is approximated with second-order functions. The decoder architecture improves the decoding throughput by using partial parallel and pipeline structures. A modified construction method of parity check matrices was applied to prevent read\&write conflicts and achieve high-speed pipeline structure. The simulation results show that our decoder architecture has good performance at signal-to-noise ratios ({SNRs}) as low as −0.6 {dB}. We have implemented our decoder architecture on a Virtex-7 {XC}7VX690T field programmable gate array ({FPGA}) device. The implementation results show that the {FPGA}-based {LDPC} decoder can achieve throughputs of 108.64 Mb/s and 70.32 Mb/s at {SNR} of 1.0 {dB} when the code length is 262,144 and 349,952, respectively. The decoder can find useful applications in those scenarios that require very low {SNRs} and high throughputs, such as the information reconciliation of continuous-variable quantum key distribution.},
|
||
pages = {47687--47697},
|
||
journaltitle = {{IEEE} Access},
|
||
shortjournal = {{IEEE} Access},
|
||
author = {Yang, Shen-Shen and Liu, Jian-Qiang and Lu, Zhen-Guo and Bai, Zeng-Liang and Wang, Xu-Yang and Li, Yong-Min},
|
||
urldate = {2024-05-21},
|
||
date = {2021},
|
||
langid = {english},
|
||
file = {Yang et al. - 2021 - An FPGA-Based LDPC Decoder With Ultra-Long Codes f.pdf:/home/jaseg/Zotero/storage/3GQBXIIG/Yang et al. - 2021 - An FPGA-Based LDPC Decoder With Ultra-Long Codes f.pdf:application/pdf},
|
||
}
|
||
|
||
@article{ren_hybrid_2022,
|
||
title = {Hybrid quantum key distribution network},
|
||
volume = {65},
|
||
issn = {1674-733X, 1869-1919},
|
||
url = {https://link.springer.com/10.1007/s11432-022-3509-6},
|
||
doi = {10.1007/s11432-022-3509-6},
|
||
abstract = {Quantum key distribution ({QKD}) is now moving toward a scalable and secure {QKD} network, which establishes secret keys among network users. The continuous-variable ({CV}) and discrete-variable ({DV}) {QKD} systems are currently being developed in parallel and are all used in {QKD} networks. We propose here a hybrid {QKD} network, in which the {CV} {QKD} system is used to build metropolitan {QKD} networks, and the {DV} {QKD} system is used to connect metropolitan {QKD} networks. The hybrid {QKD} network takes advantage of high secret key rates for {CV} {QKD} systems and long distance for {DV} {QKD} systems. We also present a feasible hybrid measurement-device-independent ({MDI}) {QKD} network, which combines both {CV} and {DV} {MDI} {QKD} systems. The presented hybrid {QKD} networks meet the low cost and compact requirement of a realistic {QKD} network and provide a feasible solution for future real {QKD} networks by combining the advantages of both {CV} and {DV} {QKD} systems.},
|
||
pages = {200502},
|
||
number = {10},
|
||
journaltitle = {Science China Information Sciences},
|
||
shortjournal = {Sci. China Inf. Sci.},
|
||
author = {Ren, Siyu and Wang, Yu and Su, Xiaolong},
|
||
urldate = {2024-05-21},
|
||
date = {2022-10},
|
||
langid = {english},
|
||
file = {Ren et al. - 2022 - Hybrid quantum key distribution network.pdf:/home/jaseg/Zotero/storage/TA6CK85C/Ren et al. - 2022 - Hybrid quantum key distribution network.pdf:application/pdf},
|
||
}
|
||
|
||
@online{noauthor_httpsarxivorgpdf190913770_nodate,
|
||
title = {https://arxiv.org/pdf/1909.13770},
|
||
url = {https://arxiv.org/pdf/1909.13770},
|
||
urldate = {2024-05-21},
|
||
}
|
||
|
||
@incollection{dulek_secure_2020,
|
||
title = {Secure Multi-party Quantum Computation with a Dishonest Majority},
|
||
volume = {12107},
|
||
url = {http://arxiv.org/abs/1909.13770},
|
||
abstract = {The cryptographic task of secure multi-party (classical) computation has received a lot of attention in the last decades. Even in the extreme case where a computation is performed between \$k\$ mutually distrustful players, and security is required even for the single honest player if all other players are colluding adversaries, secure protocols are known. For quantum computation, on the other hand, protocols allowing arbitrary dishonest majority have only been proven for \$k=2\$. In this work, we generalize the approach taken by Dupuis, Nielsen and Salvail ({CRYPTO} 2012) in the two-party setting to devise a secure, efficient protocol for multi-party quantum computation for any number of players \$k\$, and prove security against up to \$k-1\$ colluding adversaries. The quantum round complexity of the protocol for computing a quantum circuit of \${\textbackslash}\{{\textbackslash}mathsf\{{CNOT}, T\}{\textbackslash}\}\$ depth \$d\$ is \$O(k {\textbackslash}cdot (d + {\textbackslash}log n))\$, where \$n\$ is the security parameter. To achieve efficiency, we develop a novel public verification protocol for the Clifford authentication code, and a testing protocol for magic-state inputs, both using classical multi-party computation.},
|
||
pages = {729--758},
|
||
author = {Dulek, Yfke and Grilo, Alex B. and Jeffery, Stacey and Majenz, Christian and Schaffner, Christian},
|
||
urldate = {2024-05-21},
|
||
date = {2020},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-030-45727-3_25},
|
||
eprinttype = {arxiv},
|
||
eprint = {1909.13770 [quant-ph]},
|
||
keywords = {Computer Science - Cryptography and Security, Quantum Physics},
|
||
file = {Dulek et al. - 2020 - Secure Multi-party Quantum Computation with a Dish.pdf:/home/jaseg/Zotero/storage/JYDREMCV/Dulek et al. - 2020 - Secure Multi-party Quantum Computation with a Dish.pdf:application/pdf},
|
||
}
|
||
|
||
@article{mehic_novel_2020,
|
||
title = {A Novel Approach to Quality-of-Service Provisioning in Trusted Relay Quantum Key Distribution Networks},
|
||
volume = {28},
|
||
rights = {https://creativecommons.org/licenses/by/4.0/legalcode},
|
||
issn = {1063-6692, 1558-2566},
|
||
url = {https://ieeexplore.ieee.org/document/8935373/},
|
||
doi = {10.1109/TNET.2019.2956079},
|
||
pages = {168--181},
|
||
number = {1},
|
||
journaltitle = {{IEEE}/{ACM} Transactions on Networking},
|
||
shortjournal = {{IEEE}/{ACM} Trans. Networking},
|
||
author = {Mehic, Miralem and Fazio, Peppino and Rass, Stefan and Maurhart, Oliver and Peev, Momtchil and Poppe, Andreas and Rozhon, Jan and Niemiec, Marcin and Voznak, Miroslav},
|
||
urldate = {2024-05-21},
|
||
date = {2020-02},
|
||
file = {Mehic et al_2020_A Novel Approach to Quality-of-Service Provisioning in Trusted Relay Quantum.pdf:/home/jaseg/Sync/Research/Zotero/Mehic et al_2020_A Novel Approach to Quality-of-Service Provisioning in Trusted Relay Quantum.pdf:application/pdf},
|
||
}
|
||
|
||
@misc{liu_improved_2023,
|
||
title = {Improved Quantum Circuits for {AES}: Reducing the Depth and the Number of Qubits},
|
||
url = {https://eprint.iacr.org/2023/1417},
|
||
author = {Liu, Qun and Preneel, Bart and Zhao, Zheng and Wang, Meiqin},
|
||
date = {2023},
|
||
note = {Published: Cryptology {ePrint} Archive, Paper 2023/1417},
|
||
file = {Liu et al_2023_Improved Quantum Circuits for AES.pdf:/home/jaseg/Sync/Research/Zotero/Liu et al_2023_Improved Quantum Circuits for AES.pdf:application/pdf},
|
||
}
|
||
|
||
@article{azuma_all-photonic_2015,
|
||
title = {All-photonic quantum repeaters},
|
||
volume = {6},
|
||
issn = {2041-1723},
|
||
url = {https://www.nature.com/articles/ncomms7787},
|
||
doi = {10.1038/ncomms7787},
|
||
abstract = {Abstract
|
||
Quantum communication holds promise for unconditionally secure transmission of secret messages and faithful transfer of unknown quantum states. Photons appear to be the medium of choice for quantum communication. Owing to photon losses, robust quantum communication over long lossy channels requires quantum repeaters. It is widely believed that a necessary and highly demanding requirement for quantum repeaters is the existence of matter quantum memories. Here we show that such a requirement is, in fact, unnecessary by introducing the concept of all-photonic quantum repeaters based on flying qubits. In particular, we present a protocol based on photonic cluster-state machine guns and a loss-tolerant measurement equipped with local high-speed active feedforwards. We show that, with such all-photonic quantum repeaters, the communication efficiency scales polynomially with the channel distance. Our result paves a new route towards quantum repeaters with efficient single-photon sources rather than matter quantum memories.},
|
||
pages = {6787},
|
||
number = {1},
|
||
journaltitle = {Nature Communications},
|
||
shortjournal = {Nat Commun},
|
||
author = {Azuma, Koji and Tamaki, Kiyoshi and Lo, Hoi-Kwong},
|
||
urldate = {2024-05-15},
|
||
date = {2015-04-15},
|
||
langid = {english},
|
||
file = {Azuma et al_2015_All-photonic quantum repeaters.pdf:/home/jaseg/Sync/Research/Zotero/Azuma et al_2015_All-photonic quantum repeaters.pdf:application/pdf},
|
||
}
|
||
|
||
@inproceedings{kozlowski_towards_2019,
|
||
location = {Dublin Ireland},
|
||
title = {Towards Large-Scale Quantum Networks},
|
||
isbn = {978-1-4503-6897-1},
|
||
url = {https://dl.acm.org/doi/10.1145/3345312.3345497},
|
||
doi = {10.1145/3345312.3345497},
|
||
eventtitle = {{NANOCOM} '19: The Sixth Annual {ACM} International Conference on Nanoscale Computing and Communication},
|
||
pages = {1--7},
|
||
booktitle = {Proceedings of the Sixth Annual {ACM} International Conference on Nanoscale Computing and Communication},
|
||
publisher = {{ACM}},
|
||
author = {Kozlowski, Wojciech and Wehner, Stephanie},
|
||
urldate = {2024-05-15},
|
||
date = {2019-09-25},
|
||
langid = {english},
|
||
file = {Kozlowski_Wehner_2019_Towards Large-Scale Quantum Networks.pdf:/home/jaseg/Sync/Research/Zotero/Kozlowski_Wehner_2019_Towards Large-Scale Quantum Networks.pdf:application/pdf},
|
||
}
|
||
|
||
@article{dur_towards_2017,
|
||
title = {Towards a quantum internet},
|
||
volume = {38},
|
||
issn = {0143-0807, 1361-6404},
|
||
url = {https://iopscience.iop.org/article/10.1088/1361-6404/aa6df7},
|
||
doi = {10.1088/1361-6404/aa6df7},
|
||
pages = {043001},
|
||
number = {4},
|
||
journaltitle = {European Journal of Physics},
|
||
shortjournal = {Eur. J. Phys.},
|
||
author = {Dür, Wolfgang and Lamprecht, Raphael and Heusler, Stefan},
|
||
urldate = {2024-05-15},
|
||
date = {2017-07-01},
|
||
file = {Dür et al_2017_Towards a quantum internet.pdf:/home/jaseg/Sync/Research/Zotero/Dür et al_2017_Towards a quantum internet.pdf:application/pdf},
|
||
}
|
||
|
||
@article{sasaki_quantum_2017,
|
||
title = {Quantum networks: where should we be heading?},
|
||
volume = {2},
|
||
issn = {2058-9565},
|
||
url = {https://iopscience.iop.org/article/10.1088/2058-9565/aa6994},
|
||
doi = {10.1088/2058-9565/aa6994},
|
||
shorttitle = {Quantum networks},
|
||
pages = {020501},
|
||
number = {2},
|
||
journaltitle = {Quantum Science and Technology},
|
||
shortjournal = {Quantum Sci. Technol.},
|
||
author = {Sasaki, Masahide},
|
||
urldate = {2024-05-15},
|
||
date = {2017-06-01},
|
||
file = {Sasaki_2017_Quantum networks.pdf:/home/jaseg/Sync/Research/Zotero/Sasaki_2017_Quantum networks.pdf:application/pdf},
|
||
}
|
||
|
||
@article{lo_secure_2014,
|
||
title = {Secure quantum key distribution},
|
||
volume = {8},
|
||
issn = {1749-4885, 1749-4893},
|
||
url = {https://www.nature.com/articles/nphoton.2014.149},
|
||
doi = {10.1038/nphoton.2014.149},
|
||
pages = {595--604},
|
||
number = {8},
|
||
journaltitle = {Nature Photonics},
|
||
shortjournal = {Nature Photon},
|
||
author = {Lo, Hoi-Kwong and Curty, Marcos and Tamaki, Kiyoshi},
|
||
urldate = {2024-05-15},
|
||
date = {2014-08},
|
||
langid = {english},
|
||
file = {Lo et al_2014_Secure quantum key distribution.pdf:/home/jaseg/Sync/Research/Zotero/Lo et al_2014_Secure quantum key distribution.pdf:application/pdf},
|
||
}
|
||
|
||
@article{xu_secure_2020,
|
||
title = {Secure quantum key distribution with realistic devices},
|
||
volume = {92},
|
||
issn = {0034-6861, 1539-0756},
|
||
url = {https://link.aps.org/doi/10.1103/RevModPhys.92.025002},
|
||
doi = {10.1103/RevModPhys.92.025002},
|
||
pages = {025002},
|
||
number = {2},
|
||
journaltitle = {Reviews of Modern Physics},
|
||
shortjournal = {Rev. Mod. Phys.},
|
||
author = {Xu, Feihu and Ma, Xiongfeng and Zhang, Qiang and Lo, Hoi-Kwong and Pan, Jian-Wei},
|
||
urldate = {2024-05-15},
|
||
date = {2020-05-26},
|
||
langid = {english},
|
||
file = {Xu et al_2020_Secure quantum key distribution with realistic devices.pdf:/home/jaseg/Sync/Research/Zotero/Xu et al_2020_Secure quantum key distribution with realistic devices.pdf:application/pdf},
|
||
}
|
||
|
||
@article{zhang_large_2018,
|
||
title = {Large scale quantum key distribution: challenges and solutions [Invited]},
|
||
volume = {26},
|
||
issn = {1094-4087},
|
||
url = {https://opg.optica.org/abstract.cfm?URI=oe-26-18-24260},
|
||
doi = {10.1364/OE.26.024260},
|
||
shorttitle = {Large scale quantum key distribution},
|
||
pages = {24260},
|
||
number = {18},
|
||
journaltitle = {Optics Express},
|
||
shortjournal = {Opt. Express},
|
||
author = {Zhang, Qiang and Xu, Feihu and Chen, Yu-Ao and Peng, Cheng-Zhi and Pan, Jian-Wei},
|
||
urldate = {2024-05-15},
|
||
date = {2018-09-03},
|
||
langid = {english},
|
||
file = {Zhang et al_2018_Large scale quantum key distribution.pdf:/home/jaseg/Sync/Research/Zotero/Zhang et al_2018_Large scale quantum key distribution.pdf:application/pdf},
|
||
}
|
||
|
||
@article{cao_evolution_2022,
|
||
title = {The Evolution of Quantum Key Distribution Networks: On the Road to the Qinternet},
|
||
volume = {24},
|
||
rights = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/{IEEE}.html},
|
||
issn = {1553-877X, 2373-745X},
|
||
url = {https://ieeexplore.ieee.org/document/9684555/},
|
||
doi = {10.1109/COMST.2022.3144219},
|
||
shorttitle = {The Evolution of Quantum Key Distribution Networks},
|
||
pages = {839--894},
|
||
number = {2},
|
||
journaltitle = {{IEEE} Communications Surveys \& Tutorials},
|
||
shortjournal = {{IEEE} Commun. Surv. Tutorials},
|
||
author = {Cao, Yuan and Zhao, Yongli and Wang, Qin and Zhang, Jie and Ng, Soon Xin and Hanzo, Lajos},
|
||
urldate = {2024-05-15},
|
||
date = {2022},
|
||
file = {Cao et al_2022_The Evolution of Quantum Key Distribution Networks.pdf:/home/jaseg/Sync/Research/Zotero/Cao et al_2022_The Evolution of Quantum Key Distribution Networks.pdf:application/pdf},
|
||
}
|
||
|
||
@article{pirandola_fundamental_2017,
|
||
title = {Fundamental limits of repeaterless quantum communications},
|
||
volume = {8},
|
||
issn = {2041-1723},
|
||
url = {https://www.nature.com/articles/ncomms15043},
|
||
doi = {10.1038/ncomms15043},
|
||
abstract = {Abstract
|
||
Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that are achievable by two remote parties at the ends of a quantum channel, without restrictions on their local operations and classical communication, which can be unlimited and two-way. These two-way assisted capacities represent the ultimate rates that are reachable without quantum repeaters. Here, by constructing an upper bound based on the relative entropy of entanglement and devising a dimension-independent technique dubbed ‘teleportation stretching’, we establish these capacities for many fundamental channels, namely bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels in arbitrary dimension. In particular, we exactly determine the fundamental rate-loss tradeoff affecting any protocol of quantum key distribution. Our findings set the limits of point-to-point quantum communications and provide precise and general benchmarks for quantum repeaters.},
|
||
pages = {15043},
|
||
number = {1},
|
||
journaltitle = {Nature Communications},
|
||
shortjournal = {Nat Commun},
|
||
author = {Pirandola, Stefano and Laurenza, Riccardo and Ottaviani, Carlo and Banchi, Leonardo},
|
||
urldate = {2024-05-15},
|
||
date = {2017-04-26},
|
||
langid = {english},
|
||
file = {Pirandola et al_2017_Fundamental limits of repeaterless quantum communications.pdf:/home/jaseg/Sync/Research/Zotero/Pirandola et al_2017_Fundamental limits of repeaterless quantum communications.pdf:application/pdf},
|
||
}
|
||
|
||
@article{pirandola_theory_2018,
|
||
title = {Theory of channel simulation and bounds for private communication},
|
||
volume = {3},
|
||
issn = {2058-9565},
|
||
url = {https://iopscience.iop.org/article/10.1088/2058-9565/aac394},
|
||
doi = {10.1088/2058-9565/aac394},
|
||
abstract = {We review recent results on the simulation of quantum channels, the reduction of adaptive protocols (teleportation stretching), and the derivation of converse bounds for quantum and private communication, as established in {PLOB} (Pirandola et al 2017 Nat. Commun. 8 15043). We startby introducing a general weak converse bound for private communication based on the relative entropy of entanglement. We discuss how combining this bound with channel simulation and teleportation stretching, {PLOB} established the two-way quantum and private capacities of several fundamental channels, including the bosonic lossy channel. We then provide a rigorous proof of the strong converse property of these bounds by adopting a correct use of the Braunstein–Kimble teleportation protocol for the simulation of bosonic Gaussian channels. This analysis provides a full justification of claims presented in the follow-up paper {WTB} (Wilde et al 2017 {IEEE} Trans. Inf. Theory 63 1792–817) whose upper bounds for Gaussian channels would be otherwise infinitely large. Besides clarifying contributions in the area of channel simulation and protocol reduction, we also present some generalizations of the tools to other entanglement measures and novel results on the maximum excess noise which is tolerable in quantum key distribution.},
|
||
pages = {035009},
|
||
number = {3},
|
||
journaltitle = {Quantum Science and Technology},
|
||
shortjournal = {Quantum Sci. Technol.},
|
||
author = {Pirandola, Stefano and Braunstein, Samuel L and Laurenza, Riccardo and Ottaviani, Carlo and Cope, Thomas P W and Spedalieri, Gaetana and Banchi, Leonardo},
|
||
urldate = {2024-05-03},
|
||
date = {2018-07},
|
||
langid = {english},
|
||
file = {Pirandola et al. - 2018 - Theory of channel simulation and bounds for privat.pdf:/home/jaseg/Zotero/storage/256F975G/Pirandola et al. - 2018 - Theory of channel simulation and bounds for privat.pdf:application/pdf},
|
||
}
|
||
|
||
@article{laudenbach_continuous-variable_2018-1,
|
||
title = {Continuous-Variable Quantum Key Distribution with Gaussian Modulation -- The Theory of Practical Implementations},
|
||
volume = {1},
|
||
issn = {2511-9044, 2511-9044},
|
||
url = {http://arxiv.org/abs/1703.09278},
|
||
doi = {10.1002/qute.201800011},
|
||
abstract = {Quantum key distribution using weak coherent states and homodyne detection is a promising candidate for practical quantum-cryptographic implementations due to its compatibility with existing telecom equipment and high detection efficiencies. However, despite the actual simplicity of the protocol, the security analysis of this method is rather involved compared to discrete-variable {QKD}. In this article we review the theoretical foundations of continuous-variable quantum key distribution ({CV}-{QKD}) with Gaussian modulation and rederive the essential relations from scratch in a pedagogical way. The aim of this paper is to be as comprehensive and self-contained as possible in order to be well intelligible even for readers with little pre-knowledge on the subject. Although the present article is a theoretical discussion of {CV}-{QKD}, its focus lies on practical implementations, taking into account various kinds of hardware imperfections and suggesting practical methods to perform the security analysis subsequent to the key exchange. Apart from a review of well known results, this manuscript presents a set of new original noise models which are helpful to get an estimate of how well a given set of hardware will perform in practice.},
|
||
pages = {1800011},
|
||
number = {1},
|
||
journaltitle = {Advanced Quantum Technologies},
|
||
shortjournal = {Adv Quantum Tech},
|
||
author = {Laudenbach, Fabian and Pacher, Christoph and Fung, Chi-Hang Fred and Poppe, Andreas and Peev, Momtchil and Schrenk, Bernhard and Hentschel, Michael and Walther, Philip and Hübel, Hannes},
|
||
urldate = {2024-05-02},
|
||
date = {2018-08},
|
||
langid = {english},
|
||
eprinttype = {arxiv},
|
||
eprint = {1703.09278 [quant-ph]},
|
||
keywords = {Quantum Physics},
|
||
file = {Laudenbach et al. - 2018 - Continuous-Variable Quantum Key Distribution with .pdf:/home/jaseg/Zotero/storage/A2BQHUUW/Laudenbach et al. - 2018 - Continuous-Variable Quantum Key Distribution with .pdf:application/pdf},
|
||
}
|
||
|
||
@article{vu_design_2020,
|
||
title = {Design and Performance of Relay-Assisted Satellite Free-Space Optical Quantum Key Distribution Systems},
|
||
volume = {8},
|
||
rights = {https://creativecommons.org/licenses/by/4.0/legalcode},
|
||
issn = {2169-3536},
|
||
url = {https://ieeexplore.ieee.org/document/9133575/},
|
||
doi = {10.1109/ACCESS.2020.3007461},
|
||
abstract = {This paper studies the design and performance analysis of relay-assisted satellite freespace optics ({FSO}) quantum key distribution ({QKD}) systems for secure vehicular networks. High-altitude platforms ({HAPs}) equipped with optical amplify-and-forward nodes are used as relay stations. Secrecy performances in terms of quantum bit error rate and ergodic secret-key rate are analytically investigated under the effects of transceiver misalignment, receiver’s velocity variation, receiver noises, and atmospheric turbulence conditions. Based on the analyzed results, the design criteria for the legitimate user are determined so that the security of the considered system could be guaranteed.},
|
||
pages = {122498--122510},
|
||
journaltitle = {{IEEE} Access},
|
||
shortjournal = {{IEEE} Access},
|
||
author = {Vu, Minh Quang and Pham, Thanh V. and Dang, Ngoc T. and Pham, Anh T.},
|
||
urldate = {2024-05-02},
|
||
date = {2020},
|
||
langid = {english},
|
||
file = {Vu et al. - 2020 - Design and Performance of Relay-Assisted Satellite.pdf:/home/jaseg/Zotero/storage/2HCQ4S6I/Vu et al. - 2020 - Design and Performance of Relay-Assisted Satellite.pdf:application/pdf},
|
||
}
|
||
|
||
@article{tang_measurement-device-independent_2016,
|
||
title = {Measurement-Device-Independent Quantum Key Distribution over Untrustful Metropolitan Network},
|
||
volume = {6},
|
||
rights = {http://creativecommons.org/licenses/by/3.0/},
|
||
issn = {2160-3308},
|
||
url = {https://link.aps.org/doi/10.1103/PhysRevX.6.011024},
|
||
doi = {10.1103/PhysRevX.6.011024},
|
||
pages = {011024},
|
||
number = {1},
|
||
journaltitle = {Physical Review X},
|
||
shortjournal = {Phys. Rev. X},
|
||
author = {Tang, Yan-Lin and Yin, Hua-Lei and Zhao, Qi and Liu, Hui and Sun, Xiang-Xiang and Huang, Ming-Qi and Zhang, Wei-Jun and Chen, Si-Jing and Zhang, Lu and You, Li-Xing and Wang, Zhen and Liu, Yang and Lu, Chao-Yang and Jiang, Xiao and Ma, Xiongfeng and Zhang, Qiang and Chen, Teng-Yun and Pan, Jian-Wei},
|
||
urldate = {2024-05-02},
|
||
date = {2016-03-04},
|
||
langid = {english},
|
||
file = {Tang et al. - 2016 - Measurement-Device-Independent Quantum Key Distrib.pdf:/home/jaseg/Zotero/storage/L3WQWFRM/Tang et al. - 2016 - Measurement-Device-Independent Quantum Key Distrib.pdf:application/pdf},
|
||
}
|
||
|
||
@article{fan_simultaneous_2024,
|
||
title = {A Simultaneous Wireless Power and Coil Inductance Insensitive Data Transfer System for Rotary Structures},
|
||
volume = {39},
|
||
rights = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/{IEEE}.html},
|
||
issn = {0885-8993, 1941-0107},
|
||
url = {https://ieeexplore.ieee.org/document/10440478/},
|
||
doi = {10.1109/TPEL.2024.3367295},
|
||
abstract = {This article proposes a simultaneous wireless power and coil inductance-insensitive data transfer system for rotary structures. Power and data are transferred simultaneously via a pair of coupled coils, adopting frequency division multiplexing technology. The data carrier is injected into and extracted from the power transfer channel by inductors connected serially with the coupled coils and by multiplexing the compensation networks of the power transfer channel. The transfer gain of the data transfer channel is insensitive to the inductances of the coupled coils within a certain interval. {LCLC} compensation topology is proposed to realize constant voltage output and to filter the high-order harmonics out of the power transfer channel, reducing the total harmonic distortion and creating a favorable condition for simultaneous data transfer. The circuit model is built to analyze the power and data transfer performance, and the complex-frequency-domain model of the system is established to analyze the responses of power interference. Finally, the feasibility of the technology proposed is verified by a 300 W prototype with a data rate of 40 kbps.},
|
||
pages = {6526--6536},
|
||
number = {5},
|
||
journaltitle = {{IEEE} Transactions on Power Electronics},
|
||
shortjournal = {{IEEE} Trans. Power Electron.},
|
||
author = {Fan, Yuanshuang and Hu, Hongsheng and Sun, Yue and Hu, Han and Wu, Sihan},
|
||
urldate = {2024-06-21},
|
||
date = {2024-05},
|
||
langid = {english},
|
||
file = {Fan et al. - 2024 - A Simultaneous Wireless Power and Coil Inductance .pdf:/home/jaseg/Zotero/storage/LJIBXD6I/Fan et al. - 2024 - A Simultaneous Wireless Power and Coil Inductance .pdf:application/pdf},
|
||
}
|
||
|
||
@book{golumbia_cultural_2009,
|
||
location = {Cambridge, Mass},
|
||
title = {The cultural logic of computation},
|
||
isbn = {978-0-674-03292-7},
|
||
publisher = {Harvard University Press},
|
||
author = {Golumbia, David},
|
||
date = {2009},
|
||
}
|
||
|
||
@book{bratton_stack_2016,
|
||
title = {The Stack: On Software and Sovereignty},
|
||
isbn = {978-0-262-33018-3},
|
||
url = {https://direct.mit.edu/books/book/3504/The-StackOn-Software-and-Sovereignty},
|
||
shorttitle = {The Stack},
|
||
abstract = {A comprehensive political and design theory of planetary-scale computation proposing that The Stack—an accidental megastructure—is both a technological apparatus and a model for a new geopolitical architecture.
|
||
What has planetary-scale computation done to our geopolitical realities? It takes different forms at different scales—from energy and mineral sourcing and subterranean cloud infrastructure to urban software and massive universal addressing systems; from interfaces drawn by the augmentation of the hand and eye to users identified by self—quantification and the arrival of legions of sensors, algorithms, and robots. Together, how do these distort and deform modern political geographies and produce new territories in their own image?
|
||
In The Stack, Benjamin Bratton proposes that these different genres of computation—smart grids, cloud platforms, mobile apps, smart cities, the Internet of Things, automation—can be seen not as so many species evolving on their own, but as forming a coherent whole: an accidental megastructure called The Stack that is both a computational apparatus and a new governing architecture. We are inside The Stack and it is inside of us.
|
||
In an account that is both theoretical and technical, drawing on political philosophy, architectural theory, and software studies, Bratton explores six layers of The Stack: Earth, Cloud, City, Address, Interface, User. Each is mapped on its own terms and understood as a component within the larger whole built from hard and soft systems intermingling—not only computational forms but also social, human, and physical forces. This model, informed by the logic of the multilayered structure of protocol “stacks,” in which network technologies operate within a modular and vertical order, offers a comprehensive image of our emerging infrastructure and a platform for its ongoing reinvention.
|
||
The Stack is an interdisciplinary design brief for a new geopolitics that works with and for planetary-scale computation. Interweaving the continental, urban, and perceptual scales, it shows how we can better build, dwell within, communicate with, and govern our worlds.
|
||
thestack.org},
|
||
publisher = {The {MIT} Press},
|
||
author = {Bratton, Benjamin H.},
|
||
urldate = {2024-06-21},
|
||
date = {2016-02-19},
|
||
langid = {english},
|
||
doi = {10.7551/mitpress/9780262029575.001.0001},
|
||
}
|
||
|
||
@article{fan_simultaneous_2024-1,
|
||
title = {A Simultaneous Wireless Power and Coil Inductance Insensitive Data Transfer System for Rotary Structures},
|
||
volume = {39},
|
||
rights = {https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/{IEEE}.html},
|
||
issn = {0885-8993, 1941-0107},
|
||
url = {https://ieeexplore.ieee.org/document/10440478/},
|
||
doi = {10.1109/TPEL.2024.3367295},
|
||
abstract = {This article proposes a simultaneous wireless power and coil inductance-insensitive data transfer system for rotary structures. Power and data are transferred simultaneously via a pair of coupled coils, adopting frequency division multiplexing technology. The data carrier is injected into and extracted from the power transfer channel by inductors connected serially with the coupled coils and by multiplexing the compensation networks of the power transfer channel. The transfer gain of the data transfer channel is insensitive to the inductances of the coupled coils within a certain interval. {LCLC} compensation topology is proposed to realize constant voltage output and to filter the high-order harmonics out of the power transfer channel, reducing the total harmonic distortion and creating a favorable condition for simultaneous data transfer. The circuit model is built to analyze the power and data transfer performance, and the complex-frequency-domain model of the system is established to analyze the responses of power interference. Finally, the feasibility of the technology proposed is verified by a 300 W prototype with a data rate of 40 kbps.},
|
||
pages = {6526--6536},
|
||
number = {5},
|
||
journaltitle = {{IEEE} Transactions on Power Electronics},
|
||
shortjournal = {{IEEE} Trans. Power Electron.},
|
||
author = {Fan, Yuanshuang and Hu, Hongsheng and Sun, Yue and Hu, Han and Wu, Sihan},
|
||
urldate = {2024-06-21},
|
||
date = {2024-05},
|
||
langid = {english},
|
||
file = {Fan et al. - 2024 - A Simultaneous Wireless Power and Coil Inductance .pdf:/home/jaseg/Zotero/storage/3VF4XTSU/Fan et al. - 2024 - A Simultaneous Wireless Power and Coil Inductance .pdf:application/pdf},
|
||
}
|
||
|
||
@article{awuah_novel_2023,
|
||
title = {Novel coil design and analysis for high-power wireless power transfer with enhanced Q-factor},
|
||
volume = {13},
|
||
rights = {2023 The Author(s)},
|
||
issn = {2045-2322},
|
||
url = {https://www.nature.com/articles/s41598-023-31389-y},
|
||
doi = {10.1038/s41598-023-31389-y},
|
||
abstract = {The power transfer efficiency ({PTE}) is a crucial aspect for effective wireless power transfer ({WPT}) applications. The quality factor (Q) of the {WPT} coil plays a critical role in ensuring higher {PTE}. In this paper, a novel method of improving the Q of a {WPT} coil is proposed. Resistance reduction techniques are presented which involves variation of the trace pitch, width, and thickness. This approach targets the high {AC} losses centered in the inner turns, which subsequently results in an increased Q. Numerical analysis with respect to the inductance and resistance models are presented, analyzed, and compared to that of the {EM} simulation results. To verify the efficacy of the proposed coil structure, a prototype is fabricated where good agreement is achieved between the measured and simulated results. The proposed coil attained a quality factor increment of about 19.24\% at 85 {kHz} in comparison to the conventional one. The proposed technique can be used to optimize planar spiral coils to attain higher Q.},
|
||
pages = {4187},
|
||
number = {1},
|
||
journaltitle = {Scientific Reports},
|
||
shortjournal = {Sci Rep},
|
||
author = {Awuah, Charles Marfo and Danuor, Patrick and Moon, Jung-Ick and Jung, Young-Bae},
|
||
urldate = {2024-06-21},
|
||
date = {2023-03-14},
|
||
langid = {english},
|
||
note = {Publisher: Nature Publishing Group},
|
||
keywords = {Electrical and electronic engineering, Power stations},
|
||
file = {2023_Awuah et al_Novel coil design and analysis for high-power wireless power transfer with.pdf:/home/jaseg/Sync/Research/Zotero/2023_Awuah et al_Novel coil design and analysis for high-power wireless power transfer with.pdf:application/pdf},
|
||
}
|
||
|
||
@article{mullen_effect_nodate,
|
||
title = {Effect of Misalignment of Inductive Wireless Power Transfer Coils},
|
||
abstract = {As inductive wireless power transfer becomes ubiquitous for charging phones and other portable electronics, consumers are less worried about efficiency and more concerned with high charging rates. For a Soldier in the field, less efficiency means they must carry more batteries or fuel, or forgo wireless charging altogether. To determine changes in wireless power transfer efficiency with respect to inductor misalignment, this research develops the equations used to calculate inductance, mutual inductance, and coupling coefficient depending on inductor geometry and distance. The results show that despite inductive coils that are not well coupled, there are strategies to maintain the same power transfer efficiency as perfectly coupled coils.},
|
||
author = {Mullen, Christopher and Lee, Soobum},
|
||
langid = {english},
|
||
file = {Mullen and Lee - Effect of Misalignment of Inductive Wireless Power.pdf:/home/jaseg/Zotero/storage/7VYCMNA7/Mullen and Lee - Effect of Misalignment of Inductive Wireless Power.pdf:application/pdf},
|
||
}
|
||
|
||
@incollection{hemmo_argument_2020,
|
||
location = {Cham},
|
||
title = {The Argument Against Quantum Computers},
|
||
isbn = {978-3-030-34315-6 978-3-030-34316-3},
|
||
url = {http://link.springer.com/10.1007/978-3-030-34316-3_18},
|
||
pages = {399--422},
|
||
booktitle = {Quantum, Probability, Logic},
|
||
publisher = {Springer International Publishing},
|
||
author = {Kalai, Gil},
|
||
editor = {Hemmo, Meir and Shenker, Orly},
|
||
urldate = {2024-06-25},
|
||
date = {2020},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-030-34316-3_18},
|
||
note = {Series Title: Jerusalem Studies in Philosophy and History of Science},
|
||
file = {Kalai_2020_The Argument Against Quantum Computers.pdf:/home/jaseg/Sync/Research/Zotero/Kalai_2020_The Argument Against Quantum Computers.pdf:application/pdf},
|
||
}
|
||
|
||
@article{pirnay_learning_2022,
|
||
title = {Learning classical readout quantum {PUFs} based on single-qubit gates},
|
||
volume = {4},
|
||
issn = {2524-4914},
|
||
url = {https://doi.org/10.1007/s42484-022-00073-1},
|
||
doi = {10.1007/s42484-022-00073-1},
|
||
abstract = {Physical unclonable functions ({PUFs}) have been proposed as a way to identify and authenticate electronic devices. Recently, several ideas have been presented to that aim to achieve the same for quantum devices. Some of these constructions apply single-qubit gates in order to provide a secure fingerprint of the quantum device. In this work, we formalize the class of classical readout quantum {PUFs} ({CR}-{QPUFs}) using the statistical query ({SQ}) model and explicitly show insufficient security for {CR}-{QPUFs} based on single-qubit rotation gates, when the adversary has {SQ} access to the {CR}-{QPUF}. We demonstrate how a malicious party can learn the {CR}-{QPUF} characteristics and forge the signature of a quantum device through a modelling attack using a simple regression of low-degree polynomials. The proposed modelling attack was successfully implemented in a real-world scenario on real {IBM} Q quantum machines. We thoroughly discuss the prospects and problems of {CR}-{QPUFs} where quantum device imperfections are used as a secure fingerprint.},
|
||
pages = {14},
|
||
number = {2},
|
||
journaltitle = {Quantum Machine Intelligence},
|
||
shortjournal = {Quantum Mach. Intell.},
|
||
author = {Pirnay, Niklas and Pappa, Anna and Seifert, Jean-Pierre},
|
||
urldate = {2024-06-25},
|
||
date = {2022-06-22},
|
||
langid = {english},
|
||
keywords = {Computer security, Machine learning, Modelling attack, Quantum physical unclonable function},
|
||
file = {Pirnay et al_2022_Learning classical readout quantum PUFs based on single-qubit gates.pdf:/home/jaseg/Sync/Research/Zotero/Pirnay et al_2022_Learning classical readout quantum PUFs based on single-qubit gates.pdf:application/pdf},
|
||
}
|
||
|
||
@article{nikolopoulos_remote_2021,
|
||
title = {Remote Quantum-Safe Authentication of Entities with Physical Unclonable Functions},
|
||
volume = {8},
|
||
rights = {http://creativecommons.org/licenses/by/3.0/},
|
||
issn = {2304-6732},
|
||
url = {https://www.mdpi.com/2304-6732/8/7/289},
|
||
doi = {10.3390/photonics8070289},
|
||
abstract = {Physical unclonable functions have been shown to be a useful resource of randomness for implementing various cryptographic tasks including entity authentication. All the related entity authentication protocols that have been discussed in the literature so far, either they are vulnerable to an emulation attack, or they are limited to short distances. Hence, quantum-safe remote entity authentication over large distances remains an open question. In the first part of this work, we discuss the requirements that an entity authentication protocol has to offer, to be useful for remote entity authentication in practice. Subsequently, we propose a protocol, which can operate over large distances, and offers security against both classical and quantum adversaries. The proposed protocol relies on standard techniques, it is fully compatible with the infrastructure of existing and future photonic networks, and it can operate in parallel with other quantum protocols, including {QKD} protocols.},
|
||
pages = {289},
|
||
number = {7},
|
||
journaltitle = {Photonics},
|
||
author = {Nikolopoulos, Georgios M.},
|
||
urldate = {2024-06-25},
|
||
date = {2021-07},
|
||
langid = {english},
|
||
note = {Number: 7
|
||
Publisher: Multidisciplinary Digital Publishing Institute},
|
||
keywords = {entity authentication, physical unclonable functions, quantum cryptography},
|
||
file = {Nikolopoulos_2021_Remote Quantum-Safe Authentication of Entities with Physical Unclonable.pdf:/home/jaseg/Sync/Research/Zotero/Nikolopoulos_2021_Remote Quantum-Safe Authentication of Entities with Physical Unclonable.pdf:application/pdf},
|
||
}
|
||
|
||
@article{nikolopoulos_optical_2019,
|
||
title = {Optical scheme for cryptographic commitments with physical unclonable keys},
|
||
volume = {27},
|
||
issn = {1094-4087},
|
||
url = {http://arxiv.org/abs/1909.13094},
|
||
doi = {10.1364/OE.27.029367},
|
||
abstract = {We investigate the possibility of using multiple-scattering optical media, as resources of randomness in cryptographic tasks pertaining to commitments and auctions. The proposed commitment protocol exploits standard wavefront-shaping and heterodyne-detection techniques, and can be implemented with current technology. Its security is discussed in the framework of a tamper-resistant trusted setup.},
|
||
pages = {29367},
|
||
number = {20},
|
||
journaltitle = {Optics Express},
|
||
shortjournal = {Opt. Express},
|
||
author = {Nikolopoulos, Georgios M.},
|
||
urldate = {2024-06-25},
|
||
date = {2019-09-30},
|
||
langid = {english},
|
||
eprinttype = {arxiv},
|
||
eprint = {1909.13094 [physics, physics:quant-ph]},
|
||
keywords = {Computer Science - Cryptography and Security, Quantum Physics, Physics - Applied Physics, Physics - Optics},
|
||
file = {Nikolopoulos - 2019 - Optical scheme for cryptographic commitments with .pdf:/home/jaseg/Zotero/storage/8PAEDSEQ/Nikolopoulos - 2019 - Optical scheme for cryptographic commitments with .pdf:application/pdf},
|
||
}
|
||
|
||
@report{smith_towards_nodate,
|
||
title = {Towards robust inexact geometric computation},
|
||
url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-766.html},
|
||
abstract = {Geometric algorithms implemented using rounded arithmetic are prone to robustness problems. Geometric algorithms are often a mix of arithmetic and combinatorial computations, arising from the need to create geometric data structures that are themselves a complex mix of numerical and combinatorial data. Decisions that influence the topology of a geometric structure are made on the basis of certain arithmetic calculations, but the inexactness of these calculations may lead to inconsistent decisions, causing the algorithm to produce a topologically invalid result or to fail catastrophically. The research reported here investigates ways to produce robust algorithms with inexact computation.
|
||
|
||
I present two algorithms for operations on piecewise linear (polygonal/polyhedral) shapes. Both algorithms are topologically robust, meaning that they are guaranteed to generate a topologically valid result from a topologically valid input, irrespective of numerical errors in the computations. The first algorithm performs the Boolean operation in 3D, and also in 2D. The main part of this algorithm is a series of interdependent operations. The relationship between these operations ensures a consistency in these operations, which, I prove, guarantees the generation of a shape representation with valid topology. The basic algorithm may generate geometric artifacts such as gaps and slivers, which generally can be removed by a data-smoothing post-process. The second algorithm presented performs simplification in 2D, converting a geometrically invalid (but topologically valid) shape representation into one that is fully valid. This algorithm is based on a variant of the Bentley-Ottmann sweep line algorithm, but with additional rules to handle situations not possible under an exact implementation.
|
||
|
||
Both algorithms are presented in the context of what is required of an algorithm in order for it to be classed as robust in some sense. I explain why the formulaic approach used for the Boolean algorithm cannot readily be used for the simplification process. I also give essential code details for a C++ implementation of the 2D simplification algorithm, and discuss the results of extreme tests designed to show up any problems. Finally, I discuss floating-point arithmetic, present error analysis for the floating-point computation of the intersection point between two segments in 2D, and discuss how such errors affect both the simplification algorithm and the basic Boolean algorithm in 2D.},
|
||
pages = {186 pages},
|
||
institution = {Computer Laboratory, University of Cambridge},
|
||
author = {Smith, Julian M.},
|
||
urldate = {2024-06-26},
|
||
doi = {10.48456/TR-766},
|
||
note = {Artwork Size: 186 pages
|
||
Medium: {PDF}},
|
||
}
|
||
|
||
@misc{dorsey_high-speed_2010,
|
||
title = {High-Speed Data Transmission and Rotary Platforms: Slip Rings, Fiber Optic Rotary Joints, and Multiplexers},
|
||
url = {https://www.globalspec.com/MoogComponents/REF/Note_204_HSDataTrans_RotaryPlatRev1.pdf},
|
||
publisher = {Moog, Inc.},
|
||
author = {Dorsey, Glenn},
|
||
urldate = {2024-06-26},
|
||
date = {2010},
|
||
}
|
||
|
||
@online{noauthor_httpswwweuro-ixnetmediafiler_public1f741f7457be-afd8-471b-b333-2cb7958f9d0bdemystify_quantum_key_distribution_euro-ixpdf_nodate,
|
||
title = {https://www.euro-ix.net/media/filer\_public/1f/74/1f7457be-afd8-471b-b333-2cb7958f9d0b/demystify\_quantum\_key\_distribution\_euro-ix.pdf},
|
||
url = {https://www.euro-ix.net/media/filer_public/1f/74/1f7457be-afd8-471b-b333-2cb7958f9d0b/demystify_quantum_key_distribution_euro-ix.pdf},
|
||
urldate = {2024-06-28},
|
||
}
|
||
|
||
@article{kiselev_analysis_2020,
|
||
title = {Analysis of the chromatic dispersion effect on the subcarrier wave {QKD} system},
|
||
volume = {28},
|
||
rights = {© 2020 Optical Society of America},
|
||
issn = {1094-4087},
|
||
url = {https://opg.optica.org/oe/abstract.cfm?uri=oe-28-19-28696},
|
||
doi = {10.1364/OE.403293},
|
||
abstract = {In this paper we investigate the chromatic dispersion impact on the quantum key distribution system based on multi-mode weak coherent phase-coded states. We provide an asymptotic secure key rate estimation, taking into account error detection probability due to chromatic dispersion. We demonstrate numerically and experimentally that the effect of chromatic dispersion in an optical fiber without any compensation hinders the secret key distribution at a distance more than 53 km. Finally, we propose a modification to the considered quantum communication system in order to mitigate the influence of chromatic dispersion on its performance.},
|
||
pages = {28696--28712},
|
||
number = {19},
|
||
journaltitle = {Optics Express},
|
||
shortjournal = {Opt. Express, {OE}},
|
||
author = {Kiselev, F. and Samsonov, E. and Goncharov, R. and Chistyakov, V. and Halturinsky, A. and Egorov, V. and Kozubov, A. and Gaidash, A. and Gleim, A.},
|
||
urldate = {2024-06-28},
|
||
date = {2020-09-14},
|
||
note = {Publisher: Optica Publishing Group},
|
||
keywords = {Fiber Bragg gratings, Fiber losses, Phase matching, Quantum communications, Quantum key distribution, Raman scattering},
|
||
file = {Kiselev et al_2020_Analysis of the chromatic dispersion effect on the subcarrier wave QKD system.pdf:/home/jaseg/Sync/Research/Zotero/Kiselev et al_2020_Analysis of the chromatic dispersion effect on the subcarrier wave QKD system.pdf:application/pdf},
|
||
}
|
||
|
||
@article{berrios_high_2012,
|
||
title = {High Fidelity Quantum Gates with Vibrational Qubits},
|
||
volume = {116},
|
||
issn = {1089-5639, 1520-5215},
|
||
url = {https://pubs.acs.org/doi/10.1021/jp3055729},
|
||
doi = {10.1021/jp3055729},
|
||
pages = {11347--11354},
|
||
number = {46},
|
||
journaltitle = {The Journal of Physical Chemistry A},
|
||
shortjournal = {J. Phys. Chem. A},
|
||
author = {Berrios, Eduardo and Gruebele, Martin and Shyshlov, Dmytro and Wang, Lei and Babikov, Dmitri},
|
||
urldate = {2024-06-27},
|
||
date = {2012-11-26},
|
||
langid = {english},
|
||
}
|
||
|
||
@incollection{hazay_efficient_2023,
|
||
location = {Cham},
|
||
title = {An Efficient Key Recovery Attack on {SIDH}},
|
||
volume = {14008},
|
||
isbn = {978-3-031-30588-7 978-3-031-30589-4},
|
||
url = {https://link.springer.com/10.1007/978-3-031-30589-4_15},
|
||
abstract = {We present an efficient key recovery attack on the Supersingular Isogeny Diffie–Hellman protocol ({SIDH}). The attack is based on Kani’s “reducibility criterion” for isogenies from products of elliptic curves and strongly relies on the torsion point images that Alice and Bob exchange during the protocol. If we assume knowledge of the endomorphism ring of the starting curve then the classical running time is polynomial in the input size (heuristically), apart from the factorization of a small number of integers that only depend on the system parameters. The attack is particularly fast and easy to implement if one of the parties uses 2-isogenies and the starting curve comes equipped with a non-scalar endomorphism of very small degree; this is the case for {SIKE}, the instantiation of {SIDH} that recently advanced to the fourth round of {NIST}’s standardization effort for post-quantum cryptography. Our Magma implementation breaks {SIKEp}434, which aims at security level 1, in about ten minutes on a single core.},
|
||
pages = {423--447},
|
||
booktitle = {Advances in Cryptology – {EUROCRYPT} 2023},
|
||
publisher = {Springer Nature Switzerland},
|
||
author = {Castryck, Wouter and Decru, Thomas},
|
||
editor = {Hazay, Carmit and Stam, Martijn},
|
||
urldate = {2024-06-27},
|
||
date = {2023},
|
||
langid = {english},
|
||
doi = {10.1007/978-3-031-30589-4_15},
|
||
note = {Series Title: Lecture Notes in Computer Science},
|
||
file = {Castryck and Decru - 2023 - An Efficient Key Recovery Attack on SIDH.pdf:/home/jaseg/Zotero/storage/LZU2NVHW/Castryck and Decru - 2023 - An Efficient Key Recovery Attack on SIDH.pdf:application/pdf},
|
||
}
|
||
|
||
@online{schmieg_blog_2024,
|
||
title = {Blog: Google's Threat model for Post-Quantum Cryptography},
|
||
url = {https://bughunters.google.com/blog/5108747984306176/google-s-threat-model-for-post-quantum-cryptography},
|
||
shorttitle = {Blog},
|
||
abstract = {Read on to understand how Google currently evaluates the threat landscape related to post-quantum cryptography, and what implications this has for migrating from classical cryptographic algorithms to {PQC}.},
|
||
titleaddon = {Google's Threat model for Post-Quantum Cryptography},
|
||
type = {Blog},
|
||
author = {Schmieg, Sophie and Kölbl, Stefan and Endignoux, Guillaume},
|
||
urldate = {2024-06-27},
|
||
date = {2024-03-11},
|
||
langid = {american},
|
||
note = {Archive: https://web.archive.org/web/20240520194944/https://bughunters.google.com/blog/5108747984306176/google-s-threat-model-for-post-quantum-cryptography},
|
||
file = {Snapshot:/home/jaseg/Zotero/storage/CPBIT3L7/google-s-threat-model-for-post-quantum-cryptography.html:text/html},
|
||
}
|