Quantum verifiable protocol for secure modulo zero-sum randomness
From MaRDI portal
Publication:2101598
DOI10.1007/S11128-022-03639-XOpenAlexW4291274483MaRDI QIDQ2101598
Takeshi Koshiba, Masahito Hayashi
Publication date: 6 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03639-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- A communication-privacy tradeoff for modular addition
- The privacy of dense symmetric functions
- Secure communication in minimal connectivity models
- Secure multi-party quantum summation based on quantum Fourier transform
- Group Representation for Quantum Theory
- Identifying Cheaters without an Honest Majority
- Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
- Demonstration of Blind Quantum Computing
- How to share a secret
- Generalized Self-testing and the Security of the 6-State Protocol
- Public Discussion Must Be Back and Forth in Secure Message Transmission
- Perfectly Secure Message Transmission in Two Rounds
- On Cheater Identifiable Secret Sharing Schemes Secure against Rushing Adversary
- Self-Testing Graph States
- Toeplitz and Circulant Matrices: A Review
- Partial Fairness in Secure Two-Party Computation
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Foundations of Cryptography
- Perfectly secure message transmission
- A unified and generalized treatment of authentication theory
- Robust self-testing of the singlet
- Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme
- Universal Blind Quantum Computation
- Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication
- On Optimal Secure Message Transmission by Public Discussion
- Multi-party quantum summation without a trusted third party based on single particles
- Introduction to Quantum Information Science
- Almost-Everywhere Secure Computation
- Testing Statistical Hypotheses
- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
This page was built for publication: Quantum verifiable protocol for secure modulo zero-sum randomness
