adaptive oblivious transfer and generalization
play

Adaptive Oblivious Transfer And Generalization Olivier Blazy, C - PowerPoint PPT Presentation

Mar 01, 2024 •612 likes •1.51k views

Adaptive Oblivious Transfer And Generalization Olivier Blazy, C eline Chevalier, Paul Germouty December 5, 2016 O. Blazy, C. Chevalier, P . Germouty December 5, 2016 1 / 31 Oblivious Transfer 1 OLBE: A Natural Generalization 2 Adaptive

  1. Adaptive Oblivious Transfer And Generalization Olivier Blazy, C´ eline Chevalier, Paul Germouty December 5, 2016 O. Blazy, C. Chevalier, P . Germouty December 5, 2016 1 / 31

  2. Oblivious Transfer 1 OLBE: A Natural Generalization 2 Adaptive Oblivious Transfer 3 What To Remember 4 O. Blazy, C. Chevalier, P . Germouty December 5, 2016 2 / 31

  3. Oblivious Transfer 1 OLBE: A Natural Generalization 2 Adaptive Oblivious Transfer 3 What To Remember 4 O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 3 / 31

  4. Oblivious Transfer O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 4 / 31

  5. Oblivious Transfer Server DB 1 DB 2 ... DB n O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 4 / 31

  6. Oblivious Transfer Recipient Server Request( i ) DB 1 DB 2 ... DB n O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 4 / 31

  7. Oblivious Transfer Recipient Server Request( i ) DB 1 DB i DB 2 ... DB n O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 4 / 31

  8. Oblivious Transfer Recipient Server Request( i ) DB 1 DB i DB 2 ... DB n Privacy: S shouldn’t know i and R shouldn’t have any information about other lines. O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 4 / 31

  9. Identity Based Encryption O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 5 / 31

  10. Identity Based Encryption Alice O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 5 / 31

  11. Identity Based Encryption Bob Alice O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 5 / 31

  12. Identity Based Encryption mpk , Bob, m → C C Bob Alice O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 5 / 31

  13. Identity Based Encryption mpk , Bob, m → C C Bob Alice usk [ Bob ] , C → m O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 5 / 31

  14. Identity Based Key Encapsulation Mechanism Gen ( param ) : generates ( mpk , msk ) USKGen ( msk , id ) : computes usk [ id ] Enc ( mpk , id ) : encrypts a key K into C Dec ( usk [ id ] , C ) : decrypts C into K O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 6 / 31

  15. UC-framework and Security Model O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 7 / 31

  16. UC-framework and Security Model Ideal functionality vs real world O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 7 / 31

  17. UC-framework and Security Model Ideal functionality vs real world Adaptive corruptions: the adversary can ask for internal state of the recipient at any moment and then play his role. O. Blazy, C. Chevalier, P . Germouty Oblivious Transfer December 5, 2016 7 / 31

  18. Oblivious Transfer 1 OLBE: A Natural Generalization 2 Adaptive Oblivious Transfer 3 What To Remember 4 O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 8 / 31

  19. The Oblivious Signature Based Envelope Protocol Server Info O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 9 / 31

  20. The Oblivious Signature Based Envelope Protocol Recipient Server C =Commit( σ ; ρ ) Info O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 9 / 31

  21. The Oblivious Signature Based Envelope Protocol Recipient Server C =Commit( σ ; ρ ) ⊕ Mask Info Info ⊕ Mask O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 9 / 31

  22. The Oblivious Signature Based Envelope Protocol Recipient Server C =Commit( σ ; ρ ) ⊕ Mask Info Info ⊕ Mask ⊕ Mask Info O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 9 / 31

  23. The Oblivious Signature Based Envelope Protocol Recipient Server C =Commit( σ ; ρ ) ⊕ Mask Info Info ⊕ Mask ⊕ Mask Info Mask computable for the user if and only if C is a commitment of σ O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 9 / 31

  24. How To Do So: Commitment O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 10 / 31

  25. How To Do So: Commitment Commitment: Setup KeyGen Commit Decommit O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 10 / 31

  26. How To Do So: Commitment Commitment: Properties: Setup Extractable KeyGen Equivocable Commit Decommit O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 10 / 31

  27. How To Do So: Commitment Commitment: Properties: Setup Extractable KeyGen Equivocable Commit Decommit Example: Encryption, Chameleon Hash Function: ( KeyGen , CH , Coll ) O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 10 / 31

  28. How To Do So: Commitment Commitment: Properties: Setup Extractable KeyGen Equivocable Commit Decommit Example: Encryption, Chameleon Hash Function: ( KeyGen , CH , Coll ) If CH ( ck , m ; r ) = H then coll ( ck , tk , H ; m ′ ) = r ′ s. t. CH ( ck , m ′ ; r ′ ) = H O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 10 / 31

  29. How To Do So: Smooth Projective Hash Function Functions over a set X and L ⊂ X O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 11 / 31

  30. How To Do So: Smooth Projective Hash Function Functions over a set X and L ⊂ X HashKG ( L , param ) → hk O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 11 / 31

  31. How To Do So: Smooth Projective Hash Function Functions over a set X and L ⊂ X HashKG ( L , param ) → hk ProjKG ( hk , ( L , param ) , W ) → hp O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 11 / 31

  32. How To Do So: Smooth Projective Hash Function Functions over a set X and L ⊂ X HashKG ( L , param ) → hk ProjKG ( hk , ( L , param ) , W ) → hp Hash ( hk , ( L , param ) , W ) → H ∈ G O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 11 / 31

  33. How To Do So: Smooth Projective Hash Function Functions over a set X and L ⊂ X HashKG ( L , param ) → hk ProjKG ( hk , ( L , param ) , W ) → hp Hash ( hk , ( L , param ) , W ) → H ∈ G ProjHash ( hp , ( L , param ) , W, w ) → H ′ ∈ G O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 11 / 31

  34. How To Do So: Smooth Projective Hash Function Functions over a set X and L ⊂ X HashKG ( L , param ) → hk ProjKG ( hk , ( L , param ) , W ) → hp Hash ( hk , ( L , param ) , W ) → H ∈ G ProjHash ( hp , ( L , param ) , W, w ) → H ′ ∈ G Hash ( hk , ( L , param ) , W ) = ProjHash ( hp , ( L , param ) , W, w ) . If w is a witness for W ∈ L . O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 11 / 31

  35. Properties Of SPHF Smoothness: If W / ∈ L nobody can distinguish a hashed value from a random one. O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 12 / 31

  36. Properties Of SPHF Smoothness: If W / ∈ L nobody can distinguish a hashed value from a random one. Pseudo-Randomness: Without w , if W ∈ L it is hard to distinguish a hashed value from a random one. O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 12 / 31

  37. A Simple Example Of SPHF Here param contains ( g, h ) ∈ G O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 13 / 31

  38. A Simple Example Of SPHF Here param contains ( g, h ) ∈ G L = { ( g 1 , h 1 ) |∃ α ∈ Z p , g 1 = g α ∧ h 1 = h α } , w = α . O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 13 / 31

  39. A Simple Example Of SPHF Here param contains ( g, h ) ∈ G L = { ( g 1 , h 1 ) |∃ α ∈ Z p , g 1 = g α ∧ h 1 = h α } , w = α . hk = ( λ, µ ) ∈ Z 2 p O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 13 / 31

  40. A Simple Example Of SPHF Here param contains ( g, h ) ∈ G L = { ( g 1 , h 1 ) |∃ α ∈ Z p , g 1 = g α ∧ h 1 = h α } , w = α . hk = ( λ, µ ) ∈ Z 2 p hp = g λ h µ O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 13 / 31

  41. A Simple Example Of SPHF Here param contains ( g, h ) ∈ G L = { ( g 1 , h 1 ) |∃ α ∈ Z p , g 1 = g α ∧ h 1 = h α } , w = α . hk = ( λ, µ ) ∈ Z 2 p hp = g λ h µ 1 h µ H = g λ 1 O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 13 / 31

  42. A Simple Example Of SPHF Here param contains ( g, h ) ∈ G L = { ( g 1 , h 1 ) |∃ α ∈ Z p , g 1 = g α ∧ h 1 = h α } , w = α . hk = ( λ, µ ) ∈ Z 2 p hp = g λ h µ 1 h µ H = g λ 1 H ′ = hp α O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 13 / 31

  43. SPHF And Implicit Decommitment Achieving OSBE Server Info O. Blazy, C. Chevalier, P . Germouty OLBE: A Natural Generalization December 5, 2016 14 / 31

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Adaptive Garbled RAM from Adaptive Garbled RAM from Laconic Oblivious Transfer Sanjam Garg

