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

International Cryptology Conference

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

Chi‐Sung Laih

Published Jan 1, 1993• 2 citations
OpenAlex

Related papers

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

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

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

Introduction to Secure Computation

Ronald Cramer

Lecture notes in computer science•Jan 1, 1999•62 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

Approaches to Efficient and Robust Cryptographic Protocols

Bartosz Przydatek

•Jan 1, 2007•0 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.