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

Journal of Cryptology

Automata Evaluation and Text Search Protocols with Simulation-Based Security

Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen

Published Feb 11, 2015• 6 citations
Publisher
DOI
10.1007/s00145-014-9193-x

Related papers

Text Search Protocols with Simulation Based Security

Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen

Lecture notes in computer science•Jan 1, 2010•59 citations

Secure Deterministic Automata Evaluation: Completeness and Efficient 2-party Protocols

Giovanni Di Crescenzo, Brian Coan, Jonathan Kirsch

Lecture notes in computer science•Jan 1, 2020•0 citations

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

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

Privacy-Preserving Deterministic Automata Evaluation with Encrypted Data Blocks

Giovanni Di Crescenzo, Brian Coan, Jonathan Kirsch

Lecture notes in computer science•Jan 1, 2017•3 citations

Computing Without Learning: An Information-Theoretically Secure Multiparty Evaluation of Deterministic Pushdown Automata

Soumen Sarkar, Jaydeep Howlader

Multiparty computation allows a finite group of parties to jointly compute a known function of their combined inputs without revealing any individual’s input. This work presents a multiparty computation protocol for evaluating a private string on a deterministic pushdown automaton. The protocol takes as input both the automaton’s description and the string, and ensures that no party learns either the automaton or the string; they only learn whether the automaton accepts or rejects the string.This study emphasizes three main contributions. First, is it possible to compute a private function among a finite set of parties, where no party learns either the function or the inputs? We show that the answer is affirmative for computational models like pushdown automata. Second, our protocol provides a general framework for evaluating deterministic pushdown automata, thereby classifying a subclass of context-free languages that can be evaluated privately using multiparty computation. Finally, the proposed work is secure under the information-theoretic paradigm and inherently quantum safe.

IEEE Transactions on Computers•Sep 11, 2026•0 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.
Multiparty computation allows a finite group of parties to jointly compute a known function of their combined inputs without revealing any individual’s input. This work presents a multiparty computation protocol for evaluating a private string on a deterministic pushdown automaton. The protocol takes as input both the automaton’s description and the string, and ensures that no party learns either the automaton or the string; they only learn whether the automaton accepts or rejects the string.This study emphasizes three main contributions. First, is it possible to compute a private function among a finite set of parties, where no party learns either the function or the inputs? We show that the answer is affirmative for computational models like pushdown automata. Second, our protocol provides a general framework for evaluating deterministic pushdown automata, thereby classifying a subclass of context-free languages that can be evaluated privately using multiparty computation. Finally, the proposed work is secure under the information-theoretic paradigm and inherently quantum safe.