Name
Abstract | ||
|---|---|---|
We provide a garbling scheme which creates garbled circuits of a very small constant size four bits per gate for circuits with fan-out one formulas. For arbitrary fan-out, we additionally need only two ciphertexts per additional connection of each gate output wire. We make use of a trapdoor permutation for which we define a generalized notion of correlation robustness. We show that our notion is implied by PRIV-security, a notion for deterministic searchable encryption. We prove our scheme secure in the programmable random oracle model. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-662-48797-6_31 | IACR Cryptology ePrint Archive |
Keywords | DocType | Volume |
Garbled circuits,Constant size of garbled gates,Correlation robustness,PRIV-security | Journal | 2016 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.36 |
References | Authors | |
27 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carmen Kempka | 1 | 6 | 0.75 |
| Ryo Kikuchi | 2 | 46 | 9.37 |
| Susumu Kiyoshima | 3 | 24 | 4.03 |
| Koutarou Suzuki | 4 | 518 | 29.57 |