| Reference : NIKE from Affine Determinant Programs |
| Scientific congresses, symposiums and conference proceedings : Paper published in a book | |||
| Engineering, computing & technology : Computer science | |||
| Security, Reliability and Trust | |||
| http://hdl.handle.net/10993/47992 | |||
| NIKE from Affine Determinant Programs | |
| English | |
Barthel, Jim Jean-Pierre  [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >] | |
| Rosie, Razvan [Jao Luxembourg] | |
| In press | |
| Provable and Practical Security, 15th International Conference, ProvSec 2021, Guangzhou, November 5 – November 8, 2021, Proceedings | |
| Qiong, Huang | |
| Yu, Yu | |
| Yes | |
| International | |
| THE 15TH INTERNATIONAL CONFERENCE ON PROVABLE AND PRACTICAL SECURITY | |
| from 5-11-2021 to 8-11-2021 | |
| Sha Ma, Ximing Li, Cai Zhang, Meiyan Xiao (South China Agricultural University) | |
| Guangzhou | |
| China | |
| [en] NIKE ; branching programs ; affine determinant programs | |
| [en] A multi-party non-interactive key-exchange (NIKE) scheme enables N users to securely exchange a secret key K in a non-interactive manner. It is well-known that NIKE schemes can be obtained assuming the existence of indistinguishability obfuscation (iO). In this work, we revisit the original, iO-based, provably-secure NIKE construction by Boneh and Zhandry, aiming to simplify it. The core idea behind our protocol is to replace the functionality of the obfuscator with the one of an affine determinant program (ADP). Although ADPs have been designed with the purpose of attaining indistinguishability obfuscation, such implication is left open for general circuits. The ingredients enabling to prove the security of our scheme stem into a more careful analysis of the branching programs needed to build ADPs. In particular, we show:
1) An intuitive indistinguishability notion defined for ADPs of puncturable pseudorandom functions (PRFs) is sufficient to prove security for NIKE. 2) A set of simple conditions based on ADP's branching program topology that are sufficient for proving indistinguishability of ADPs. We leave open the question of finding ADPs satisfying them. | |
| http://hdl.handle.net/10993/47992 | |
| FnR ; FNR10621687 > Sjouke Mauw > SPsquared > Security And Privacy For System Protection > 01/01/2017 > 30/06/2023 > 2015 |
| File(s) associated to this reference | ||||||||||||||
|
Fulltext file(s):
| ||||||||||||||
All documents in ORBilu are protected by a user license.
