Explore the words cloud of the FAFC project. It provides you a very rough idea of what is the project "FAFC" about.
The following table provides information about the project.
THE HEBREW UNIVERSITY OF JERUSALEM
|Coordinator Country||Israel [IL]|
|Total cost||1˙307˙188 €|
|EC max contribution||1˙307˙188 € (100%)|
1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
|Duration (year-month-day)||from 2017-02-01 to 2022-01-31|
Take a look of project's partnership.
|1||THE HEBREW UNIVERSITY OF JERUSALEM||IL (JERUSALEM)||coordinator||1˙307˙188.00|
'Modern cryptography has successfully followed an 'all-or-nothing' design paradigm over the years. For example, the most fundamental task of data encryption requires that encrypted data be fully recoverable using the encryption key, but be completely useless without it. Nowadays, however, this paradigm is insufficient for a wide variety of evolving applications, and a more subtle approach is urgently needed. This has recently motivated the cryptography community to put forward a vision of 'functional cryptography': Designing cryptographic primitives that allow fine-grained access to sensitive data.
This proposal aims at making substantial progress towards realizing the premise of functional cryptography. By tackling challenging key problems in both the foundations and the applications of functional cryptography, I plan to direct the majority of our effort towards addressing the following three fundamental objectives, which span a broad and interdisciplinary flavor of research directions: (1) Obtain a better understanding of functional cryptography's building blocks, (2) develop functional cryptographic tools and schemes based on well-studied assumptions, and (3) increase the usability of functional cryptographic systems via algorithmic techniques.
Realizing the premise of functional cryptography is of utmost importance not only to the development of modern cryptography, but in fact to our entire technological development, where fine-grained access to sensitive data plays an instrumental role. Moreover, our objectives are tightly related to two of the most fundamental open problems in cryptography: Basing cryptography on widely-believed worst-case complexity assumptions, and basing public-key cryptography on private-key primitives. I strongly believe that meaningful progress towards achieving our objectives will shed new light on these key problems, and thus have a significant impact on our understanding of modern cryptography.'
|year||authors and title||journal||last update|
Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions
published pages: 535-564, ISSN: , DOI: 10.1007/978-3-319-78381-9_20
|Advances in Cryptology -- EUROCRYPT 2018||2019-05-14|
Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev
Securing Abe\'s Mix-Net Against Malicious Verifiers via Witness Indistinguishability
published pages: 274-291, ISSN: , DOI: 10.1007/978-3-319-98113-0_15
|Security and Cryptography for Networks - 11th International Conference, SCN 2018||2019-05-14|
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption
published pages: 407-436, ISSN: , DOI: 10.1007/978-3-319-96884-1_14
|Advances in Cryptology -- CRYPTO 2018||2019-05-14|
Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
published pages: 747-776, ISSN: , DOI: 10.1007/978-3-319-70503-3_25
|Theory of Cryptography Conference (TCC 2017)||2019-05-14|
Gilad Asharov, Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation
published pages: 698-736, ISSN: 0933-2790, DOI: 10.1007/s00145-017-9268-6
|Journal of Cryptology 31/3||2019-05-14|
Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner
Privacy-Preserving Interdomain Routing at Internet Scale
published pages: 147-167, ISSN: 2299-0984, DOI: 10.1515/popets-2017-0033
|Proceedings on Privacy Enhancing Technologies 2017/3||2019-05-14|
Ilya Mironov, Gil Segev, Ido Shahaf
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs
published pages: 631-661, ISSN: , DOI: 10.1007/978-3-319-70503-3_21
|Theory of Cryptography Conference (TCC 2017)||2019-05-14|
Lior Rotem, Gil Segev
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal
published pages: 63-89, ISSN: , DOI: 10.1007/978-3-319-96884-1_3
|Advances in Cryptology â€“ CRYPTO 2018||2019-05-14|
Ilan Komargodski, Gil Segev
From Minicrypt to Obfustopia via Private-Key Functional Encryption
published pages: 122-151, ISSN: , DOI: 10.1007/978-3-319-56620-7_5
|Advances in Cryptology - EUROCRYPT 2017||2019-05-14|
Ananth Raghunathan, Gil Segev, Salil Vadhan
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions
published pages: 1012-1063, ISSN: 0933-2790, DOI: 10.1007/s00145-018-9287-y
|Journal of Cryptology 31/4||2019-05-14|
Zvika Brakerski, Gil Segev
Function-Private Functional Encryption in the Private-Key Setting
published pages: 202-225, ISSN: 0933-2790, DOI: 10.1007/s00145-017-9255-y
|Journal of Cryptology 31/1||2019-05-14|
Zvika Brakerski, Ilan Komargodski, Gil Segev
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
published pages: 434-520, ISSN: 0933-2790, DOI: 10.1007/s00145-017-9261-0
|Journal of Cryptology 31/2||2019-05-14|
Are you the coordinator (or a participant) of this project? Plaese send me more information about the "FAFC" project.
For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.
Send me an email (firstname.lastname@example.org) and I put them in your project's page as son as possible.
Thanks. And then put a link of this page into your project's website.
The information about "FAFC" are provided by the European Opendata Portal: CORDIS opendata.