Circular Security Reconsidered

The notion of circular security of pseudorandom functions (PRF) was introduced in Distance Bounding Protocols. So far, only a construction based on a random oracle model was proposed. Circular security stands between two new notions which we call Key Dependent Feedback (KDF) security and Leak security. So far, only a construction based on a random oracle was proposed. We give an algebraic construction based on a q-DDH assumpsion. We first prove that a small-domain Verifiable Random Functions (VRF) from Dodis-Yampolskiy is a circular secure PRF. We then use the extension to large-domain VRF by augmented cascading by Boneh et. al. This gives the first construction in the standard model.


Editor(s):
Bica, Ion
Reyhanitabar, Reza
Published in:
Innovative Security Solutions for Information Technology and Communications, 10006, 3-19
Presented at:
9th International Conference, SECITC 2016, Bucharest, Romania, June 9-10, 2016
Year:
2016
Publisher:
Cham, Springer International Publishing
ISBN:
978-3-319-47238-6; 978-3-319-47237-9
Laboratories:




 Record created 2016-10-18, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)