Browse ORBi

- What it is and what it isn't
- Green Road / Gold Road?
- Ready to Publish. Now What?
- How can I support the OA movement?
- Where can I learn more?

ORBi

New Constructions of Verifiable Delay Functions Barthel, Jim Jean-Pierre ; ; Rosie, Razvan E-print/Working paper (n.d.) A Verifiable Delay Function (VDF) is a cryptographic protocol thought to provide a proof of elapsed time. At the core of such a protocol lies a sequential task whose evaluation cannot be accelerated, even ... [more ▼] A Verifiable Delay Function (VDF) is a cryptographic protocol thought to provide a proof of elapsed time. At the core of such a protocol lies a sequential task whose evaluation cannot be accelerated, even in the presence of massive parallel computational resources. We introduce a novel sequentiality assumption, put forth a scheme that achieves this sequentiality constraint by requiring its users to evaluate a function over (levelled) fully homomorphic ciphertexts and provide a heuristic security analysis. [less ▲] Detailed reference viewed: 81 (5 UL)ON THE (NON-)EQUIVALENCE OF INTEGRAL BINARY QUADRATIC FORMS AND THEIR NEGATIVE FORMS Barthel, Jim Jean-Pierre ; Müller, Volker E-print/Working paper (n.d.) Integral binary quadratic forms have been extensively studied in order to compute the class number of real and complex quadratic ﬁelds. Many studies restricted the equivalence class of quadratic forms or ... [more ▼] Integral binary quadratic forms have been extensively studied in order to compute the class number of real and complex quadratic ﬁelds. Many studies restricted the equivalence class of quadratic forms or identiﬁed speciﬁc forms in order to compute the class number through enumeration of equivalence classes. One often used assumption is that a given form and its negative are equivalent or are synthetically identiﬁed. This document presents a concise Lagrangian approach to integral binary quadratic forms, outlines the equivalence classes in its broadest sense and uses it to develop a general condition when a given integral binary quadratic form and its negative are equivalent. Then, the existence of integral binary quadratic forms which are non-equivalent to their negatives is proven and an elementary algorithm to determine the (non-)equivalence of a given form and its negative is outlined. [less ▲] Detailed reference viewed: 63 (3 UL) |
||