{"article_processing_charge":"No","title":"Practical round-optimal blind signatures in the standard model from weaker assumptions","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"KrPi"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2016/662"}],"publication_status":"published","year":"2016","publisher":"Springer","external_id":{"isi":["000389516500021"]},"day":"11","oa":1,"type":"conference","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"},{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815"}],"isi":1,"date_created":"2018-12-11T11:50:49Z","language":[{"iso":"eng"}],"_id":"1225","scopus_import":"1","oa_version":"Submitted Version","doi":"10.1007/978-3-319-44618-9_21","month":"08","ec_funded":1,"volume":9841,"page":"391 - 408","status":"public","author":[{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg"},{"first_name":"Christian","last_name":"Hanser","full_name":"Hanser, Christian"},{"last_name":"Kamath Hosdurg","first_name":"Chethan","full_name":"Kamath Hosdurg, Chethan","id":"4BD3F30E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniel","last_name":"Slamanig","full_name":"Slamanig, Daniel"}],"alternative_title":["LNCS"],"intvolume":"      9841","date_updated":"2025-09-23T09:53:45Z","publist_id":"6109","date_published":"2016-08-11T00:00:00Z","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"1647"}]},"citation":{"short":"G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, D. Slamanig, in:, Springer, 2016, pp. 391–408.","ieee":"G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, and D. Slamanig, “Practical round-optimal blind signatures in the standard model from weaker assumptions,” presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy, 2016, vol. 9841, pp. 391–408.","mla":"Fuchsbauer, Georg, et al. <i>Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions</i>. Vol. 9841, Springer, 2016, pp. 391–408, doi:<a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">10.1007/978-3-319-44618-9_21</a>.","apa":"Fuchsbauer, G., Hanser, C., Kamath Hosdurg, C., &#38; Slamanig, D. (2016). Practical round-optimal blind signatures in the standard model from weaker assumptions (Vol. 9841, pp. 391–408). Presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">https://doi.org/10.1007/978-3-319-44618-9_21</a>","ama":"Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Vol 9841. Springer; 2016:391-408. doi:<a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">10.1007/978-3-319-44618-9_21</a>","chicago":"Fuchsbauer, Georg, Christian Hanser, Chethan Kamath Hosdurg, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions,” 9841:391–408. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-44618-9_21\">https://doi.org/10.1007/978-3-319-44618-9_21</a>.","ista":"Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. 2016. Practical round-optimal blind signatures in the standard model from weaker assumptions. SCN: Security and Cryptography for Networks, LNCS, vol. 9841, 391–408."},"abstract":[{"text":"At Crypto 2015 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standard-model construction of efficient roundoptimal blind signatures that does not require complexity leveraging. It is conceptually simple and builds on the primitive of structure-preserving signatures on equivalence classes (SPS-EQ). FHS prove the unforgeability of their scheme assuming EUF-CMA security of the SPS-EQ scheme and hardness of a version of the DH inversion problem. Blindness under adversarially chosen keys is proven under an interactive variant of the DDH assumption. We propose a variant of their scheme whose blindness can be proven under a non-interactive assumption, namely a variant of the bilinear DDH assumption. We moreover prove its unforgeability assuming only unforgeability of the underlying SPS-EQ but no additional assumptions as needed for the FHS scheme.","lang":"eng"}],"conference":{"start_date":"2016-08-31","end_date":"2016-09-02","location":"Amalfi, Italy","name":"SCN: Security and Cryptography for Networks"}}