Kazan Federal University Digital Repository

Quantum hashing via ε-universal hashing constructions and Freivalds' fingerprinting schemas

Show simple item record

dc.contributor.author Ablayev F.
dc.contributor.author Ablayev M.
dc.date.accessioned 2018-09-18T20:08:21Z
dc.date.available 2018-09-18T20:08:21Z
dc.date.issued 2014
dc.identifier.issn 0302-9743
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/136890
dc.description.abstract We define the concept of a quantum hash generator and offer a design, which allows one to build a large number of different quantum hash functions. The construction is based on composition of a classical ε-universal hash family and a given family of functions - quantum hash generators. In particular, using the relationship between ε-universal hash families and Freivalds' fingerprinting schemas we present explicit quantum hash function and prove that this construction is optimal with respect to the number of qubits needed for the construction. © 2014 Springer International Publishing.
dc.relation.ispartofseries Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.subject error-correcting codes
dc.subject quantum hash function
dc.subject quantum hashing
dc.subject ε-universal hashing
dc.title Quantum hashing via ε-universal hashing constructions and Freivalds' fingerprinting schemas
dc.type Conference Paper
dc.relation.ispartofseries-volume 8614
dc.collection Публикации сотрудников КФУ
dc.relation.startpage 42
dc.source.id SCOPUS03029743-2014-8614-SID84905389716


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics