Traceable receipt-free encryption

DOI10.1007/978-3-031-22969-5_10zbMATH Open1519.94104OpenAlexW4317928255MaRDI QIDQ6135436FDOQ6135436

Authors:

Publication date: 25 August 2023

Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22969-5_10

Recommendations

• Efficent receipt-free voting based on homomorphic encryption
• Formalising Receipt-Freeness
• A critique of game-based definitions of receipt-freeness for voting
• Receipt-free secret-ballot elections (extended abstract)
• Information Security and Cryptology - ICISC 2003

zbMATH Keywords

public-key encryptionreceipt-freenessnew primitive

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Identity-based cryptosystems and signature schemes
• Functional encryption: definitions and challenges
• Title not available (Why is that?)
• Fuzzy Identity-Based Encryption
• Theory of Cryptography
• Theory of Cryptography
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• Malleable proof systems and applications
• Structure-preserving signatures and commitments to group elements
• Efficient signatures on randomizable ciphertexts
• Secure distributed key generation for discrete-log based cryptosystems
• Universally composable incoercibility
• Title not available (Why is that?)
• Receipt-free secret-ballot elections (extended abstract)
• Advances in Cryptology - CRYPTO 2003
• Title not available (Why is that?)
• Efficent receipt-free voting based on homomorphic encryption
• On some incompatible properties of voting schemes
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
• Signatures on randomizable ciphertexts
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Quasi-adaptive NIZK for linear subspaces revisited
• Non-malleability from malleability: simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures
• Achieving independence efficiently and securely
• A Commitment-Consistent Proof of a Shuffle
• End-to-End Verifiable Elections in the Standard Model
• How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
• Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
• Efficient fully structure-preserving signatures for large messages
• Simplified Submission of Inputs to Protocols
• Incoercible multi-party computation and universally composable receipt-free voting
• Traceable receipt-free encryption

Cited In (5)

• Escrow-free encryption supporting cryptographic workflow
• A critique of game-based definitions of receipt-freeness for voting
• Traceable receipt-free encryption
• Practical traceable receipt-free encryption
• Encryption mechanisms for receipt-free and perfectly private verifiable elections

This page was built for publication: Traceable receipt-free encryption

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