Practical Verifiable Encryption and Decryption of Discrete Logarithms

DMCA

Practical Verifiable Encryption and Decryption of Discrete Logarithms (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jan Camenisch , Victor Shoup

Citations:

169 - 24 self

BibTeX

@INPROCEEDINGS{Camenisch03practicalverifiable,
    author = {Jan Camenisch and Victor Shoup},
    title = {Practical Verifiable Encryption and Decryption of Discrete Logarithms},
    booktitle = {},
    year = {2003},
    pages = {126--144},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

This paper addresses the problem of designing practical protocols for proving properties about encrypted data. To this end, it presents a variant of the new public key encryption of Cramer and Shoup based on Paillier’s decision composite residuosity assumption, along with efficient protocols for verifiable encryption and decryption of discrete logarithms (and more generally, of representations with respect to multiple bases). This is the first verifiable encryption system that provides chosen ciphertext security and avoids inefficient cut-and-choose proofs. The presented protocols have numerous applications, including key escrow, optimistic fair exchange, publicly verifiable secret and signature sharing, universally composable commitments, group signatures, and confirmer signatures.

Keyphrases

discrete logarithm practical verifiable encryption practical protocol verifiable encryption group signature decision composite residuosity assumption numerous application key escrow new public key encryption signature sharing presented protocol optimistic fair exchange verifiable secret first verifiable encryption system efficient protocol ciphertext security composable commitment confirmer signature avoids inefficient cut-and-choose proof

DMCA