functional encryption deterministic
play

Functional Encryption: Deterministic to Randomized Functions from - PowerPoint PPT Presentation

Sep 13, 2023 β€’472 likes β€’1.47k views

Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions Shashank Agrawal David J. Wu Public-Key Functional Encryption [BSW11, ON10] () Keys are associated with deterministic functions sk

  1. Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions Shashank Agrawal David J. Wu

  2. Public-Key Functional Encryption [BSW11, O’N10] 𝑦 𝑔(𝑦) Keys are associated with deterministic functions 𝑔 sk 𝑔

  3. Public-Key Functional Encryption [BSW11, O’N10] 𝑦 𝑔(𝑦) Keys are associated with deterministic functions 𝑔 sk 𝑔 𝑛 sk 𝑔

  4. Public-Key Functional Encryption [BSW11, O’N10] 𝑦 𝑔(𝑦) Keys are associated with deterministic functions 𝑔 sk 𝑔 𝑔(𝑛) Decrypt(sk 𝑔 , ct 𝑛 ) 𝑛 sk 𝑔

  5. Public-Key Functional Encryption [BSW11, O’N10] Setup 1 πœ‡ : Outputs (msk, mpk) β€’ eyGen(msk, 𝑔) : Outputs decryption key sk 𝑔 β€’ Encrypt mpk, 𝑛 : Outputs ciphertext ct 𝑛 β€’ Decrypt(sk 𝑔 , ct 𝑛 ) : Outputs 𝑔 𝑛

  6. Public-Key Functional Encryption [BSW11, O’N10] k 𝑔 𝑔𝑔 k 𝑔 k 𝑔 𝑙𝑑 𝑧𝑓𝑙 π‘œπ‘π‘—π‘’π‘žπ‘§π‘ π‘‘π‘“π‘’ π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ ∢ 𝑔𝑔) , ksm(neGyeSetup 1 πœ‡ : Outputs (msk, mpk) β€’ KeyGen(msk, 𝑔) : Outputs decryption key sk 𝑔 β€’ Encrypt mpk, 𝑛 : Outputs ciphertext ct 𝑛 β€’ Decrypt(sk 𝑔 , ct 𝑛 ) : Outputs 𝑔 𝑛

  7. Public-Key Functional Encryption [BSW11, O’N10] ct 𝑛 ct 𝑛 𝑛𝑛𝑒 ct 𝑛 𝑑 π‘’π‘¦π‘“π‘’π‘ π‘“β„Žπ‘žπ‘—π‘‘ π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ 𝑛𝑛 mpk, 𝑛 ∢ , π‘™π‘ž mpk, 𝑛 π‘›π‘’π‘žπ‘§π‘ π‘‘π‘œ k 𝑔 𝑔𝑔 k 𝑔 k 𝑔 𝑙𝑑 𝑧𝑓𝑙 π‘œπ‘π‘—π‘’π‘žπ‘§π‘ π‘‘π‘“π‘’ π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ ∢ 𝑔𝑔) , ksm(neGyeSetup 1 πœ‡ : Outputs (msk, mpk) β€’ KeyGen(msk, 𝑔) : Outputs decryption key sk 𝑔 β€’ Encrypt mpk, 𝑛 : Outputs ciphertext ct 𝑛 β€’ Encrypt mpk, 𝑛 : Outputs ciphertext ct 𝑛

  8. Public-Key Functional Encryption [BSW11, O’N10] 𝑔𝑔 𝑛 𝑛𝑛 𝑛 π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ ∢ t 𝑛 𝑛𝑛 t 𝑛 ) t 𝑛 𝑒𝑑 k 𝑔 𝑔𝑔 k 𝑔 , k 𝑔 𝑙𝑑(π‘’π‘žπ‘§π‘ π‘‘π‘“ ct 𝑛 ct 𝑛 𝑛𝑛𝑒 ct 𝑛 𝑑 π‘’π‘¦π‘“π‘’π‘ π‘“β„Žπ‘žπ‘—π‘‘ π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ 𝑛𝑛 mpk, 𝑛 ∢ , π‘™π‘ž mpk, 𝑛 π‘›π‘’π‘žπ‘§π‘ π‘‘π‘œ k 𝑔 𝑔𝑔 k 𝑔 k 𝑔 𝑙𝑑 𝑧𝑓𝑙 π‘œπ‘π‘—π‘’π‘žπ‘§π‘ π‘‘π‘“π‘’ π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ ∢ 𝑔𝑔) , ksm(neGyeSetup 1 πœ‡ : Outputs (msk, mpk) β€’ KeyGen(msk, 𝑔) : Outputs decryption key sk 𝑔 β€’ Encrypt mpk 𝑛 : Outputs ciphertext ct

  9. Public-Key Functional Encryption [BSW11, O’N10] 𝑔𝑔 𝑛 𝑛𝑛 𝑛 π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ ∢ t 𝑛 𝑛𝑛 t 𝑛 ) t 𝑛 𝑒𝑑 k 𝑔 𝑔𝑔 k 𝑔 , k 𝑔 𝑙𝑑(π‘’π‘žπ‘§π‘ π‘‘π‘“π‘”π‘” 𝑛 𝑛𝑛 𝑛 π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ ∢ t 𝑛 𝑛𝑛 t 𝑛 ) t 𝑛 𝑒𝑑 k 𝑔 𝑔𝑔 k 𝑔 , k 𝑔 𝑙𝑑(π‘’π‘žπ‘§π‘ π‘‘π‘“ ct 𝑛 ct 𝑛 𝑛𝑛𝑒 ct 𝑛 𝑑 π‘’π‘¦π‘“π‘’π‘ π‘“β„Žπ‘žπ‘—π‘‘ π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ 𝑛𝑛 mpk, 𝑛 ∢ , π‘™π‘ž mpk, 𝑛 π‘›π‘’π‘žπ‘§π‘ π‘‘π‘œ k 𝑔 𝑔𝑔 k 𝑔 k 𝑔 𝑙𝑑 𝑧𝑓𝑙 π‘œπ‘π‘—π‘’π‘žπ‘§π‘ π‘‘π‘“π‘’ π‘‘π‘’π‘£π‘žπ‘’π‘£π‘ƒ ∢ 𝑔𝑔) , ksm(neGyeSetup 1 πœ‡ : Outputs (msk, mpk)

  10. Public-Key Functional Encryption [BSW11, O’N10] β€’ Setup 1 πœ‡ : Outputs (msk, mpk) β€’ KeyGen(msk, 𝑔) : Outputs decryption key sk 𝑔 β€’ Encrypt mpk, 𝑛 : Outputs ciphertext ct 𝑛 Deterministic function 𝑔 β€’ Decrypt(sk 𝑔 , ct 𝑛 ) : Outputs 𝑔 𝑛

  11. Functional Encryption for Randomized Functionalities (rFE) [ABFGGTW13, GJKS15] 𝑠 𝑦 But what if 𝑔 is 𝑔(𝑦 ; 𝑠) randomized ? Many interesting functions are randomized

  12. Application 1: Proxy Re-Encryption Alice

  13. Application 1: Proxy Re-Encryption Alice

  14. Application 1: Proxy Re-Encryption personal email Alice Alice

  15. Application 1: Proxy Re-Encryption personal email Alice Alice work email Secretary

  16. Application 1: Proxy Re-Encryption personal email Alice Alice work email Mail server has functional key to re-encrypt message under Secretary secretary’s public key

  17. Application 2: Auditing an Encrypted Database

  18. Application 2: Auditing an Encrypted Database Encrypted database of records 𝑠 𝑠 2 𝑠 3 𝑠 𝑠 5 𝑠 6 1 4

  19. Application 2: Auditing an Encrypted Database Encrypted database of records 𝑠 𝑠 2 𝑠 3 𝑠 𝑠 5 𝑠 6 1 4 Sample a random subset to audit

  20. Application 2: Auditing an Encrypted Database Encrypted database of records 𝑠 𝑠 2 𝑠 3 𝑠 𝑠 5 𝑠 6 1 4 Sample a random 𝑠 2 𝑠 6 subset to audit

  21. Does Public-Key rFE Exist?

  22. Does Public-Key rFE Exist? [GJKS15] General- iO Purpose rFE (selectively secure)

  23. Public-Key Functional Encryption [BSW11, O’N10] Can be instantiated from a wide range of assumptions

  24. Public-Key Functional Encryption [BSW11, O’N10] Can be instantiated from a wide range of assumptions [SS10, GVW12, GKPVZ13, …] Bounded- PKE / LWE Collusion FE

  25. Public-Key Functional Encryption [BSW11, O’N10] Can be instantiated from a wide range of assumptions [SS10, GVW12, GKPVZ13, …] Bounded- PKE / LWE Collusion FE [GGHRSW13, Wat15, GGHZ16, …] Multilinear General- Maps / iO Purpose FE

  26. The Landscape of (Public-Key) Functional Encryption Deterministic functionalities [SS10, GVW12, …] Bounded- PKE / LWE Collusion FE [GGHRSW13, GGHZ16, … ] Multilinear General- Maps / iO Purpose FE Generally adaptively secure

  27. The Landscape of (Public-Key) Functional Encryption Deterministic functionalities Randomized functionalities [SS10, GVW12, …] Bounded- PKE / LWE [GJKS15] Collusion FE General- iO [GGHRSW13, GGHZ16, … ] Purpose rFE Multilinear General- Maps / iO Purpose FE Generally adaptively Selectively secure secure

  28. The Landscape of (Public-Key) Functional Encryption PKE / LWE Does extending FE to support General- randomized functionalities require Purpose rFE much stronger tools? Multilinear Maps / iO

  29. Our Main Result General-purpose FE for deterministic functionalities

  30. Our Main Result General-purpose FE General-purpose FE Number Theory for deterministic for randomized functionalities functionalities (e.g., DDH, RSA)

  31. Our Main Result General-purpose FE General-purpose FE Number Theory for deterministic for randomized functionalities functionalities (e.g., DDH, RSA) Implication : randomized FE is not much more difficult to construct than standard FE.

  32. Defining rFE

  33. Correctness for FE Deterministic functions

  34. Correctness for FE Deterministic functions 𝑛 sk 𝑔

  35. Correctness for FE Deterministic functions 𝑛 𝑔(𝑛) Decrypt(sk 𝑔 , ct 𝑛 ) sk 𝑔

  36. Correctness for rFE [ABFGGTW13, GJKS15] Randomized functions

  37. Correctness for rFE [ABFGGTW13, GJKS15] Randomized functions 𝑛 sk 𝑔

  38. Correctness for rFE [ABFGGTW13, GJKS15] Randomized functions 𝑛 𝑔(𝑛 ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 ) sk 𝑔

  39. Correctness for rFE [ABFGGTW13, GJKS15] Randomized functions 𝑛 𝑔(𝑛 ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 ) sk 𝑔 𝑛 β€² Different ciphertexts

  40. Correctness for rFE [ABFGGTW13, GJKS15] Randomized functions 𝑛 𝑔(𝑛 ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 ) sk 𝑔 𝑛 β€² sk 𝑔 Different Same function ciphertexts key

  41. Correctness for rFE [ABFGGTW13, GJKS15] Randomized functions 𝑛 𝑔(𝑛 ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 ) sk 𝑔 𝑛 β€² 𝑔(𝑛 β€² ; 𝑠′) Decrypt(sk 𝑔 , ct 𝑛 β€² ) sk 𝑔 Independent draws Different Same function from output ciphertexts key distribution

  42. Correctness for rFE [ABFGGTW13, GJKS15] Randomized functions 𝑛 𝑔(𝑛 ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 ) sk 𝑔 𝑛 𝑔 β€² (𝑛 ; 𝑠 β€² ) Decrypt(sk 𝑔 β€² , ct 𝑛 ) sk 𝑔 β€² Independent draws Same Different from output ciphertexts function keys distribution

  43. Simulation-Based Security (Informally) msk sk 𝑔 𝑔 Real World: honestly generated ciphertexts 𝑛 and secret keys 𝑛

  44. Simulation-Based Security (Informally) msk sk 𝑔 𝑔 Real World: honestly generated ciphertexts 𝑛 and secret keys 𝑛 𝑔 Ideal World: sk 𝑔 simulated ciphertexts and secret keys 𝑔(𝑛) 𝑛

  45. The Case for Malicious Encrypters [GJKS15] Encrypted database of records 𝑠 𝑠 2 𝑠 3 𝑠 𝑠 5 𝑠 6 1 4 Sample a random 𝑠 2 𝑠 6 subset to audit

  46. The Case for Malicious Encrypters [GJKS15] Encrypted database of records 𝑠 𝑠 2 𝑠 3 𝑠 𝑠 5 𝑠 6 1 4 What if encrypter (bank) is adversarial? Sample a random 𝑠 2 𝑠 6 subset to audit

  47. The Case for Malicious Encrypters [GJKS15] Randomized functionalities 𝑛 𝑔(𝑛 ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 ) sk 𝑔 𝑛 β€² 𝑔(𝑛 β€² ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 β€² ) sk 𝑔 Dishonest encrypters can construct β€œbad” ciphertexts such that decryption produces correlated outputs

  48. The Case for Malicious Encrypters [GJKS15] Randomized functionalities 𝑛 𝑔(𝑛 ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 ) sk 𝑔 𝑛 β€² 𝑔(𝑛 β€² ; 𝑠) Decrypt(sk 𝑔 , ct 𝑛 β€² ) sk 𝑔 Formally captured by giving adversary access to a decryption oracle (like in the CCA-security game). [See paper for details.]

  49. Our Generic Transformation

Recommend

Functional Encryption Lecture 27 Functional Encryption Plain encryption: for secure

Functional Encryption Lecture 27 Functional Encryption Plain encryption: for secure

Functional Encryption Lecture 27 Functional Encryption Plain encryption: for secure communication. Does not allow modifying encrypted data. Homomorphic Encryption: allows computation on encrypted data, but result remains encrypted Functional

987 views β€’ 61 slides
Functional Encryption Lecture 23 ABE from LWE Functional

Functional Encryption Lecture 23 ABE from LWE Functional

Functional Encryption Lecture 23 ABE from LWE Functional Encryption f g h KeyGen PK SK SK f PK f(x) Dec SK g x g(x) Enc Dec Ciphertext SK h h(x) Dec Index-Payload Functions Message x=(

168 views β€’ 13 slides
Functional Encryption for Regular Languages Brent Waters Public Key Encryption

Functional Encryption for Regular Languages Brent Waters Public Key Encryption

Functional Encryption for Regular Languages Brent Waters Public Key Encryption [DH76,M78,RSA78,GM84] Avoid Prior Secret Exchange PubK SK 2 Functional Encryption [SW05] Functionality: f( , ) MSK Authority Key: y 2 {0,1}* y SK CT: x

945 views β€’ 16 slides
Functional Encryption from Pairings Michel Abdalla, CNRS and ENS Romain Gay, ENS Mariana

Functional Encryption from Pairings Michel Abdalla, CNRS and ENS Romain Gay, ENS Mariana

Multi-input Inner-Product Functional Encryption from Pairings Michel Abdalla, CNRS and ENS Romain Gay, ENS Mariana Raykova, Yale University Hoeteck Wee, CNRS and ENS Functional Encryption [Boneh, Sahai, Waters 11] m Alice Functional

585 views β€’ 40 slides
Two-Client and Multi-client Functional Encryption for Set Intersection and Variants Tim van de

Two-Client and Multi-client Functional Encryption for Set Intersection and Variants Tim van de

Two-Client and Multi-client Functional Encryption for Set Intersection and Variants Tim van de Kamp David Stritzl Willem Jonker Andreas Peter ACISP 2019 Functional Encryption for Set Operations n evaluate i = 1 S i S 1 S 2 S n

707 views β€’ 32 slides
SYMMETRIC ENCRYPTION K is randomized E can be randomized or stateful D is deterministic

SYMMETRIC ENCRYPTION K is randomized E can be randomized or stateful D is deterministic

Syntax A symmetric encryption scheme SE = ( K , E , D ) consists of three algorithms: SYMMETRIC ENCRYPTION K is randomized E can be randomized or stateful D is deterministic 1 / 116 2 / 116 Correct decryption requirement Example:

430 views β€’ 29 slides
Unbounded Inner Product Functional Encryption, with Succinct Keys Edouard Dufour Sans and David

Unbounded Inner Product Functional Encryption, with Succinct Keys Edouard Dufour Sans and David

Unbounded Inner Product Functional Encryption, with Succinct Keys Edouard Dufour Sans and David Pointcheval Ecole Normale Sup erieure INRIA June 6, 2019 Table of Contents Background Functional Encryption ABDP Applications of Inner

970 views β€’ 51 slides
Inner Product Functional Encryption Edouard Dufour Sans January 25, 2018 Table of Contents

Inner Product Functional Encryption Edouard Dufour Sans January 25, 2018 Table of Contents

Inner Product Functional Encryption Edouard Dufour Sans January 25, 2018 Table of Contents Introduction Functional Encryption Security definitions Notations The Power of Inner Products Descriptive statistics Machine Learning Practical

930 views β€’ 65 slides
On ELFs, Deterministic Encryption, and Correlated Input Security

On ELFs, Deterministic Encryption, and Correlated Input Security

On ELFs, Deterministic Encryption, and Correlated Input Security Mark Zhandry Princeton University mommy > daddy In reality = = pk c = Enc(pk,mommy > daddy) sk Random

568 views β€’ 27 slides
How to Encipher Messages on a Small Domain Deterministic Encryption and the Thorp Shuffle Ben

How to Encipher Messages on a Small Domain Deterministic Encryption and the Thorp Shuffle Ben

How to Encipher Messages on a Small Domain Deterministic Encryption and the Thorp Shuffle Ben Morris Phil Rogaway Till Stegers University of California, Davis University of California, Davis Dept of Mathematics Dept of Computer

1.01k views β€’ 25 slides
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption Gilad Asharov

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption Gilad Asharov

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption Gilad Asharov Gil Segev Hebrew University This Talk A framework for proving impossibility results for commonly-used non-black-box techniques Limits on

596 views β€’ 22 slides
Simple Functional Encryption Schemes for Inner Products Michel Abdalla ( B ) , Florian Bourse,

Simple Functional Encryption Schemes for Inner Products Michel Abdalla ( B ) , Florian Bourse,

Simple Functional Encryption Schemes for Inner Products Michel Abdalla ( B ) , Florian Bourse, Angelo De Caro, and David Pointcheval ENS, CNRS, INRIA, and PSL, 45 Rue dUlm, 75230 Paris Cedex 05, France {

535 views β€’ 19 slides
SYMMETRIC ENCRYPTION Mihir Bellare UCSD 1 Syntax A symmetric encryption scheme SE = ( K , E , D

SYMMETRIC ENCRYPTION Mihir Bellare UCSD 1 Syntax A symmetric encryption scheme SE = ( K , E , D

SYMMETRIC ENCRYPTION Mihir Bellare UCSD 1 Syntax A symmetric encryption scheme SE = ( K , E , D ) consists of three algorithms: K and E may be randomized, but D must be deterministic. Mihir Bellare UCSD 2 Correct decryption requirement More

1.19k views β€’ 53 slides
Secure storage in the cloud using property preserving encryption Kenny Paterson Information

Secure storage in the cloud using property preserving encryption Kenny Paterson Information

Secure storage in the cloud using property preserving encryption Kenny Paterson Information Security Group Overview 1. Application scenarios. 2. Deterministic encryption and search. 3. OPE/ORE and range queries. 4. Analysing access pattern

877 views β€’ 48 slides
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation (iO) from

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation (iO) from

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation (iO) from Degree-5 Multilinear maps Prabhanjan Ananth Amit Sahai Constructions of iO All current constructions of iO are based on multilinear maps [GGHRSW13,

649 views β€’ 39 slides
Some applications and protocols Internet Casino Identity-based encryption Commitment

Some applications and protocols Internet Casino Identity-based encryption Commitment

Some applications and protocols Internet Casino Identity-based encryption Commitment Functional encryption Shared coin flips Fully-homomorphic encryption APPLICATIONS AND PROTOCOLS Threshold cryptography Searchable

399 views β€’ 11 slides
Simple Functional Encryption Schemes for Inner Products Michel Abdalla, Florian Bourse, Angelo De

Simple Functional Encryption Schemes for Inner Products Michel Abdalla, Florian Bourse, Angelo De

Overview of the results The Framework Work in progress Simple Functional Encryption Schemes for Inner Products Michel Abdalla, Florian Bourse, Angelo De Caro, and David Pointcheval Ecole normale sup erieure, CNRS, INRIA, PSL, Paris,

866 views β€’ 71 slides
Partially Encrypted Machine Learning using Functional Encryption eo Ryffel 1,2 Edouard Dufour-Sans

Partially Encrypted Machine Learning using Functional Encryption eo Ryffel 1,2 Edouard Dufour-Sans

Partially Encrypted Machine Learning using Functional Encryption eo Ryffel 1,2 Edouard Dufour-Sans 1 Romain Gay 1,3 Th Francis Bach 2,1 David Pointcheval 1,2 1 Ecole Normale Sup erieure 2 INRIA 3 UC Berkeley August 18, 2019 Table of

418 views β€’ 38 slides
Functional Encryption for Inner Product with Full Function Privacy by Sourav Mukhopadhyay joint

Functional Encryption for Inner Product with Full Function Privacy by Sourav Mukhopadhyay joint

Functional Encryption for Inner Product with Full Function Privacy by Sourav Mukhopadhyay joint work with Pratish Datta and Ratna Dutta Department of Mathematics Indian Institute of Technology Kharagpur Kharagpur-721302 India PKC 2016

340 views β€’ 23 slides
Introduction to Authenticated Encryption Tom Shrimpton Summer School on Real-World Crypto and

Introduction to Authenticated Encryption Tom Shrimpton Summer School on Real-World Crypto and

(A brief, incomplete) Introduction to Authenticated Encryption Tom Shrimpton Summer School on Real-World Crypto and Privacy June 11, 2018 Authenticated Encryption M M Its complicated Probabilistic or deterministic AE? Nonce based AE?

868 views β€’ 47 slides
Dynamic Decentralized Functional Encryption Jrmy Chotard, Edouard Dufour Sans , Romain Gay,

Dynamic Decentralized Functional Encryption Jrmy Chotard, Edouard Dufour Sans , Romain Gay,

Dynamic Decentralized Functional Encryption Jrmy Chotard, Edouard Dufour Sans , Romain Gay, Duong Hieu Phan, and David Pointcheval CRYPTO 2020, Monday August 17th 2020 The technological landscape of the early 21st century Lots of data. +

667 views β€’ 48 slides
Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and

Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and

Multi-Input Functional Encryption for Inner Products: Function-Hiding Realizations and Constructions without Pairings Michel Abdalla Dario Catalano Dario Fiore Romain Gay Bogdan Ursu August 21, 2018 August 21, 2018 1 / 30 Motivation - Spam

552 views β€’ 31 slides
Robust Transforming Combiners from iO to Functional Encryption Prabhanjan Ananth Aayush Jain

Robust Transforming Combiners from iO to Functional Encryption Prabhanjan Ananth Aayush Jain

Robust Transforming Combiners from iO to Functional Encryption Prabhanjan Ananth Aayush Jain Amit Sahai Since 2013 Two-Round (Adaptive) Multi-Party Computation Instantiating Random Oracles Non-Interactive Multi-party Key

1.33k views β€’ 111 slides
Extracting non-deterministic concurrent programs Ulrich Berger Swansea University CSL 2016

Extracting non-deterministic concurrent programs Ulrich Berger Swansea University CSL 2016

Extracting non-deterministic concurrent programs Ulrich Berger Swansea University CSL 2016 August 30, Marseille 1 / 22 Overview Non-deterministic and concurrent extensions of functional programming languages have been intensively studied.

387 views β€’ 22 slides

More recommend