Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
63
views
22
references
Top references
cited by
48
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,940
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology - CRYPTO 2003
Practical Verifiable Encryption and Decryption of Discrete Logarithms
other
Author(s):
Jan Camenisch
,
Victor Shoup
Publication date
(Print):
2003
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Open source discrete and agent-based modeling frameworks for biology
Most cited references
22
Record
: found
Abstract
: not found
Book Chapter
: not found
Wallet Databases with Observers
David Chaum
,
Torben Pryds Pedersen
(1993)
0
comments
Cited
98
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Universally Composable Commitments
Ran Canetti
,
Marc Fischlin
(2001)
0
comments
Cited
76
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Efficient Proofs that a Committed Number Lies in an Interval
Fabrice Boudot
(2000)
0
comments
Cited
48
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2003
Pages
: 126-144
DOI:
10.1007/978-3-540-45146-4_8
SO-VID:
63873c45-e8c9-4f90-affc-87eabc37b62e
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Factoring Large Numbers with the TWIRL Device
pp. 600
Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication
pp. 44
Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases
pp. 61
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
pp. 78
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret
pp. 96
On Cryptographic Assumptions and Challenges
pp. 110
Scalable Protocols for Authenticated Group Key Exchange
pp. 126
Practical Verifiable Encryption and Decryption of Discrete Logarithms
pp. 145
Extending Oblivious Transfers Efficiently
pp. 162
Algebraic Attacks on Combiners with Memory
pp. 212
A Polynomial Time Algorithm for the Braid Diffie-Hellman Conjugacy Problem
pp. 226
The Impact of Decryption Failures on the Security of NTRU Encryption
pp. 247
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption
pp. 265
Universal Composition with Joint State
pp. 282
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
pp. 316
On Deniability in the Common Reference String and Random Oracle Model
pp. 349
Torus-Based Cryptography
pp. 383
Multipurpose Identity-Based Signcryption
pp. 400
SIGMA: The ‘SIGn-and-MAc’ Approach to Authenticated Diffie-Hellman and Its Use in the IKE Protocols
pp. 482
A Tweakable Enciphering Mode
pp. 513
Luby-Rackoff: 7 Rounds Are Enough for 2 n(1 − ε) Security
pp. 565
Relaxing Chosen-Ciphertext Security
pp. 583
Password Interception in a SSL/TLS Channel
Similar content
3,940
Microscopic description of the intermittent dynamics driving logarithmic creep
Authors:
Daniel J. Korchinski
,
Dor Shohat
,
Yoav Lahini
…
Facile in-situ preparation of MAPbBr3@UiO-66 composites for information encryption and decryption
Authors:
Laixiang Shi
,
Ji. Wang
,
Lin Zhou
…
PLAM: A Posit Logarithm-Approximate Multiplier
Authors:
Raul Murillo
,
Alberto Del Barrio
,
Guillermo Botella
…
See all similar
Cited by
48
Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption
Authors:
Dan Boneh
,
Jonathan Katz
Efficient Two-Party Secure Computation on Committed Inputs
Authors:
Stanisław Jarecki
,
Vitaly Shmatikov
Practical Chosen Ciphertext Secure Encryption from Factoring
Authors:
Dennis Hofheinz
,
Eike Kiltz
See all cited by