• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Classes of Garbling Schemes

Tommi Meskanen, Valtteri Niemi, Noora Nieminen, Classes of Garbling Schemes. Infocommunications Journal V(3), 8–16, 2013.

Abstract:

Bellare, Hoang and Rogaway elevated "garbled circuits from 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.

BibTeX entry:

@ARTICLE{jMeNiNi13a,
  title = {Classes of Garbling Schemes},
  author = {Meskanen, Tommi and Niemi, Valtteri and Nieminen, Noora},
  journal = {Infocommunications Journal},
  volume = {V},
  number = {3},
  pages = {8–16},
  year = {2013},
  keywords = {garbled circuits, garbling schemes, secure multiparty computations, privacy},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Edit publication