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
19
references
Top references
cited by
9
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,298
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Randomness Complexity of Private Circuits for Multiplication
other
Author(s):
Sonia Belaïd
,
Fabrice Benhamouda
,
Alain Passelègue
,
Emmanuel Prouff
,
Adrian Thillard
,
Damien Vergnaud
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
ScienceOpen Research
Most cited references
19
Record
: found
Abstract
: not found
Article
: not found
The Byzantine Generals Problem
Leslie Lamport
,
Robert Shostak
,
Marshall Pease
(1982)
0
comments
Cited
527
times
– based on
0
reviews
Review now
Bookmark
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
Book Chapter
: not found
A method for finding codewords of small weight
Jacques Stern
(1989)
0
comments
Cited
65
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
: 616-648
DOI:
10.1007/978-3-662-49896-5_22
SO-VID:
e5fc7dce-1497-4da5-8bfb-b35672e43cfc
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
3,298
On "Consistent Quantization of Nearly Singular Superconducting Circuits"
Authors:
I. L. Egusquiza
,
A. Parra-Rodriguez
COVID-19 policies and tuberculosis services in private health sectors of India, Indonesia, and Nigeria
Authors:
Nathaly Aguilera Vasquez
,
Charity Oga-Omenka
,
Vijayashree Yellappa
…
Nicotine addiction: Translational insights from circuit neuroscience
Authors:
M.J. Scarlata
,
R.J. Keeley
,
E.A. Stein
See all similar
Cited by
9
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
Authors:
Gilles Barthe
,
François Dupressoir
,
Sebastian Faust
…
Very High Order Masking: Efficient Implementation and Security Evaluation
Authors:
Anthony Journault
,
François-Xavier Standaert
Formal Verification of Masked Hardware Implementations in the Presence of Glitches
Authors:
Roderick Bloem
,
Hannes Gross
,
Rinat Iusupov
…
See all cited by