Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
50
views
13
references
Top references
cited by
11
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,227
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – EUROCRYPT 2017
Scrypt Is Maximally Memory-Hard
other
Author(s):
Joël Alwen
,
Binyi Chen
,
Krzysztof Pietrzak
,
Leonid Reyzin
,
Stefano Tessaro
Publication date
(Online):
April 01 2017
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
Embodied Memory
Most cited references
13
Record
: found
Abstract
: not found
Article
: not found
Probability Inequalities for Sums of Bounded Random Variables
Wassily Hoeffding
(1963)
0
comments
Cited
788
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
CAPTCHA: Using Hard AI Problems for Security
Luis von Ahn
,
Manuel R Blum
,
Nicholas Hopper
…
(2003)
0
comments
Cited
89
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Proofs of Work and Bread Pudding Protocols(Extended Abstract)
Markus Jakobsson
,
Ari Juels
(1999)
0
comments
Cited
39
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
April 01 2017
Pages
: 33-62
DOI:
10.1007/978-3-319-56617-7_2
SO-VID:
ba50640f-bb86-4792-bf11-ebb2e5099cf8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Depth-Robust Graphs and Their Cumulative Memory Complexity
pp. 216
New Collision Attacks on Round-Reduced Keccak
pp. 519
0-RTT Key Exchange with Full Forward Secrecy
pp. 33
Scrypt Is Maximally Memory-Hard
pp. 551
Computational Integrity with a Public Random String from Quasi-Linear PCPs
Similar content
2,227
Hardness and Wear Resistance of Dental Biomedical Nanomaterials in a Humid Environment with Non-Stationary Temperatures
Authors:
Daniel Pieniak
,
Agata Walczak
,
Mariusz Walczak
…
Hard ticks (Ixodida: Ixodidae) in the Colombian Caribbean harbor the Jingmen tick virus: an emerging arbovirus of public health concern
Authors:
Yesica López
,
Richard Thomas
,
Sebastián Muñoz-Leal
…
In Vitro evaluation of remineralization potential of novamin on artificially induced carious lesions in primary teeth using scanning electron microscope and vickers hardness.
Authors:
Anshul Gangwar
,
Kaushal Jha
,
Jyoti Thakur
…
See all similar
Cited by
11
Depth-Robust Graphs and Their Cumulative Memory Complexity
Authors:
Joel Alwen
,
Jeremiah Blocki
,
Krzysztof Pietrzak
Moderately Hard Functions: Definition, Instantiations, and Applications
Authors:
Joel Alwen
,
Björn Tackmann
Instant Function Calls Using Synchronized Cross-Blockchain Smart Contracts
Authors:
Martin Westerkamp
,
Axel Küpper
See all cited by