Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On Single-Server Delegation of RSA

Giovanni Di Crescenzo, Matluba Khodjaeva, Ta Chen, Rajesh Krishnan, David H. Shur, Delaram Kahrobaei, Vladimir Shpilrain

Published Jan 1, 2023• 1 citation
Publisher
DOI
10.1007/978-3-031-32636-3_5

Related papers

Efficient and Secure Delegation of Group Exponentiation to a Single Server

Bren Cavallo, Giovanni Di Crescenzo, Delaram Kahrobaei +1 more

Lecture notes in computer science•Jan 1, 2015•31 citations

Security Analysis of a Server-Aided RSA Key Generation Protocol

Tianjie Cao, Xianping Mao, Dongdai Lin

Lecture notes in computer science•Jan 1, 2006•9 citations

Performance Analysis of Server-Aided Secret Computation Protocols for the RSA Cryptosystem

Shinichi Kawamura, Atsushi Shimbo

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jul 25, 1990•12 citations

Impossibility of blind quantum sampling for classical client

Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuch +1 more

Blind quantum computing enables a client, who can only generate or measure single-qubit states, to delegate quantum computing to a remote quantum server in such a way that the input, output, and program are hidden from the server. It is an open problem whether a completely classical client can delegate quantum computing blindly (in the information theoretic sense). In this paper, we show that if a completely classical client can blindly delegate sampling of subuniversal models, such as the DQC1 model and the IQP model, then the polynomial-time hierarchy collapses to the third level. Our delegation protocol is the one where the client first sends a polynomial-length bit string to the server and then the server returns a single bit to the client. Generalizing the no-go result to more general setups is an open problem.

arXiv:1812.03703•Quantum Information and Computation•Sep 1, 2019•7 citations

Breaking RSA encryption

N. David Mermin

Cambridge University Press eBooks•Aug 30, 2007•0 citations

Factorizing RSA Keys

Ed Blakey

Proceedings in information and communications technology•Dec 17, 2008•2 citations
Blind quantum computing enables a client, who can only generate or measure single-qubit states, to delegate quantum computing to a remote quantum server in such a way that the input, output, and program are hidden from the server. It is an open problem whether a completely classical client can delegate quantum computing blindly (in the information theoretic sense). In this paper, we show that if a completely classical client can blindly delegate sampling of subuniversal models, such as the DQC1 model and the IQP model, then the polynomial-time hierarchy collapses to the third level. Our delegation protocol is the one where the client first sends a polynomial-length bit string to the server and then the server returns a single bit to the client. Generalizing the no-go result to more general setups is an open problem.