Tight Private Circuits: Achieving Probing Security with the Least - PowerPoint PPT Presentation

Jan 23, 2024 •134 likes •655 views

Tight Private Circuits: Achieving Probing Security with the Least Refreshing Sonia Belaid, Dahmun Goudarzi, and Matthieu Rivain dahmun.goudarzi@pqshield.com 1 Side-Channel Attacks and Higher-Order Masking in 1 in 2 in 3

Tight Private Circuits:   Achieving Probing Security with the Least Refreshing Sonia Belaid, Dahmun Goudarzi, and Matthieu Rivain dahmun.goudarzi@pqshield.com �1
Side-Channel Attacks and Higher-Order Masking in 1 in 2 in 3 ⊗ ⊕ ⊕ ⊗ • Higher-Order Masking: For each in , in = m 1 + m 2 + … + m d �2 �2
Implementation Transformation [ x ] [ y ] [ z ] x y z [ ] ⊕ R ⊗ ⊕ [ ] ⊗ [ ] ⊗ ⊕ ⊗ [ ] ⊗ [ ] ⊗ �3 : d-sharing [ x ] : multiplication gadget [ ] ⊗ : addition gadget [ ] ⊕ : refresh gadget R �3
Secure Gadgets Addition gadget Multiplication gadget Refresh gadget [ x ] [ y ] [ x ] [ y ] [ x ] [ ] ⊕ [ ] ⊗ R [ z ] = [ x + y ] [ z ] = [ x ⋅ y ] [ z ] = [ x ] • Addition gadget: [ x ] + [ y ] = ( x 1 + y 1 , x 2 + y 2 , …, x d + y d ) • Refresh gadget: Ref ([ x ]) = [ x ] [1] [ ] ⊗ �4 �4

Recommend

Randomness Complexity of Private Circuits for Multiplication Sonia Belad, Fabrice Benhamouda,

Randomness Complexity of Private Circuits for Multiplication Sonia Belad, Fabrice Benhamouda, Alain Passelgue , Emmanuel Prouff, Adrian Thillard, Damien Vergnaud brief introduction - side-channel attacks - masking - -probing model

955 views • 54 slides

Random Probing Security Verification, Composition, Expansion and New Constructions Sonia Belad 1

Introduction Random Probing Security Random Probing Composability Random Probing Expandability Conclusion Random Probing Security Verification, Composition, Expansion and New Constructions Sonia Belad 1 , Jean-Sbastien Coron 2 Emmanuel

1.04k views • 99 slides

Copywriting on Tight Deadlines How ordinary marketers are achieving 103% gains with a

Copywriting on Tight Deadlines How ordinary marketers are achieving 103% gains with a step-by-step framework Todd Lebo Justin Bridegan Senior Director of Content Senior Marketing Manager MECLABS MECLABS Background and Test Design

493 views • 37 slides

Tight PRF-Security of Double-block Hash-then-Sum MACs Seongkwang Kim, Byeonghak Lee , Jooyoung Lee

Tight PRF-Security of Double-block Hash-then-Sum MACs Seongkwang Kim, Byeonghak Lee , Jooyoung Lee KAIST Outline Introduction - Message Authentication Code - Double-block Hash-then-Sum paradigm Our Contribution - Tight security proof of

394 views • 24 slides

Masking Proofs are Tight (and How to Exploit it in Security Evaluations) Vincent Grosso,

