A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Classes of Garbling Schemes
Tekijät: Tommi Meskanen, Valtteri Niemi, Noora Nieminen
Kustantaja: Scientific Association for Infocommunications
Kustannuspaikka: 1372 Budapest Pf. 451. Hungary
Julkaisuvuosi: 2013
Journal: Infocommunications Journal
Numero sarjassa: 3
Vuosikerta: V
Numero: 3
Aloitussivu: 8
Lopetussivu: 16
ISSN: 2061-2079
eISSN: 2061-2079
Bellare, Hoang and Rogaway elevated garbled circuitsfrom a cryptographic technique to a cryptographic goal by defining several new security notions for garbled circuits [3].This paper continues at the same path by extending some of their results and providing new results about the classes of garbling schemes defined in [3]. Furthermore, new classes of garbling schemes are defined and some results concerning them and their relation to earlier classes are proven.