Practical Verifiable Encryption and Decryption of Discrete Logarithms

By Jan Camenisch, Victor Shoup. Annual International Cryptology Conference, 2003

597 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/0df07fc5f4e09f5c9030efecf359d989d81fa36d

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Electrical and Electronic Engineering

Citations in the corpus

Signature Schemes and Anonymous Credentials from Bilinear Maps (2004, methodology): “Then, instead of encrypting P , one could use the Camenisch-Shoup encryption scheme [11] to directly encrypt the identity as one of the discrete logarithms the knowledge of which is proven when proving knowledge of a signature.”
Practical Private Set Intersection Protocols with Linear Complexity (2010, methodology): “Encryption operations are performed using an additively homomorphic encryption scheme, such as the one presented by Camenisch and Shoup, CS for short [7].”
A Scalable Scheme for Privacy-Preserving Aggregation of Time-Series Data (2013, methodology): “Albeit taking place in the random oracle model [2], it bears similarities with the techniques of Cramer and Shoup [10] (see also [6]) in that it appeals to an information theoretic argument exploiting some entropy hidden in the private key.”
Enhanced Privacy ID from Bilinear Pairing for Hardware Authentication and Attestation (2010, methodology): “• For each item in sRL, the platform needs to compute 3 EXPs in G3 and the verifier needs to perform 2 EXPs in G3 if we use the zero-knowledge proof in [20].”
Direct anonymous attestation (2004, background): “At some loss of efficiency, this drawback could be overcome for instance by using the verifiable encryption [13] of these values.”
Anonymous Identification in Ad Hoc Groups (2004, methodology): “using protocols for verifiable encryption and decryption of discrete logarithms from [17].”
Compact E-Cash (2005, background): “If this were the case, we could require that the user, as part of the withdrawal protocol, should verifiably encrypt [1, 11, 18] the value s under her own pkU , to form a ciphertext c.”
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection (2009, methodology): “C = Enc pk (m ) ∧ C 2 ∈ (C 1 · Enc pk ( m)) m } (5) – Verifiable Decryption: We require an efficient realization of the following proof system, given public keys pk and pk and ciphertexts C, C 1 and C 2 , where C is supposed to be ciphertext under public key pk and C 1 and C 2 are supposed to be cip”
Sequences of games: a tool for taming complexity in security proofs (2004, methodology): “The author has used proofs organized as sequences of games extensively in his own work [Sho00, SS00, Sho01, Sho02, CS02, CS03b, CS03a , GS04] and has found them to be an indispensable tool — while some of the proofs in these papers could be structured dierently, it is hard to imagine how most of th”
Chosen-Ciphertext Security from Identity-Based Encryption (2004, methodology): “Other constructions relying on this technique have been given recently [32, 23, 42],”