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
52
views
6
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
1,790
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology — EUROCRYPT 2000
Efficient Proofs that a Committed Number Lies in an Interval
other
Author(s):
Fabrice Boudot
Publication date
(Online):
May 12 2000
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
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
International Union of Crystallography
Most cited references
6
Record
: found
Abstract
: not found
Book Chapter
: not found
A new public-key cryptosystem as secure as factoring
Tatsuaki Okamoto
,
Shigenori Uchiyama
(1998)
0
comments
Cited
65
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Self-certified public keys
Marc Girault
(1991)
0
comments
Cited
25
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Easy come — Easy go divisible cash
Agnes Chan
,
Yair Frankel
,
Yiannis Tsiounis
(1998)
0
comments
Cited
21
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2000
Publication date (Online):
May 12 2000
Pages
: 431-444
DOI:
10.1007/3-540-45539-6_31
SO-VID:
3d31dbc7-52cc-423e-92c2-d46ac0b1e79d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 19
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
pp. 53
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
pp. 104
One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval
pp. 122
Single Database Private Information Retrieval Implies Oblivious Transfer
pp. 156
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
pp. 221
Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures
pp. 259
Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements
pp. 275
Using Hash Functions as a Hedge against Chosen Ciphertext Attack
pp. 408
Cryptanalysis of Patarin’s 2-Round Public Key System with S Boxes (2R)
pp. 418
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
pp. 431
Efficient Proofs that a Committed Number Lies in an Interval
pp. 445
A Composition Theorem for Universal One-Way Hash Functions
pp. 453
Exposure-Resilient Functions and All-or-Nothing Transforms
pp. 470
The Sum of PRPs Is a Secure PRF
pp. 485
Construction of Nonlinear Boolean Functions with Important Cryptographic Properties
pp. 539
Efficient Receipt-Free Voting Based on Homomorphic Encryption
pp. 557
How to Break a Practical MIX and Design a New One
pp. 573
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
pp. 589
Advanced Slide Attacks
Similar content
1,790
Scaling of R\'enyi entanglement entropies of the free Fermi-gas ground state: a rigorous proof
Authors:
Hajo Leschke
,
Alexander Sobolev
,
Wolfgang Spitzer
A new proof of a theorem of Mansour and Sun
Authors:
Victor Guo
Translation of Michael Sadowsky's paper "An elementary proof for the existence of a developable M\"obius band and the attribution of the geometric problem to a variational problem"
Authors:
,
See all similar
Cited by
47
Priced Oblivious Transfer: How to Sell Digital Goods
Authors:
Bill Aiello
,
Yuval Ishai
,
Omer Reingold
Practical Verifiable Encryption and Decryption of Discrete Logarithms
Authors:
Jan Camenisch
,
Victor Shoup
A Survey on Anonymity and Privacy in Bitcoin-Like Digital Cash Systems
Authors:
Merve Kus Khalilov
,
Albert Levi
See all cited by