Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
51
views
23
references
Top references
cited by
4
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,020
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
other
Author(s):
Marshall Ball
,
Dana Dachman-Soled
,
Mukul Kulkarni
,
Tal Malkin
Publication date
(Online):
April 28 2016
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
Fandom activity
Most cited references
23
Record
: found
Abstract
: not found
Book Chapter
: not found
Private Circuits: Securing Hardware against Probing Attacks
Yuval Ishai
,
Amit Sahai
,
David N Wagner
(2003)
0
comments
Cited
112
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Pseudorandom generators for space-bounded computation
Noam Nisan
(1992)
0
comments
Cited
44
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering
Rosario Gennaro
,
Anna Lysyanskaya
,
Tal Malkin
…
(2004)
0
comments
Cited
40
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
April 28 2016
Pages
: 881-908
DOI:
10.1007/978-3-662-49896-5_31
SO-VID:
8f2ff86d-ec88-4584-9b73-f250a01083d5
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
pp. 32
Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
pp. 63
Online/Offline OR Composition of Sigma Protocols
pp. 93
Constant-Round Leakage-Resilient Zero-Knowledge from Collision Resistance
pp. 124
Constrained Pseudorandom Functions for Unconstrained Inputs
pp. 154
Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN
pp. 184
Secure Computation from Elastic Noisy Channels
pp. 213
All Complete Functionalities are Reversible
pp. 243
On the Power of Hierarchical Identity-Based Encryption
pp. 273
On the Impossibility of Tight Cryptographic Reductions
pp. 305
On the Size of Pairing-Based Non-interactive Arguments
pp. 327
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
pp. 358
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
pp. 388
Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key
pp. 420
Unconditionally Secure Computation with Reduced Interaction
pp. 448
The Exact Round Complexity of Secure Computation
pp. 477
On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments
pp. 497
Computationally Binding Quantum Commitments
pp. 528
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
pp. 559
Recovering Short Generators of Principal Ideals in Cyclotomic Rings
pp. 586
Circuit Compilers with $$O(1/\log (n))$$ O ( 1 / log ( n ) ) Leakage Rate
pp. 616
Randomness Complexity of Private Circuits for Multiplication
pp. 649
10-Round Feistel is Indifferentiable from an Ideal Cipher
pp. 679
Indifferentiability of Confusion-Diffusion Networks
pp. 705
Fair and Robust Multi-party Computation Using a Global Transaction Ledger
pp. 735
Two Round Multiparty Computation via Multi-key FHE
pp. 764
Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
pp. 792
New Negative Results on Differing-Inputs Obfuscation
pp. 822
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model
pp. 852
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
pp. 881
Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
Similar content
2,020
Evaluating Performance of Hybrid PCM-Fan and Hybrid PCM-Desiccant Vests in Moderate and Hot Climates
Authors:
Mariam Itani
,
Rana Bachnak
,
Nesreen Ghaddar
…
Measurements of Intake Separation Hysteresis in a Model Fan and Nacelle Rig
Authors:
C. W. HALL
,
P. THOMAS
Autism-like behaviors regulated by the serotonin receptor 5-HT2B in the dorsal fan-shaped body neurons of Drosophila melanogaster
Authors:
H CAO
,
J TANG
,
Q Liu
…
See all similar
Cited by
4
Non-malleable Codes from Average-Case Hardness: \({\mathsf {A}}{\mathsf {C}}^0\), Decision Trees, and Streaming Space-Bounded Tampering
Authors:
Marshall Ball
,
Dana Dachman-Soled
,
Mukul Kulkarni
…
Revisiting Non-Malleable Secret Sharing
Authors:
Saikrishna Badrinarayanan
,
Akshayaram Srinivasan
Tight Upper and Lower Bounds for Leakage-Resilient, Locally Decodable and Updatable Non-malleable Codes
Authors:
Dana Dachman-Soled
,
Mukul Kulkarni
,
Aria Shahverdi
See all cited by