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
34
views
62
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,323
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2018
The Discrete-Logarithm Problem with Preprocessing
other
Author(s):
Henry Corrigan-Gibbs
,
Dmitry Kogan
Publication date
(Online):
March 31 2018
Publisher:
Springer International Publishing
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
62
Record
: found
Abstract
: not found
Article
: not found
The Elliptic Curve Digital Signature Algorithm (ECDSA)
Don Johnson
,
Alfred Menezes
,
Scott Vanstone
(2001)
0
comments
Cited
190
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
Ronald Cramer
,
Victor Shoup
(1998)
0
comments
Cited
177
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Evaluating 2-DNF Formulas on Ciphertexts
Dan Boneh
,
Eu-Jin Goh
,
Kobbi Nissim
(2005)
0
comments
Cited
139
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2018
Publication date (Online):
March 31 2018
Pages
: 415-447
DOI:
10.1007/978-3-319-78375-8_14
SO-VID:
645c94a4-96d1-46b0-99ba-b0588137b46c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 34
But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin
pp. 66
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain
pp. 99
Sustained Space Complexity
pp. 133
Multi-Collision Resistant Hash Functions and Their Applications
pp. 162
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
pp. 197
Synchronized Aggregate Signatures from the RSA Assumption
pp. 230
More Efficient (Almost) Tightly Secure Structure-Preserving Signatures
pp. 261
The Communication Complexity of Private Simultaneous Messages, Revisited
pp. 287
The Complexity of Multiparty PSM Protocols and Related Models
pp. 321
Formal Verification of Masked Hardware Implementations in the Presence of Glitches
pp. 354
Masking the GLP Lattice-Based Signature Scheme at Any Order
pp. 385
Masking Proofs Are Tight and How to Exploit it in Security Evaluations
pp. 415
The Discrete-Logarithm Problem with Preprocessing
pp. 468
Two-Round Multiparty Secure Computation from Minimal Assumptions
pp. 500
k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits
pp. 535
Adaptively Secure Garbling with Near Optimal Online Complexity
pp. 566
A New Approach to Black-Box Concurrent Secure Computation
pp. 603
Obfustopia Built on Secret-Key Functional Encryption
pp. 649
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)
pp. 683
Boomerang Connectivity Table: A New Cryptanalysis Tool
pp. 715
Correlation Cube Attacks: From Weak-Key Distinguisher to Key Recovery
pp. 745
The Missing Difference Problem, and Its Applications to Counter Mode Encryption
pp. 771
Fast Near Collision Attack on the Grain v1 Stream Cipher
Similar content
2,323
Increased Mutation Rate of E. coli K12λ Cultures Maintained in Continuous Logarithmic Growth
Authors:
John Northrop
Nevanlinna’s lemma on the logarithmic derivative of a meromorphic function
Authors:
AA Gol’dberg
Law of the iterated logarithm for the periodogram
Authors:
Christophe Cuny
,
Florence Merlevède
,
Magda Peligrad
See all similar