UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at http://www.ucl.ac.uk/finance/research/post_award/post_award_contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
A Verifiable Secret Shuffle of Homomorphic Encryptions
  • Publication Type:
    Conference
  • Authors:
    Groth J
  • Publisher:
    Springer
  • Publication date:
    06/01/2003
  • Pagination:
    145, 160
  • Volume:
    2567
  • Series:
    Lecture Notes in Computer Science
  • Editors:
    Desmedt Y
  • Status:
    Published
  • Name of conference:
    Public Key Cryptography - PKC: 6th International Workshop on Theory and Practice in Public Key Cryptography
  • Conference place:
    Miami, US
  • Conference start date:
    06/01/2003
  • Conference finish date:
    08/01/2003
Abstract
We show how to prove in honest verifier zero-knowledge the correctness of a shuffle of homomorphic encryptions (or homomorphic commitments.) A shuffle consists in a rearrangement of the input ciphertexts and a reencryption of them so that the permutation is not revealed. Our scheme is more efficient than previous schemes both in terms of communication complexity and computational complexity. Indeed, in the case of shuffling ElGamal encryptions, the proof of correctness is smaller than the encryptions themselves.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by