Filters








13,372 Hits in 8.7 sec

Classical cryptographic protocols in a quantum world

Sean Hallgren, Adam Smith, Fang Song
2015 International Journal of Quantum Information  
Our result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world.  ...  Our main contribution is showing the existence of classical two-party protocols for the secure evaluation of any polynomial-time function under reasonable computational assumptions (for example, it suffices  ...  Our result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world.  ... 
doi:10.1142/s0219749915500288 fatcat:snylg7x6svdnfaklwglowqz5zq

Classical Cryptographic Protocols in a Quantum World [chapter]

Sean Hallgren, Adam Smith, Fang Song
2011 Lecture Notes in Computer Science  
In the computational realm, rewinding is a key technique for reducing the security of a protocol to the hardness of some underlying problem.  ...  More subtly, the basic techniques used to reason about security may not apply in a quantum setting.  ...  Our result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world.  ... 
doi:10.1007/978-3-642-22792-9_23 fatcat:tyze2edatvbupkeoxv5ubsflem

Constant-round Multi-party Quantum Computation for Constant Parties [article]

Zhu Cao
2020 arXiv   pre-print
The extension to the quantum regime was proposed in 2002, but despite two decades of research, the current state-of-the-art multi-party quantum computation protocol for a fixed number of parties (even  ...  Our work constitutes a key step towards practical implementation of secure multi-party quantum computation, and opens the door for practitioners to be involved in this exciting field.  ...  This is in stark contrast with Yao's original secure two-party computation protocol, where only a constant number of rounds is needed.  ... 
arXiv:2011.12061v1 fatcat:g2jczxv2efbq7ifbr5jkko6dia

Secure Two-Party Quantum Computation Over Classical Channels [article]

Michele Ciampi, Alexandru Cojocaru, Elham Kashefi, Atul Mantri
2021 arXiv   pre-print
Secure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output.  ...  In this work, we consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel.  ...  EK acknowledges support from the EPSRC Verification of Quantum Technology grant (EP/N003829/1), the EPSRC Hub in Quantum Computing and Simulation (EP/T001062/1), grant FA9550-17-1-0055 and the UK Quantum  ... 
arXiv:2010.07925v2 fatcat:soqrc74rengldect2hr7gfuxey

Merkle Puzzles in a Quantum World [chapter]

Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail
2011 Lecture Notes in Computer Science  
The first unclassified document ever written to solve the key establishment problem and propose the notion of public key cryptography was a project proposal in a course on computer security written by  ...  Ralph Merkle in 1974 [13] .  ...  Two questions were left open in Ref. [8] : 1. Can the quadratic security of Merkle's scheme be restored if all parties make use of quantum powers? 2.  ... 
doi:10.1007/978-3-642-22792-9_22 fatcat:hwdubj7bgvcwvbdlqrkhsgf7ri

Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Bruno Costa, Pedro Branco, Manuel Goulão, Mariano Lemus, Paulo Mateus
2021 Entropy  
We then prove their security in the quantum universal composability framework, in a common reference string model.  ...  The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation.  ...  Let G pk be a quantum robust PRNG. π COM then (computationally) quantum UCemulates F COM in the CRS model. Proof. We start by briefly describing the UC security proof of π COM by Canneti in [33] .  ... 
doi:10.3390/e23081001 fatcat:kxm5vfzaarbz3kcudtg6jnyriu

Why classical certification is impossible in a quantum world

Adrian Kent
2011 Quantum Information Processing  
transfer, and secure classical multi-party computations of secret classical data.  ...  The argument illuminates the impossibility of unconditionally secure quantum implementations of essentially classical tasks such as bit commitment with a certified classical committed bit, classical oblivious  ...  In general, the parties input bits into their own quantum computers, which process the quantum data, along with data received earlier in the protocol, before sending appropriate subsets to another party  ... 
doi:10.1007/s11128-011-0262-x fatcat:e656m3y6pne67hc4tc7ods3xjm

Two-Round Concurrently Secure Two-Party Computation [article]

Behzad Abdolmaleki, Giulio Malavolta, Ahmadreza Rahimi
2021 IACR Cryptology ePrint Archive  
In the plain model, it is well known that concurrently secure two-party computation with polynomial simulation is impossible to achieve in two rounds.  ...  concurrent blind signature in the plain model, and two round concurrent computation for quantum circuits (2PQC).  ...  achieve a two-round concurrently secure two-party computation in the plain model?  ... 
dblp:journals/iacr/AbdolmalekiMR21 fatcat:64n25b3uifb63loqzdcfqiam7y

Making an Empty Promise with a Quantum Computer [chapter]

H. F. Chau, Hoi-Kwong Lo
2004 Quantum Computing  
In conclusion, quantum one-sided two-party secure computations are, in principle, insecure. 6 Even though quantum bit commitment and quantum two-party secure computations are insecure in theory, they  ...  After the fall of quantum bit commitment, the security of other quantum two-party protocols, in particular, the so-called two-party secure computations also came into question.  ... 
doi:10.1002/3527603093.ch11 fatcat:25dg4xeum5hf5ggiqhjlmbspry

On the Security of Password-Authenticated Quantum Key Exchange [article]

Céline Chevalier, Marc Kaplan, Quoc Huy Vu
2019 arXiv   pre-print
We then answer this open question positively by presenting a construction for quantum PAKE that provably achieves everlasting security in the simulation-based model.  ...  Motivated by the Quantum Key Distribution (QKD) protocol, introduced in 1984 in the seminal paper of Bennett and Brassard, we investigate in this paper the achievability of unconditionally secure password-authenticated  ...  Let F as above and let Π be a two-party quantum protocol for computing F.  ... 
arXiv:1904.01526v2 fatcat:w2vwzupckjg3zjaqdlyajuhuvy

Quantum Technology and the Medical Librarian

Jason Bengtson
2015 Journal of Hospital Librarianship  
Modern digital computers manipulate data built upon bits, which are the smallest unit of digital information. A bit can exist in two and only two possible states; zero or one.  ...  The key to this technology lies in the way information operates on the quantum level; a fact that opens the door for something called quantum computing. What is Quantum Computing?  ... 
doi:10.1080/15323269.2015.1049090 fatcat:46md66uksfejbptvmvk6u5hcn4

Efficient Implementation of Password-Based Authenticated Key Exchange from RLWE and Post-Quantum TLS [article]

Xinwei Gao, Jintai Ding, Lin Li, Saraswathy RV, Jiqiang Liu
2017 IACR Cryptology ePrint Archive  
Compare with quantum-vulnerable J-PAKE protocol, we achieve nearly 8x speedup. We also integrate RLWE-PPK into TLS to construct a post-quantum TLS ciphersuite.  ...  Two post-quantum password-based authenticated key exchange (PAKE) protocols were proposed at CT-RSA 2017.  ...  In record protocol, two parties transmit encrypted and authenticated data securely.  ... 
dblp:journals/iacr/GaoDLRL17 fatcat:6mlhpycnwfcutpy5z2qrmvpst4

Feasibility and Completeness of Cryptographic Tasks in the Quantum World [chapter]

Serge Fehr, Jonathan Katz, Fang Song, Hong-Sheng Zhou, Vassilis Zikas
2013 Lecture Notes in Computer Science  
With respect to computational security, we show that existing feasibility results carry over unchanged from the classical to the quantum world; a functionality is "trivial" (i.e., can be realized without  ...  setup) in the quantum world if and only if it is trivial in the classical world.  ...  While several impossibility results for statistically secure two-party computation in the quantum setting are known [May97, LC97, Lo97, SSS09, BCS12] , these results say nothing about the computational  ... 
doi:10.1007/978-3-642-36594-2_16 fatcat:iycjx6b5lzabzhgukkdpepxvxq

MLC No-go Theorems: Reinterpretation and Extension [article]

Minh-Dung Dang, Patrick Bellot
2008 arXiv   pre-print
In this article, we are interested in the physical model of general quantum protocols implementing secure two-party computations in the light of Mayers' and Lo's & Chau's no-go theorems of bit commitment  ...  The extension implies that a quantum protocol for implementing secure two-party computations musts have access to a trusted third-party which erases information and thus makes dissipation of heat to the  ...  However, while quantum key distribution had been proved to be secure 9,10 , two no-go theorems were issued: quantum bit commitment is impossible 11, 12 ; quantum secure two-party computations and so  ... 
arXiv:quant-ph/0701156v5 fatcat:knqv5677zzg4lonjgrgvrbdlum

Secure two-party quantum computation for non-rational and rational settings [article]

Arpita Maitra, Goutam Paul, Asim K. Pal
2016 arXiv   pre-print
Since the negative result of Lo (Physical Review A, 1997), it has been left open whether there exist some functions that can be securely computed in two-party setting in quantum domain when one of the  ...  In this paper, we for the first time, show that there are some functions for which secure two-party quantum computation is indeed possible for non-simultaneous channel model.  ...  INTRODUCTION In a secure two-party computation, two parties or players want to compute a particular function of their inputs keeping the inputs secret from each other.  ... 
arXiv:1504.01974v5 fatcat:drxq4nlv7nf2njgmzka6zcvhca
« Previous Showing results 1 — 15 out of 13,372 results