Verifiable computation over large database with incremental updates

X Chen, J Li, J Weng, J Ma… - IEEE transactions on …, 2015 - ieeexplore.ieee.org
The notion of verifiable database (VDB) enables a resource-constrained client to securely
outsource a very large database to an untrusted server so that it could later retrieve a …

Stream ciphers: A practical solution for efficient homomorphic-ciphertext compression

A Canteaut, S Carpov, C Fontaine, T Lepoint… - Journal of …, 2018 - Springer
In typical applications of homomorphic encryption, the first step consists for Alice of
encrypting some plaintext m under Bob's public key pk pk and of sending the ciphertext c …

Still wrong use of pairings in cryptography

O Uzunkol, MS Kiraz - Applied Mathematics and computation, 2018 - Elsevier
Recently many pairing-based cryptographic protocols have been designed with a wide
variety of new novel applications including the ones in the emerging technologies like cloud …

A practical second-order fault attack against a real-world pairing implementation

J Blömer, RG Da Silva, P Günther… - 2014 Workshop on …, 2014 - ieeexplore.ieee.org
Several fault attacks against pairing-based cryptography have been described theoretically
in recent years. Interestingly, none of these has been practically evaluated. We accomplish …

Improving the polynomial time precomputation of Frobenius representation discrete logarithm algorithms: simplified setting for small characteristic finite fields

A Joux, C Pierrot - Advances in Cryptology–ASIACRYPT 2014: 20th …, 2014 - Springer
In this paper, we revisit the recent small characteristic discrete logarithm algorithms. We
show that a simplified description of the algorithm, together with some additional ideas …

Dynamic universal accumulator with batch update over bilinear groups

G Vitto, A Biryukov - Cryptographers' Track at the RSA Conference, 2022 - Springer
Abstract We propose a Dynamic Universal Accumulator in the Accumulator Manager setting
for bilinear groups which extends Nguyen's positive accumulator and Au et al. and Damgård …

Efficient verifiable databases with insertion/deletion operations from delegating polynomial functions

M Miao, J Ma, X Huang, Q Wang - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
The notion of verifiable database with updates (VDB) enables a resource-limited client to
securely outsource a very large database to an untrusted server, and the client could later …

Technical history of discrete logarithms in small characteristic finite fields: The road from subexponential to quasi-polynomial complexity

A Joux, C Pierrot - Designs, Codes and Cryptography, 2016 - Springer
Due to its use in cryptographic protocols such as the Diffie–Hellman key exchange, the
discrete logarithm problem attracted a considerable amount of attention in the past 40 years …

Efficient adaptively secure IBBE from the SXDH assumption

SC Ramanna, P Sarkar - IEEE Transactions on Information …, 2016 - ieeexplore.ieee.org
This paper describes the first constructions of identity-based broadcast encryption (IBBE)
using Type-3 pairings, which can be proved secure against adaptive-identity attacks based …

Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields

G Adj, I Canales-Martínez, N Cruz-Cortés… - Cryptology ePrint …, 2016 - eprint.iacr.org
Since 2013 there have been several developments in algorithms for computing discrete
logarithms in small-characteristic finite fields, culminating in a quasi-polynomial algorithm. In …