Efficient simulation for quantum message authentication

DOI10.1007/978-3-319-49175-2_4MaRDI QIDQ2953810zbMATH OpenOpenAlexFDO

Authors Anne Broadbent, Evelyn Wainewright

Publication date 6 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.03075

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Abstract: Quantum message authentication codes are families of keyed encoding and decoding maps that enable the detection of tampering on encoded quantum data. Here, we study a new class of simulators for quantum message authentication schemes, and show how they are applied in the context of two codes: the Clifford and the trap code. Our results show for the first time that these codes admit an efficient simulation (assuming that the adversary is efficient). Such efficient simulation is typically crucial in order to establish a composable notion of security.

Recommendations

• Quantum-secure message authentication codes
• New security notions and feasibility results for authentication of quantum data
• Quantum authentication with unitary coding sets
• Robust message authentication over a collective-noise channel
• Quantum authentication with key recycling

Cites work

• Actively secure two-party evaluation of any quantum operation
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Quantum cryptography
• Quantum cryptography beyond quantum key distribution
• Quantum cryptography: public key distribution and coin tossing
• Quantum one-time programs. (Extended abstract)
• Universally composable quantum multi-party computation

Cited in

(14)

• A quantum evolving secret sharing scheme
• Secure multi-party quantum computation with a dishonest majority
• Quantum multi-secret sharing via trap codes and discrete quantum walks
• Quantum permutation pad for universal quantum-safe cryptography
• Quantum public-key encryption schemes based on conjugate coding
• Quantum authentication with key recycling
• Quantum ciphertext authentication and key recycling with the trap code
• On concurrent multi-party quantum computation
• Efficient quantum multi-authority attribute-based encryption and generalizations
• Authentication of continuous-variable quantum messages
• High-efficient quantum co-signature scheme. With entanglement measure
• Split-state non-malleable codes and secret sharing schemes for quantum messages
• On split-state quantum tamper detection
• An efficient combination of quantum error correction and authentication

This page was built for publication: Efficient simulation for quantum message authentication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953810)