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.

Editors in Chief

Gábor SIMONYI (Rényi Institute of Mathematics)
András STIPSICZ (Rényi Institute of Mathematics)
Géza TÓTH (Rényi Institute of Mathematics) 

Managing Editor

Gábor SÁGI (Rényi Institute of Mathematics)

Editorial Board

  • Imre BÁRÁNY (Rényi Institute of Mathematics)
  • Károly BÖRÖCZKY (Rényi Institute of Mathematics and Central European University)
  • Péter CSIKVÁRI (ELTE, Budapest) 
  • Joshua GREENE (Boston College)
  • Penny HAXELL (University of Waterloo)
  • Andreas HOLMSEN (Korea Advanced Institute of Science and Technology)
  • Ron HOLZMAN (Technion, Haifa)
  • Satoru IWATA (University of Tokyo)
  • Tibor JORDÁN (ELTE, Budapest)
  • Roy MESHULAM (Technion, Haifa)
  • Frédéric MEUNIER (École des Ponts ParisTech)
  • Márton NASZÓDI (ELTE, Budapest)
  • Eran NEVO (Hebrew University of Jerusalem)
  • János PACH (Rényi Institute of Mathematics)
  • Péter Pál PACH (BME, Budapest)
  • Andrew SUK (University of California, San Diego)
  • Zoltán SZABÓ (Princeton University)
  • Martin TANCER (Charles University, Prague)
  • Gábor TARDOS (Rényi Institute of Mathematics)
  • Paul WOLLAN (University of Rome "La Sapienza")

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

Indexing and Abstracting Services:

  • CompuMath Citation Index
  • Essential Science Indicators
  • Mathematical Reviews
  • Science Citation Index Expanded (SciSearch)
  • SCOPUS
  • Zentralblatt MATH
2020  
Total Cites 536
WoS
Journal
Impact Factor
0,855
Rank by Mathematics 189/330 (Q3)
Impact Factor  
Impact Factor 0,826
without
Journal Self Cites
5 Year 1,703
Impact Factor
Journal  0,68
Citation Indicator  
Rank by Journal  Mathematics 230/470 (Q2)
Citation Indicator   
Citable 32
Items
Total 32
Articles
Total 0
Reviews
Scimago 24
H-index
Scimago 0,307
Journal Rank
Scimago Mathematics (miscellaneous) Q3
Quartile Score  
Scopus 139/130=1,1
Scite Score  
Scopus General Mathematics 204/378 (Q3)
Scite Score Rank  
Scopus 1,069
SNIP  
Days from  85
submission  
to acceptance  
Days from  123
acceptance  
to publication  
Acceptance 16%
Rate

2019  
Total Cites
WoS
463
Impact Factor 0,468
Impact Factor
without
Journal Self Cites
0,468
5 Year
Impact Factor
0,413
Immediacy
Index
0,135
Citable
Items
37
Total
Articles
37
Total
Reviews
0
Cited
Half-Life
21,4
Citing
Half-Life
15,5
Eigenfactor
Score
0,00039
Article Influence
Score
0,196
% Articles
in
Citable Items
100,00
Normalized
Eigenfactor
0,04841
Average
IF
Percentile
13,117
Scimago
H-index
23
Scimago
Journal Rank
0,234
Scopus
Scite Score
76/104=0,7
Scopus
Scite Score Rank
General Mathematics 247/368 (Q3)
Scopus
SNIP
0,671
Acceptance
Rate
14%

 

Studia Scientiarum Mathematicarum Hungarica
Publication Model Hybrid
Submission Fee none
Article Processing Charge 900 EUR/article
Printed Color Illustrations 40 EUR (or 10 000 HUF) + VAT / piece
Regional discounts on country of the funding agency World Bank Lower-middle-income economies: 50%
World Bank Low-income economies: 100%
Further Discounts Editorial Board / Advisory Board members: 50%
Corresponding authors, affiliated to an EISZ member institution subscribing to the journal package of Akadémiai Kiadó: 100%
Subscription fee 2022

Online subsscription: 688 EUR / 860 USD
Print + online subscription: 776 EUR / 970 USD

Subscription Information Online subscribers are entitled access to all back issues published by Akadémiai Kiadó for each title for the duration of the subscription, as well as Online First content for the subscribed content.
Purchase per Title Individual articles are sold on the displayed price.

Studia Scientiarum Mathematicarum Hungarica
Language English
French
German
Size B5
Year of
Foundation
1966
Volumes
per Year
1
Issues
per Year
4
Founder Magyar Tudományos Akadémia  
Founder's
Address
H-1051 Budapest, Hungary, Széchenyi István tér 9.
Publisher Akadémiai Kiadó
Publisher's
Address
H-1117 Budapest, Hungary 1516 Budapest, PO Box 245.
Responsible
Publisher
Chief Executive Officer, Akadémiai Kiadó
ISSN 0081-6906 (Print)
ISSN 1588-2896 (Online)