Adaptive Garbled RAM from Adaptive Garbled RAM from Laconic Oblivious Transfer Sanjam Garg

Adaptive Garbled RAM from Adaptive Garbled RAM from Laconic Oblivious Transfer Sanjam Garg Sanjam Garg Rafail Ostrovsky Rafail Ostrovsky Akshayaram Srinivasan Akshayaram Srinivasan UC Berkeley UCLA UC Berkeley Crypto 2018 Garbled RAM

323 views • 20 slides
A Framework for Efficient and Composable Oblivious Transfer Chris Peikert 1 Vinod Vaikuntanathan

A Framework for Efficient and Composable Oblivious Transfer Chris Peikert 1 Vinod Vaikuntanathan

A Framework for Efficient and Composable Oblivious Transfer Chris Peikert 1 Vinod Vaikuntanathan 2 Brent Waters 1 1 SRI International 2 MIT CRYPTO 2008 1 / 10 Oblivious Transfer [R81,EGL85,BCR86,C87,K88,CK88,C89,CS91,CGT95,DCP95,FMR96,BC97,. .

1.02k views • 50 slides
Generic Construction of UC-Secure Oblivious Transfer O. Blazy , C.Chevalier O. Blazy (Xlim)

Generic Construction of UC-Secure Oblivious Transfer O. Blazy , C.Chevalier O. Blazy (Xlim)

Generic Construction of UC-Secure Oblivious Transfer O. Blazy , C.Chevalier O. Blazy (Xlim) Generic OT 1 / 20 Global Framework 1 Cryptographic Tools 2 1-out-of- t Oblivious Transfer 3 Instantiation 4 Conclusion 5 O. Blazy (Xlim)

852 views • 45 slides
ON THE FEASIBILITY OF EXTENDING OBLIVIOUS TRANSFER Yehuda Lindell Yehuda Lindell Hila Zarosim

ON THE FEASIBILITY OF EXTENDING OBLIVIOUS TRANSFER Yehuda Lindell Yehuda Lindell Hila Zarosim

ON THE FEASIBILITY OF EXTENDING OBLIVIOUS TRANSFER Yehuda Lindell Yehuda Lindell Hila Zarosim Hila Zarosim TCC 2013 Obli i Oblivious Transfer T f The other message message remains secret to the the receiver Obli i Oblivious

757 views • 38 slides
SFE: Yaos Garbled Circuit Oblivious Transfer IDEAL World Pick one out of two, without

SFE: Yaos Garbled Circuit Oblivious Transfer IDEAL World Pick one out of two, without

SFE: Yaos Garbled Circuit Oblivious Transfer IDEAL World Pick one out of two, without revealing which Intuitive property: OT transfer partial A:up, B:down A up I need just information All 2 of one them! But cant

432 views • 20 slides
Constant-Rate Oblivious Transfer from Noisy Channels Yuval I shai Eyal K ushilevitz Rafail O

Constant-Rate Oblivious Transfer from Noisy Channels Yuval I shai Eyal K ushilevitz Rafail O

Constant-Rate Oblivious Transfer from Noisy Channels Yuval I shai Eyal K ushilevitz Rafail O strovsky Manoj P rabhakaran Amit S ahai Jrg W ullschleger Tuesday, August 23, 2011 Constant-Rate Oblivious Transfer from Noisy Channels Yuval I shai

1.25k views • 95 slides
Optimistic Fair Priced Oblivious Transfer A. Rial B. Preneel Katholieke Universiteit Leuven -

Optimistic Fair Priced Oblivious Transfer A. Rial B. Preneel Katholieke Universiteit Leuven -

Motivation Efficient Priced Oblivious Transfer Optimistic Fair POT Optimistic Fair Priced Oblivious Transfer A. Rial B. Preneel Katholieke Universiteit Leuven - ESAT-COSIC IBBT Africacrypt 2010 A. Rial Optimistic Fair POT Motivation

1.08k views • 78 slides
Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Hong-Sheng

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Hong-Sheng

Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Hong-Sheng Zhou University of Connecticut Joint work with Juan Garay (AT&T) and Daniel Wichs (NYU) CRYPTO 2009 Outline Background New Approach

789 views • 36 slides
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries Gilad

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries Gilad

More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries Gilad Asharov Hebrew University Yehuda Lindell Bar-Ilan University Thomas Schneider Darmstadt Michael Zohner Darmstadt EUROCRYPT 2015 From Theory to

498 views • 37 slides
The Simplest Protocol for Oblivious Transfer Tung Chou Technische Universiteit Eindhoven, The

The Simplest Protocol for Oblivious Transfer Tung Chou Technische Universiteit Eindhoven, The

The Simplest Protocol for Oblivious Transfer Tung Chou Technische Universiteit Eindhoven, The Netherlands August 24, 2015 Latincrypt 2015, Guadalajara, Mexico Joint work with Claudio Orlandi 2 OTs 1 Sender Receiver 2 OTs

930 views • 28 slides
k -Round Multiparty Computation from k -Round Oblivious Transfer via Garbled Interactive Circuits

k -Round Multiparty Computation from k -Round Oblivious Transfer via Garbled Interactive Circuits

k -Round Multiparty Computation from k -Round Oblivious Transfer via Garbled Interactive Circuits Fabrice Benhamouda Huijia (Rachel) Lin IBM Research / Columbia University, US University of California, Santa Barbara, US Eurocrypt 2018, May 1,

1.03k views • 85 slides
Experimental realisation of quantum oblivious transfer Ryan Amiri 1 , Robert Strek 2 , Michal

Experimental realisation of quantum oblivious transfer Ryan Amiri 1 , Robert Strek 2 , Michal

Experimental realisation of quantum oblivious transfer Ryan Amiri 1 , Robert Strek 2 , Michal Miuda 2 , Ladislav Mita 2 , Jr., Miloslav Duek 2 , Petros Wallden 3 , and Erika Andersson 1 1 SUPA, Institute of Photonics and Quantum Sciences,

752 views • 29 slides
Two Round Oblivious Transfer from CDH or LPN Eurocrypt 2020 Nico Dttling Sanjam Garg Mohammad

Two Round Oblivious Transfer from CDH or LPN Eurocrypt 2020 Nico Dttling Sanjam Garg Mohammad

Two Round Oblivious Transfer from CDH or LPN Eurocrypt 2020 Nico Dttling Sanjam Garg Mohammad Hajiabadi Daniel Masny Daniel Wichs CISPA Helmholtz Center for Information Security UC Berkeley Visa Research Northeastern University

425 views • 13 slides
July 23, 2016 STM 2016 Outline Background Additively homomorphic encryption Beacon

July 23, 2016 STM 2016 Outline Background Additively homomorphic encryption Beacon

July 23, 2016 STM 2016 Outline Background Additively homomorphic encryption Beacon search by Oblivious transfer Genome sequence search Overview of the proposed method Recursive oblivious transfer Burrows Wheeler

974 views • 70 slides
Verifiable Homomorphic Oblivious Transfer and Private Equality Test Helger Lipmaa Helsinki

Verifiable Homomorphic Oblivious Transfer and Private Equality Test Helger Lipmaa Helsinki

Verifiable Homomorphic Oblivious Transfer and Private Equality Test Helger Lipmaa Helsinki University of Technology http://www.tcs.hut.fi/helger Asiacrypt 2003, 03.12.2003 Verifiable Homomorphic OT and PET, Helger Lipmaa 1 Overview of

891 views • 29 slides
Statistical Zaps and New Oblivious Transfer Protocols Vipul Goyal Abhishek Jain Zhengzhong Jin

Statistical Zaps and New Oblivious Transfer Protocols Vipul Goyal Abhishek Jain Zhengzhong Jin

1 Statistical Zaps and New Oblivious Transfer Protocols Vipul Goyal Abhishek Jain Zhengzhong Jin Giulio Malavolta Carnegie Mellon University Carnegie Mellon Johns Hopkins Johns Hopkins University of California, University University

1.66k views • 128 slides
The generalized correlated sampling approach: toward an exact calculation of energy derivatives

The generalized correlated sampling approach: toward an exact calculation of energy derivatives

The generalized correlated sampling approach 9 avril 2008 1 de 44 Plan Introduction The generalized correlated sampling approach: toward an exact calculation of energy derivatives in Diffusion Monte Carlo Roland Assaraf a ,Alexander Kollias b

570 views • 53 slides
Liberty Mutual Group PEBELS: Policy Exposure Based Excess Loss Smoothing Marquis J. Moehring

Liberty Mutual Group PEBELS: Policy Exposure Based Excess Loss Smoothing Marquis J. Moehring

Liberty Mutual Group PEBELS: Policy Exposure Based Excess Loss Smoothing Marquis J. Moehring Outline 1. Background 2. Goal 3. PEBELS Defined 4. PEBELS Derived (PPR Generalized) 5. Applications 6. Summary Liberty Mutual Insurance My

614 views • 33 slides
Robustness and Generalization Huan Xu The University of Texas at Austin Department of Electrical

Robustness and Generalization Huan Xu The University of Texas at Austin Department of Electrical

Robustness and Generalization Huan Xu The University of Texas at Austin Department of Electrical and Computer Engineering COLT, June 29, 2010 Joint work with Shie Mannor What is Robustness? What is Robustness? What is Robustness?

571 views • 53 slides
Language as an Abstraction for Hierarchical Deep Reinforcement Learning Paper Authors: Yiding

Language as an Abstraction for Hierarchical Deep Reinforcement Learning Paper Authors: Yiding

Language as an Abstraction for Hierarchical Deep Reinforcement Learning Paper Authors: Yiding Jiang, Shixiang Gu, Kevin Murphy, Chelsea Finn Problem Overview Learning a variety of compositional , long horizon skills while being able to

364 views • 34 slides
Generalization of Factor Graphs and Belief Propagation for Quantum Information Science

Generalization of Factor Graphs and Belief Propagation for Quantum Information Science

Generalization of Factor Graphs and Belief Propagation for Quantum Information Science End-of-First-Year Oral Exam Michael X. CAO Department of Information Engineering, CUHK September 25, 2015 Michael X. CAO (IE@CUHK) Quantum Factor Graph

1.45k views • 121 slides
On the Generalization of Dedekind Modules Indah Emilia Wijayanti Department of Mathematics,

On the Generalization of Dedekind Modules Indah Emilia Wijayanti Department of Mathematics,

On the Generalization of Dedekind Modules Indah Emilia Wijayanti Department of Mathematics, Universitas Gadjah Mada Sekip Utara, Yogyakarta, Indonesia International Congress Rings, modules, and Hopf algebras On the occasion of Blas

773 views • 26 slides
FROM FINITELY GENERATED PROJECTIVE MODULES TO A GENERALIZATION OF SERRE-SWAN-MALLIOS THEOREM

FROM FINITELY GENERATED PROJECTIVE MODULES TO A GENERALIZATION OF SERRE-SWAN-MALLIOS THEOREM

FROM FINITELY GENERATED PROJECTIVE MODULES TO A GENERALIZATION OF SERRE-SWAN-MALLIOS THEOREM Mart Abel University of Tartu J. P. Serre, Modules projectifs et espaces fibr es ` a fibre vectorielle, S` eminaire Dubreil-Pisot 1957/58, 23 ,

930 views • 80 slides
Understanding Deep Learning Nati Srebro (TTIC) Based on joint work with Behnam Neyshabur (TTIC

Understanding Deep Learning Nati Srebro (TTIC) Based on joint work with Behnam Neyshabur (TTIC

Implicit Optimization Bias as a key to Understanding Deep Learning Nati Srebro (TTIC) Based on joint work with Behnam Neyshabur (TTIC IAS), Ryota Tomioka (TTIC MSR), Srinadh Bhojanapalli, Suriya Gunasekar, Blake Woodworth, Pedro Savarese

395 views • 27 slides

More recommend