Download presentation
Presentation is loading. Please wait.
Published byBonnie King Modified over 9 years ago
1
Nir Bitansky and Omer Paneth
2
Program Obfuscation
5
Virtual Black-Box -Security: [ Barak-Goldreich-Impagliazzo-Rudich-Sahai-Vadhan-Yang 01]
6
Impossibility of Obfuscation There exist families of functions that cannot be obfuscated [Barak-Goldreich-Impagliazzo-Rudich-Sahai-Vadhan-Yang 01]
7
Relaxed Security -Security: [Barak et al. 01, Goldwasser-Rothblum07, Hofheinz-Malone-Lee-Stam07, Hohenberger-Rothblum-Shelat-Vaikuntanathan07, Bitansky-Canetti10]
8
Relaxed Functionality? -Security:
9
Approximate Obfuscation [ Barak-Goldreich-Impagliazzo-Rudich-Sahai-Vadhan-Yang 01] -Security:
10
Main Result Assuming trapdoor permutations, there exist families of functions that cannot be approximately obfuscated Motivation? Positive applications
11
From Impossibility to Applications Impossibility of approximate obfuscation Non-black-box extraction Zero-knowledge with resettable security Worst-case extractable signatures
12
Plan [BGIRSVY 01]: This work: Impossibility of Obfuscation Impossibility of Approximate Obfuscation Unobfuscatable Functions Robust Unobfuscatable Functions Applications
13
Unobfuscatable Functions From Barak et al.
14
Robust Unobfuscatable Functions
16
RUFs Construction
17
Unobfuscatable Functions Construction of Barak et al. (using FHE for simplicity)
18
Unobfuscatable Functions
19
Black-Box Unlearnability
20
Extraction
21
Robust Extraction?
22
A Taste of the Construction
23
Getting Robustness
26
Construction of RUFs
27
RUFs from trapdoor permutations. Weak RUFs from OWF only: Assumptions
28
Applications
29
Publicly-Verifiable RUOFs
30
Resettably-Sound ZK [Micali-Reyzin 01, Barak-Goldreich-Goldwasser-Lindell 01] Standard ZK Resettable Soundness
31
Resettable Soundness [Micali-Reyzin 01, Barak-Goldreich-Goldwasser-Lindell 01]
32
Resettable Soundness [Micali-Reyzin 01, Barak-Goldreich-Goldwasser-Lindell 01]
33
No Black-Box Simulator Resettable soundnessZero-knowledge (black-box simulator) [Barak-Goldreich-Goldwasser-Lindell 01]
34
Resettably-Sound ZK Resettable soundnessZero-knowledge (non-black-box simulator) [Barak-Goldreich-Goldwasser-Lindell 01, BP 12, Chung-Pass-Seth 13]
35
Resettably-Sound ZK
37
Analysis Resettable soundnessZero-knowledge
38
Resettably-sound ZK from OWFs (Different approach from Chung-Pass-Seth 13) Simultaneously-resettable ZK from OWFs (using srWI by Chung-Ostrovsky-Pass-Visconti 13) 4-message resettably-sound ZK 3-message simultaneously-resettable WI proof of knowledge More Resettable Crypto
39
Digital Signatures: Worst-Case Extractable Signatures
41
Thank You. #define _ -F<00||--F-OO--; int F=00,OO=00;main(){F_OO();printf("%1.3f\n",4.*-F/OO/OO);}F_OO(){ _-_-_-_ _-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_-_-_-_-_ _-_-_-_-_-_-_-_ _-_-_-_ } IOCCC 88
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.