Masking Proofs are Tight (and How to Exploit it in Security Evaluations) Vincent Grosso, Franois-Xavier Standaert Radbout University Nijmegen (The Netherlands), UCL (Belgium) EUROCRYPT 2018, Tel Aviv, Israel Motivation (side-channel security

775 views • 52 slides

Private Set In Intersection (PSI): in the Cloud, or using Circuits Benny Pinkas September 10,

Private Set In Intersection (PSI): in the Cloud, or using Circuits Benny Pinkas September 10, 2017 Pri rivate Set In Intersectio ion (P (PSI) ? ? In In this talk Computing PSI using linear-size circuits, via two-dimensional Cuckoo

1.11k views • 78 slides

HIBE with Tight Multi-challenge Security Roman Langrehr ETH Zurich (Switzerland), Part of the

HIBE with Tight Multi-challenge Security Roman Langrehr ETH Zurich (Switzerland), Part of the work done at KIT (Karlsruhe, Germany) Jiaxin Pan NTNU (Trondheim, Norway) Roman Langrehr, Jiaxin Pan 2020-06-01 1 Outline (H)IBE Tight

997 views • 67 slides

On Tight Security Proofs for Schnorr Signatures Nils Fleischhacker 1 Tibor Jager 2 oder 1

On Tight Security Proofs for Schnorr Signatures Nils Fleischhacker 1 Tibor Jager 2 oder 1 Dominique Schr 1 Saarland University 2 Horst G ortz Institute for IT Security, Ruhr-University Bochum December 9, 2014 (Informal) main Result The

1.35k views • 36 slides

Proving tight security for RabinWilliams signatures D. J. Bernstein University of Illinois at

Proving tight security for RabinWilliams signatures D. J. Bernstein University of Illinois at Chicago Thanks to: NSF CCR9983950 NSF DMS0140542 NSF ITR0716498 Alfred P. Sloan Foundation Warning: Springer mangled the

589 views • 19 slides

Addition is exponentially harder than counting for shallow monotone circuits Igor Carboni

Addition is exponentially harder than counting for shallow monotone circuits Igor Carboni Oliveira University of Oxford Joint work with Xi Chen and Rocco Servedio 1 We know a fair bit about monotone functions and monotone circuits (tight

587 views • 26 slides

Probing for Open DNS Resolvers John Kristoff jtk@depaul.edu Midwest Security Workshop jtk

Probing for Open DNS Resolvers John Kristoff jtk@depaul.edu Midwest Security Workshop jtk (jtk@depaul.edu) DNS Probing September 30, 2006 1 / 9 Open Resolvers Recursive - open access to a full resolver Forwarder - proxy access to a

371 views • 9 slides

Occultations for Probing for Probing Occultations Atmosphere and Climate: Atmosphere and

I nstitute for G eophysics, A strophysics, and M eteorology / U niversity of G raz A tmospheric R emote S ensing and Cli mate Sys tem Research Group ARSCliSys on the art of understanding the climate system Occultations for Probing for Probing

570 views • 12 slides

On the Composition of Single-Keyed Tweakable Even-Mansour for Achieving BBB Security Avik

Introduction Permutation-Based MACs PDMMAC Security of PDM*MAC Good Events Conclusion On the Composition of Single-Keyed Tweakable Even-Mansour for Achieving BBB Security Avik Chakraborti, Mridul Nandi, Suprita Talnikar , Kan Yasuda

1.03k views • 25 slides

On the Impossibility of Tight Cryptographic Reduc:ons Christoph Bader, Tibor Jager, Yong Li, Sven

On the Impossibility of Tight Cryptographic Reduc:ons Christoph Bader, Tibor Jager, Yong Li, Sven Schge Ruhr-University Bochum EUROCRYPT 2016 1 Tight Cryptographic Reduc:ons 1. Define a security model 2. Prove: efficient a/acker A

835 views • 48 slides

Proving tight security for Rabin-Williams signatures D. J. Bernstein Public-key signatures 1976

Proving tight security for Rabin-Williams signatures D. J. Bernstein Public-key signatures 1976 Diffie Hellman: Public-key signatures would allow verification by anyone, not just signer. Cool! Can we build a signature system? 1977 Rivest

743 views • 33 slides

Achieving Food Security in SSA through Food Value Chains Food Value Chains Annual Meeting 21 th

Achieving Food Security in SSA through Food Value Chains Food Value Chains Annual Meeting 21 th - 24 th of September 2015 8th of June IFPRI, Washington GlobE Global Food Security of the German Ministries BMBF and BMZ Regional focus of the six

440 views • 28 slides

On the spectral features of robust probing security Maria Chiara Molteni 1 Vittorio Zaccaria 2 1

Context Theoretical contribution Applications Complexity Conclusion On the spectral features of robust probing security Maria Chiara Molteni 1 Vittorio Zaccaria 2 1 Dipartimento di Informatica Giovanni Degli Antoni Universit` a degli

1.03k views • 52 slides

Strategies for Achieving Network Intelligence Adam DAmico Zanshin Security, LLC

Strategies for Achieving Network Intelligence Adam DAmico Zanshin Security, LLC adam@zanshinsecurity.com June 8, 2005 Abstract In order for security efforts to be effective in the contemporary threat environment, network professionals who

497 views • 14 slides

Tao Probing the End of the World 1 - 1 - Masato

@YITP WS Tao Probing the End of the World 1 - 1 - Masato Taki RIKEN , i THES group .Yagi (KIAS) [ arXiv:1504.03672] Collaboration w/ S-S.Kim and F 2015.11/12 Tao Probing the End of the World new

1.01k views • 81 slides

Outline Crypto intro Computer Security: Secret Key Crypto Symmetric crypto Achieving security

Crypto intro Crypto intro Symmetric crypto Symmetric crypto Achieving security goals with symmetric crypto Achieving security goals with symmetric crypto Radboud University Nijmegen Radboud University Nijmegen e-Passport example

1.11k views • 12 slides

SVMpAUC-tight: A new algorithm for optimizing partial AUC based on a tight convex upper bound

SVMpAUC-tight: A new algorithm for optimizing partial AUC based on a tight convex upper bound Harikrishna Narasimhan and Shivani Agarwal Department of Computer Science and Automation Indian Institute of Science, Bangalore Receiver Operating

1.12k views • 90 slides

Panel Discussion: Achieving Food Security for all Malaysians Venue : Victory Room, Mercu UEM :

Panel Discussion: Achieving Food Security for all Malaysians Venue : Victory Room, Mercu UEM : 2 nd August 2019 Date Achieving Food Security for all Malaysians: Highlights Tan Zhai Gen for Jomo KS and Tan Zhai Gen 2 nd August 2019 +

585 views • 14 slides

DeKaRT: A New Paradigm for DeKaRT: Key-Dependent Reversible Circuits Jovan Goli System on

DeKaRT: A New Paradigm for DeKaRT: Key-Dependent Reversible Circuits Jovan Goli System on Chip, Telecom Italia Lab, Italy CHES 2003, Cologne, Germany 1 Overview Overview 1. Introduction 2. Probing Attacks and Data Scrambling 3. DeKaRT

500 views • 26 slides

Bernstein Bound is Tight Repairing Luykx-Preneel Optimal Forgeries Mridul Nandi Indian

History of WCS Outline Known Security Analysis Our Works Bernstein Bound is Tight Repairing Luykx-Preneel Optimal Forgeries Mridul Nandi Indian Statistical Institute, Kolkata CRYPTO 2018 History of WCS Outline Known Security Analysis Our

834 views • 57 slides