Automata, Languages and Programming
From MaRDI portal
Publication:5716782
DOI10.1007/11523468zbMath1082.94527OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716782
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items (8)
An optimally fair coin toss ⋮ Six-Card Secure AND and Four-Card Secure XOR ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol ⋮ Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles ⋮ One-Time Programs ⋮ David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware ⋮ Founding Cryptography on Tamper-Proof Hardware Tokens
This page was built for publication: Automata, Languages and Programming
