Actively revealing card attack on card-based protocols
From MaRDI portal
Publication:6136456
Cites work
- A single shuffle is enough for secure card-based computation of any Boolean circuit
- Analysis of information leakage due to operative errors in card-based protocols
- Card-based cryptographic protocols using a minimal number of cards
- Card-based cryptography meets formal verification
- Card-based protocols for secure ranking computations
- Computations with a deck of cards
- Efficient card-based protocols for generating a hidden random permutation without fixed points
- Efficient card-based zero-knowledge proof for Sudoku
- Foundations for actively secure card-based cryptography
- How to share a secret
- scientific article; zbMATH DE number 1024066 (Why is no real title available?)
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Practical card-based implementations of Yao's millionaire protocol
- Secure multiparty computations without computers
- Six-Card Secure AND and Four-Card Secure XOR
- The five-card trick can be done with four cards
Cited in
(3)
This page was built for publication: Actively revealing card attack on card-based protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136456)