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

Text Search Protocols with Simulation Based Security

Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen

Published Jan 1, 2010• 59 citations
Publisher
DOI
10.1007/978-3-642-13013-7_20

Related papers

Automata Evaluation and Text Search Protocols with Simulation-Based Security

Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen

Journal of Cryptology•Feb 11, 2015•6 citations

Proposed Quantum Text Teleportation Protocol (QTTP) for Secure Text Transfer by using Quantum Teleportation and Huffman Coding

Mekala Karthik, Jitesh Lalwani, Babita Jajodia

In this work, the authors present Quantum Text Teleportation Protocol (QTTP) that uses Quantum Teleportation (QT) technique and Huffman Coding for secure text transfers. The QTTP enables the teleportation of quantum states of text (for example, email) in a secure manner, while simultaneously encrypting and decrypting them using Huffman Coding since data can only be retrieved or decoded if the prefix codes are known. The Huffman Coding approach offers the benefit of compressing the entire text, resulting in faster transmission of large amounts of information. For proof of concept, the authors experimentally evaluated both of the proposed QTTPs (Standard QTTP and QTTP with Huffman Coding) using Quantum Information Science Kit (QISKit), a quantum computing platform and simulated on IBM QASM Simulator and on IBM real quantum hardware.

•Apr 9, 2022•2 citations

Analysis of randomized security protocols

Matthew S. Bauer

•Nov 30, 2018•1 citation

Quantum Text Teleportation Protocol for Secure Text Transfer by using Quantum Teleportation and Huffman Coding

Mekala Karthik, Jitesh Lalwani, Babita Jajodia

In this work, the authors present Quantum Text Teleportation Protocol (QTTP) that uses Quantum Teleportation (QT) technique and Huffman Coding for secure text transfers. The QTTP enables the teleportation of quantum states of text (for example, email) in a secure manner, while simultaneously encrypting and decrypting them using Huffman Coding since data can only be retrieved or decoded if the prefix codes are known. The Huffman Coding approach offers the benefit of compressing the entire text, resulting in faster transmission of large amounts of information. For proof of concept, the authors experimentally evaluated both of the proposed QTTPs (Standard QTTP and QTTP with Huffman Coding) using Quantum Information Science Kit (Qiskit), a quantum computing platform and simulated on IBM QASM Simulator and on IBM real quantum hardware.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Oct 13, 2022•4 citations

Cryptographic Protocols and Network Security

Patrick Horster, Hans-Joachim Knobloch

Information Security•May 27, 1992•6 citations

Secure multiparty computation of a comparison problem

Xin Liu, Shundong Li, Jian Liu +2 more

Private comparison is fundamental to secure multiparty computation. In this study, we propose novel protocols to privately determine [Formula: see text], or [Formula: see text] in one execution. First, a 0-1-vector encoding method is introduced to encode a number into a vector, and the Goldwasser-Micali encryption scheme is used to compare integers privately. Then, we propose a protocol by using a geometric method to compare rational numbers privately, and the protocol is information-theoretical secure. Using the simulation paradigm, we prove the privacy-preserving property of our protocols in the semi-honest model. The complexity analysis shows that our protocols are more efficient than previous solutions.

SpringerPlus•Sep 5, 2016•10 citations
In this work, the authors present Quantum Text Teleportation Protocol (QTTP) that uses Quantum Teleportation (QT) technique and Huffman Coding for secure text transfers. The QTTP enables the teleportation of quantum states of text (for example, email) in a secure manner, while simultaneously encrypting and decrypting them using Huffman Coding since data can only be retrieved or decoded if the prefix codes are known. The Huffman Coding approach offers the benefit of compressing the entire text, resulting in faster transmission of large amounts of information. For proof of concept, the authors experimentally evaluated both of the proposed QTTPs (Standard QTTP and QTTP with Huffman Coding) using Quantum Information Science Kit (QISKit), a quantum computing platform and simulated on IBM QASM Simulator and on IBM real quantum hardware.
In this work, the authors present Quantum Text Teleportation Protocol (QTTP) that uses Quantum Teleportation (QT) technique and Huffman Coding for secure text transfers. The QTTP enables the teleportation of quantum states of text (for example, email) in a secure manner, while simultaneously encrypting and decrypting them using Huffman Coding since data can only be retrieved or decoded if the prefix codes are known. The Huffman Coding approach offers the benefit of compressing the entire text, resulting in faster transmission of large amounts of information. For proof of concept, the authors experimentally evaluated both of the proposed QTTPs (Standard QTTP and QTTP with Huffman Coding) using Quantum Information Science Kit (Qiskit), a quantum computing platform and simulated on IBM QASM Simulator and on IBM real quantum hardware.
Private comparison is fundamental to secure multiparty computation. In this study, we propose novel protocols to privately determine [Formula: see text], or [Formula: see text] in one execution. First, a 0-1-vector encoding method is introduced to encode a number into a vector, and the Goldwasser-Micali encryption scheme is used to compare integers privately. Then, we propose a protocol by using a geometric method to compare rational numbers privately, and the protocol is information-theoretical secure. Using the simulation paradigm, we prove the privacy-preserving property of our protocols in the semi-honest model. The complexity analysis shows that our protocols are more efficient than previous solutions.