View More View Less
  • 1 University of Turku, 20014 Turun yliopisto, Finland
  • 2 Turku Centre for Computer Science (TUCS), Finland
Restricted access

Purchase article

USD  $25.00

1 year subscription (Individual Only)

USD  $800.00

The methods for secure outsourcing and secure one-time programs have recently been of great research interest. Garbling schemes are regarded as a promising technique for these applications while Bellare, Hoang and Rogaway introduced the first formal security notions for garbling schemes in [3, 4]. Ever since, even more security notions have been introduced and garbling schemes have been categorized in different security classes according to these notions. In this paper, we introduce new security classes of garbling schemes and build a hierarchy for the security classes including the known classes as well as classes introduced in this paper.

  • [1]

    Beaver, D., Micali, S. and Rogaway, P., The round complexity of secure protocols, Proc. of the 22nd STOC, (1990), pp. 503513.

  • [2]

    Bellare, M., Hoang, V. T., Keelveedhi, S. and Rogaway, P., Efficient garbling from a fixed-key blockcipher, Proc. of Symposium on Security and Privacy 2013, (2013), pp. 478492.

    • Search Google Scholar
    • Export Citation
  • [3]

    Bellare, M., Hoang, V. T. and Rogaway, P., Adaptively secure garbling scheme with applications to one-time programs and secure outsourcing, Asiacrypt 2012, 7685 of LNCS (2012), 134153.

    • Search Google Scholar
    • Export Citation
  • [4]

    Bellare, M., Hoang, V. T. and Rogaway, P., Foundations of garbled circuits, in: Proc. of ACM Computer and Communications Security (CCS′12), ACM (2012), pp. 784796.

    • Search Google Scholar
    • Export Citation
  • [5]

    Bellare, M. and Rogaway, P., Code-based game-playing proofs and the security of triple encryption, Advances in Cryptology, Proc. of Eurocrypt 2006, 4004 of LNCS (2006), 409426.

    • Search Google Scholar
    • Export Citation
  • [6]

    Boneh, D., Sahai, A. and Waters, B., Functional encryption: Definitions and challenges, Proc. of TCC 2011, 6597 of LNCS (2011), 253273.

    • Search Google Scholar
    • Export Citation
  • [7]

    Gennaro, R., Gentry, C. and Parno, B., Non-interactive verfiable computing: Outsourcing computation to untrusted workers, CRYPTO 2010, 6223 of LNCS (2010), 465482.

    • Search Google Scholar
    • Export Citation
  • [8]

    Gentry, C., A Fully Homomorphic Encryption Scheme, PhD thesis, Stanford University (2009). www.crypto.stanford.edu/craig.

  • [9]

    Goldwasser, S., Kalai, Y., Popa, R. A., Vaikuntanathan, V. and Zeldovich, N., Reusable garbled circuits and succinct functional encryption, Proc. of the 45th STOC, (2013), pp. 555564.

    • Search Google Scholar
    • Export Citation
  • [10]

    Goldwasser, S., Kalai, Y. and Rothblum, G., One-time programs, CRYPTO 2008, 5157 of LNCS (2008), 3956.

  • [11]

    Gorbunov, S., Vaikuntanathan, V. and Wee, H., Attribute-based encryption for circuits, Proc. of the 45th STOC (2013), pp. 545554.

  • [12]

    Goyal, V., Pandey, O., Sahai, A. and Waters, B., Attribute-based encryption for fine-grained access control of encrypted data, in: Proc. of ACM Computerand Communications Security (CCS′06), ACM (2006), pp. 8998.

    • Search Google Scholar
    • Export Citation
  • [13]

    Hoang, V. T., Foundations of Garbled Circuits, PhD thesis, University of California, Davis (2013).

  • [14]

    Lindell, Y. and Pinkas, B., A proof of security of Yao’s protocol for secure twoparty computation, Journal of Cryptology, 22(2) (2009), 161188.

    • Search Google Scholar
    • Export Citation
  • [15]

    Meskanen, T., Niemi, V. and Nieminen, N., Classes of garbled schemes, Infocommunications Journal, V(3) (2013), 816.

  • [16]

    Peikert, C., Public-key cryptosystems from the worst-case shortest vector problem, Proc. of the 41st STOC (2009), pp. 333342.

  • [17]

    Regev, O., On lattices, learning with errors, random linear codes, and cryptography, Proc. of the 37th STOC (2005), pp. 8493.

  • [18]

    Yao, A., How to generate and exchange secrets, Proc. of 27th FOCS, 1986 (1986), pp. 162167.

The author instruction is available in PDF.

Please, download the file from HERE

Manuscript submission: HERE

 

  • Impact Factor (2019): 0.486
  • Scimago Journal Rank (2019): 0.234
  • SJR Hirsch-Index (2019): 23
  • SJR Quartile Score (2019): Q3 Mathematics (miscellaneous)
  • Impact Factor (2018): 0.309
  • Scimago Journal Rank (2018): 0.253
  • SJR Hirsch-Index (2018): 21
  • SJR Quartile Score (2018): Q3 Mathematics (miscellaneous)

Language: English, French, German

Founded in 1966
Publication: One volume of four issues annually
Publication Programme: 2020. Vol. 57.
Indexing and Abstracting Services:

  • CompuMath Citation Index
  • Mathematical Reviews
  • Referativnyi Zhurnal/li>
  • Research Alert
  • Science Citation Index Expanded (SciSearch)/li>
  • SCOPUS
  • The ISI Alerting Services

 

Subscribers can access the electronic version of every printed article.

Senior editors

Editor(s)-in-Chief: Pálfy Péter Pál

Managing Editor(s): Sági, Gábor

Editorial Board

  • Biró, András (Number theory)
  • Csáki, Endre (Probability theory and stochastic processes, Statistics)
  • Domokos, Mátyás (Algebra (Ring theory, Invariant theory))
  • Győri, Ervin (Graph and hypergraph theory, Extremal combinatorics, Designs and configurations)
  • O. H. Katona, Gyula (Combinatorics)
  • Márki, László (Algebra (Semigroup theory, Category theory, Ring theory))
  • Némethi, András (Algebraic geometry, Analytic spaces, Analysis on manifolds)
  • Pach, János (Combinatorics, Discrete and computational geometry)
  • Rásonyi, Miklós (Probability theory and stochastic processes, Financial mathematics)
  • Révész, Szilárd Gy. (Analysis (Approximation theory, Potential theory, Harmonic analysis, Functional analysis))
  • Ruzsa, Imre Z. (Number theory)
  • Soukup, Lajos (General topology, Set theory, Model theory, Algebraic logic, Measure and integration)
  • Stipsicz, András (Low dimensional topology and knot theory, Manifolds and cell complexes, Differential topology)
  • Szász, Domokos (Dynamical systems and ergodic theory, Mechanics of particles and systems)
  • Tóth, Géza (Combinatorial geometry)

STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA
Gábor Sági
Address: P.O. Box 127, H–1364 Budapest, Hungary
Phone: (36 1) 483 8344 ---- Fax: (36 1) 483 8333
E-mail: smh.studia@renyi.mta.hu