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

Secure Protocol Transformations

Yuval Ishai, Eyal Kushilevitz Z, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu

Published Jan 1, 2016• 29 citations
Publisher
DOI
10.1007/978-3-662-53008-5_15

Related papers

Converters for Designing Applied Cryptographic Protocols

Zhao Huawei, Jing Qin, Fang Zhifeng

Two modularized, non-interactive converters are proposed to design applied cryptographic protocols. The converters are based on the refined scheme given by Wenbo Mao, and can transform protocols secure in the ideal model into those secure in the real model. Because the converters are modularized, once proved secure, they can be widely reused in many protocols. And in contrast to BCK-authenticator, the converters have the following advantages: 1, Because of the character of non-interactivity, the transformed protocols outputted by the converters have higher performance than those protocols outputted by BCK-authenticator. 2, The converters can transform some symmetric-key protocols that can not be transformed by BCK-authenticator. 3, The converters have algorithms, which can help to realize automatic transformation.

IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)•Dec 1, 2008•0 citations

Synthesizing Secure Protocols

Véronique Cortier, Bogdan Warinschi, Eugen Zălinescu

Lecture notes in computer science•Jan 1, 2007•17 citations

Secure protocols and their applications

P.M.T.B Sandirigama

•Jan 1, 2001•0 citations

A Novel Quantum Covert Channel Protocol Based on Any Quantum Secure Direct Communication Scheme

Shujiang Xu, Xiu‐Bo Chen, Xinxin Niu +1 more

By analyzing the basic properties of unitary transformations used in a quantum secure direct communication (QSDC) protocol, we show the main idea why a covert channel can be established within any QSDC channel which employs unitary transformations to encode information. On the basis of the fact that the unitary transformations used in a QSDC protocol are secret and independent, a novel quantum covert channel protocol is proposed to transfer secret messages with unconditional security. The performance, including the imperceptibility, capacity and security of the proposed protocol are analyzed in detail.

Communications in Theoretical Physics•May 1, 2013•10 citations

Communication preserving protocols for secure function evaluation

Moni Naor, Kobbi Nissim B

A secure function evaluation protocol allows two parties to jointly compute a function f(x; y) of their inputs in a manner not leaking more information than necessary. A major result in this field is: "any function f that can be computed using polynomial resources can be computed securely using polynomial resources" (where `resources' refers to communication and computation). This result follows by a general transformation from any circuit for f to a secure protocol that evaluates f . Although the resources used by protocols resulting from this transformation are polynomial in the circuit size, they are much higher (in general) than those required for an insecure computation of f . We propose a new methodology for designing secure protocols, utilizing the communication complexity tree (or branching program) representation of f . We start with an efficient (insecure) protocol for f and transform it into a secure protocol. In other words, "any function f that can be computed using communication complexity c can be can be computed securely using communication complexity that is polynomial in c and a security parameter". We show several simple applications of this new methodology resulting in protocols efficient either in communication or in computation. In particular, we exemplify a protocol for the "millionaires problem ", where two participants want to compare their values but reveal no other information. Our protocol is more efficient than previously known ones in either communication or computation. 1.

ACM Symposium on Theory of Computing (STOC)•Jul 6, 2001•165 citations

Cryptographic Protocols

Hans Delfs, Helmut Knebl

Information security and cryptography•Jan 1, 2015•3 citations
Two modularized, non-interactive converters are proposed to design applied cryptographic protocols. The converters are based on the refined scheme given by Wenbo Mao, and can transform protocols secure in the ideal model into those secure in the real model. Because the converters are modularized, once proved secure, they can be widely reused in many protocols. And in contrast to BCK-authenticator, the converters have the following advantages: 1, Because of the character of non-interactivity, the transformed protocols outputted by the converters have higher performance than those protocols outputted by BCK-authenticator. 2, The converters can transform some symmetric-key protocols that can not be transformed by BCK-authenticator. 3, The converters have algorithms, which can help to realize automatic transformation.
By analyzing the basic properties of unitary transformations used in a quantum secure direct communication (QSDC) protocol, we show the main idea why a covert channel can be established within any QSDC channel which employs unitary transformations to encode information. On the basis of the fact that the unitary transformations used in a QSDC protocol are secret and independent, a novel quantum covert channel protocol is proposed to transfer secret messages with unconditional security. The performance, including the imperceptibility, capacity and security of the proposed protocol are analyzed in detail.
A secure function evaluation protocol allows two parties to jointly compute a function f(x; y) of their inputs in a manner not leaking more information than necessary. A major result in this field is: "any function f that can be computed using polynomial resources can be computed securely using polynomial resources" (where `resources' refers to communication and computation). This result follows by a general transformation from any circuit for f to a secure protocol that evaluates f . Although the resources used by protocols resulting from this transformation are polynomial in the circuit size, they are much higher (in general) than those required for an insecure computation of f . We propose a new methodology for designing secure protocols, utilizing the communication complexity tree (or branching program) representation of f . We start with an efficient (insecure) protocol for f and transform it into a secure protocol. In other words, "any function f that can be computed using communication complexity c can be can be computed securely using communication complexity that is polynomial in c and a security parameter". We show several simple applications of this new methodology resulting in protocols efficient either in communication or in computation. In particular, we exemplify a protocol for the "millionaires problem ", where two participants want to compare their values but reveal no other information. Our protocol is more efficient than previously known ones in either communication or computation. 1.