ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0806.1931
  4. Cited By
Information-Theoretically Secure Voting Without an Honest Majority

Information-Theoretically Secure Voting Without an Honest Majority

11 June 2008
Anne Broadbent
Alain Tapp
ArXiv (abs)PDFHTML

Papers citing "Information-Theoretically Secure Voting Without an Honest Majority"

3 / 3 papers shown
Title
Deterministic Relativistic Quantum Bit Commitment
Deterministic Relativistic Quantum Bit Commitment
Emily Adlam
A. Kent
66
17
0
03 Apr 2015
Unconditionally Secure Bit Commitment by Transmitting Measurement
  Outcomes
Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes
A. Kent
OT
118
106
0
14 Aug 2011
Exact, Efficient and Information-Theoretically Secure Voting with an
  Arbitrary Number of Cheaters
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters
Anne Broadbent
S. Jeffery
Alain Tapp
87
2
0
23 Nov 2010
1