( en | de | ru )

 

Disambiguation of "Groth, Jens"

Author of the publication

copydeleteadd this publication to your clipboard
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups.

, , , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 649-666. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Lisa Groth

Peter Groth

Reimer Groth

Hartwig Groth

Werner Groth

 

Other publications of authors with the same name

One-out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin., and . IACR Cryptology ePrint Archive, (2014)Homomorphic Trapdoor Commitments to Group Elements.. IACR Cryptology ePrint Archive, (2009)Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups., , , and . CRYPTO (1), volume 8616 of Lecture Notes in Computer Science, page 241-260. Springer, (2014)Short Non-interactive Zero-Knowledge Proofs.. ASIACRYPT, volume 6477 of Lecture Notes in Computer Science, page 341-358. Springer, (2010)Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast.. Financial Cryptography, volume 3110 of Lecture Notes in Computer Science, page 90-104. Springer, (2004)Multi-query Computationally-Private Information Retrieval with Constant Communication Rate., , and . Public Key Cryptography, volume 6056 of Lecture Notes in Computer Science, page 107-123. Springer, (2010)One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin., and . EUROCRYPT (2), volume 9057 of Lecture Notes in Computer Science, page 253-280. Springer, (2015)On the Security of ECDSA with Additive Key Derivation and Presignatures., and . EUROCRYPT (1), volume 13275 of Lecture Notes in Computer Science, page 365-396. Springer, (2022)Evaluating Security of Voting Schemes in the Universal Composability Framework.. IACR Cryptology ePrint Archive, (2002)Pairing-Based Non-interactive Zero-Knowledge Proofs.. Pairing, volume 6487 of Lecture Notes in Computer Science, page 206. Springer, (2010)