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
21
views
32
references
Top references
cited by
6
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,198
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
How Fast Can Higher-Order Masking Be in Software?
other
Author(s):
Dahmun Goudarzi
,
Matthieu Rivain
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
Genomic Prediction: Software
Most cited references
32
Record
: found
Abstract
: not found
Book Chapter
: not found
PRESENT: An Ultra-Lightweight Block Cipher
A. Bogdanov
,
L. Knudsen
,
G. Leander
…
(2007)
0
comments
Cited
138
times
– based on
0
reviews
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
Provably Secure Higher-Order Masking of AES
Matthieu Rivain
,
Emmanuel Prouff
(2010)
0
comments
Cited
61
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
: 567-597
DOI:
10.1007/978-3-319-56620-7_20
SO-VID:
a11e9803-7140-4895-94e4-da3f814107be
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Revisiting Lattice Attacks on Overstretched NTRU Parameters
pp. 27
Short Generators Without Quantum Computers: The Case of Multiquadratics
pp. 60
Computing Generator in Cyclotomic Integer Rings
pp. 91
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
pp. 122
From Minicrypt to Obfustopia via Private-Key Functional Encryption
pp. 152
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
pp. 185
Computation of a 768-Bit Prime Field Discrete Logarithm
pp. 202
A Kilobit Hidden SNFS Discrete Logarithm Computation
pp. 235
Improved Private Set Intersection Against Malicious Adversaries
pp. 260
Formal Abstractions for Attested Execution Secure Processors
pp. 293
One-Shot Verifiable Encryption from Lattices
pp. 324
Short Stickelberger Class Relations and Application to Ideal-SVP
pp. 351
Concurrently Composable Security with Shielded Super-Polynomial Simulators
pp. 382
Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs
pp. 415
Private Puncturable PRFs from Standard Lattice Assumptions
pp. 446
Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
pp. 479
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
pp. 501
Sublinear Zero-Knowledge Arguments for RAM Programs
pp. 535
Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model
pp. 567
How Fast Can Higher-Order Masking Be in Software?
pp. 601
Multi-input Inner-Product Functional Encryption from Pairings
pp. 627
Simplifying Design and Analysis of Complex Predicate Encryption Schemes
pp. 659
Twisted $${\mu }_4$$ -Normal Form for Elliptic Curves
pp. 679
Efficient Compression of SIDH Public Keys
Similar content
2,198
Evaluation of different types of bitterness masking on inhibition of bitterness efficiency and law of four chinese materia medicine decoctions of gentianae radix et rhizoma, sophorae flavescentis radix, andrographis herba, and nelumbinis plumula
Authors:
X. LI
,
H Kang
,
L. Tian
The Case for Being Average: A Mediocrity Approach to Style Masking and Author Obfuscation
Authors:
Georgi Karadjov
,
Tsvetomila Mihaylova
,
Yasen Kiprov
…
Benchmarking Computer-Vision Based Facial Emotion Classification Algorithms While Wearing Surgical Masks
Authors:
L Coelho
,
S. REIS
,
C. MOREIRA
…
See all similar
Cited by
6
Very High Order Masking: Efficient Implementation and Security Evaluation
Authors:
Anthony Journault
,
François-Xavier Standaert
Strengthening the Security of AES Against Differential Fault Attack
Authors:
Anit Kumar Ghosal
,
Dipanwita Roychowdhury
Masking Proofs Are Tight and How to Exploit it in Security Evaluations
Authors:
Vincent G. Grosso
,
François-Xavier Standaert
See all cited by