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

Some active attacks on fast server-aided secret computation protocols for modular exponentiation

Shin‐Jia Hwang, Chin‐Chen Chang, Wei‐Pang Yang

Published Jan 1, 1996• 4 citations
Publisher
DOI
10.1007/bfb0032360

Related papers

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

Secure Addition Sequence and Its Application on the Server Aided Secret Computation Protocols

Chi‐Sung Laih

International Cryptology Conference•Jan 1, 1993•2 citations

Secure Addition Sequence and Its Application on the Server-Aided Secret Computation Protocols (Special Section on Cryptography and Information Security)

Chi‐Sung Laih, Sung‐Ming Yen

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 25, 1994•0 citations

Adaptive Universal Composability Framework for Server-Aided Threshold Signature

Xuan Hong, Luqun Li

The threshold signature scheme is a protocol that allows any subset of t parties out of n to generate a signature. Since the t members can cooperate together to compute the secret key, we introduce the server-aided threshold signature, which provides controllability for activating the signing function in a certain enhanced way. In this study, we present a server-aided threshold RSA signature protocol against the adaptive attacks. We give the universally composable secure model for the server-aided threshold signature primitive and prove that the proposed protocol is claimed to be well-formed, correct and unforgeability. As a separate contribution we also prove that it is also secure in the adaptive universal composability framework. After the discussion about the security and the performance, we claim that the protocol is practical and efficient.

Research Journal of Applied Sciences Engineering and Technology•Jan 1, 2013•0 citations

Security Analysis of Server-Aided Public Key Generation Protocols on Low-Power Devices for Ad-Hoc Networks

Tianjie Cao, Xianping Mao, Qihan Luo +1 more

In ITST2006, Chen et al. presented two server-aided public key generation protocols for low-power devices and claimed that their protocols secure against collusion attack. In this paper, we point that if the servers collude with each other, those servers could obtain low-power devices' secret information, and they can get the plaintext from any ciphertext. We also present an improved server-aided standard RSA key generation protocol against the collusion attack.

International Colloquium on Computing, Communication, Control, and Management•Jan 1, 2008•3 citations

Practically Efficient Secure Distributed Exponentiation Without Bit-Decomposition

Abdelrahaman Aly, Aysajan Abidin, Svetla Nikova⋆

Lecture notes in computer science•Jan 1, 2018•6 citations
The threshold signature scheme is a protocol that allows any subset of t parties out of n to generate a signature. Since the t members can cooperate together to compute the secret key, we introduce the server-aided threshold signature, which provides controllability for activating the signing function in a certain enhanced way. In this study, we present a server-aided threshold RSA signature protocol against the adaptive attacks. We give the universally composable secure model for the server-aided threshold signature primitive and prove that the proposed protocol is claimed to be well-formed, correct and unforgeability. As a separate contribution we also prove that it is also secure in the adaptive universal composability framework. After the discussion about the security and the performance, we claim that the protocol is practical and efficient.