A blind coupon mechanism enabling veto voting over unreliable networks
From MaRDI portal
Publication:2179393
DOI10.1007/978-3-030-35423-7_13zbMath1453.68024OpenAlexW2995484214MaRDI QIDQ2179393
Thomas J. Haines, Clémentine Gritti, Colin A. Boyd, Kristian Gjøsteen
Publication date: 12 May 2020
Full work available at URL: https://hdl.handle.net/11250/2650538
Cites Work
- Unnamed Item
- Structure-preserving signatures and commitments to group elements
- Linearly homomorphic structure-preserving signatures and their applications
- Spreading alerts quietly and the subgroup escape problem
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Short Attribute-Based Signatures for Threshold Predicates
- How to share a secret
- Financial Cryptography
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Spreading Alerts Quietly and the Subgroup Escape Problem
- A Latency-Free Election Scheme
- Information Security and Cryptology - ICISC 2005
- Computer Aided Verification
This page was built for publication: A blind coupon mechanism enabling veto voting over unreliable networks