An efficient scheme for proving a shuffle

Jun Furukawa, Kazue Sako

Research output: Chapter in Book/Report/Conference proceedingConference contribution

214 Citations (Scopus)


In this paper, we propose a novel and efficient protocol for proving the correctness of a shuffle, without leaking how the shuffle was performed. Using this protocol, we can prove the correctness of a shuffle of n data with roughly 18n exponentiations, where as the protocol of Sako-Kilian[SK95] required 642n and that of Abe[Ab99] required 22nlog n. The length of proof will be only 2 11n bits in our protocol, opposed to 218n bits and 2 14nlog n bits required by Sako-Kilian and Abe, respectively. The proposed protocol will be a building block of an efficient, universally verifiable mix-net, whose application to voting system is prominent.

Original languageEnglish
Title of host publicationAdvances in Cryptology, CRYPTO 2001 - 21st Annual International Cryptology Conference, Proceedings
EditorsJoe Kilian
PublisherSpringer Verlag
Number of pages20
ISBN (Print)3540424563, 9783540424567
Publication statusPublished - 2001
Externally publishedYes
Event21st Annual International Cryptology Conference, CRYPTO 2001 - Santa Barbara, CA, United States
Duration: 2001 Aug 192001 Aug 23

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2139 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference21st Annual International Cryptology Conference, CRYPTO 2001
Country/TerritoryUnited States
CitySanta Barbara, CA


  • Electronic Voting
  • Mix-net
  • Permutation
  • Universal Verifiability

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'An efficient scheme for proving a shuffle'. Together they form a unique fingerprint.

Cite this