Results 21 to 30 of about 18,923 (241)
Multikey Verifiable Homomorphic Encryption
A homomorphic encryption (HE) scheme is an advanced encryption technology which allows any user receiving ciphertexts to perform computations over them in a public manner. An important application of an HE scheme is a private delegating computation where
Yi Lu, Keisuke Hara, Keisuke Tanaka
doaj +1 more source
Verifying the Verifier: eBPF Range Analysis Verification
AbstractThis paper proposes an automated method to check the correctness of range analysis used in the Linux kernel ’s eBPF verifier. We provide the specification of soundness for range analysis performed by the eBPF verifier. We automatically generate verification conditions that encode the operation of the eBPF verifier directly from the Linux kernel
Vishwanathan, Harishankar +3 more
openaire +1 more source
Rapidly Verifiable XMSS Signatures
This work presents new speed records for XMSS (RFC 8391) signature verification on embedded devices. For this we make use of a probabilistic method recently proposed by Perin, Zambonin, Martins, Custódio, and Martina (PZMCM) at ISCC 2018, that changes ...
Joppe W. Bos +3 more
doaj +3 more sources
Analysis of an ABE Scheme with Verifiable Outsourced Decryption
Attribute-based encryption (ABE) is a popular cryptographic technology to protect the security of users’ data in cloud computing. In order to reduce its decryption cost, outsourcing the decryption of ciphertexts is an available method, which enables ...
Yongjian Liao +4 more
doaj +1 more source
Verifiable attribute-based searchable encryption scheme based on blockchain
For the problem that the shared decryption key lacks of fine-grained access control and the search results lacks of correctness verification under one-to-many search model,a verifiable attribute-based searchable encryption scheme based on blockchain was ...
Xixi YAN +3 more
doaj
Federify: A Verifiable Federated Learning Scheme Based on zkSNARKs and Blockchain
Federated learning (FL) has emerged as an alternative to traditional machine learning in scenarios where training data is sensitive. In federated learning, training is held at end devices, and thus data does not need to leave users’ devices ...
Ghazaleh Keshavarzkalhori +4 more
doaj +1 more source
Plausibility: A Verbal Cue to Veracity worth Examining?
Truth tellers sound more plausible than lie tellers. Plausibility ratings do not require much time or cognitive resources, but a disadvantage is that it is measured subjectively on Likert scales.
Aldert Vrij +4 more
doaj +1 more source
Verified Bytecode Verifiers [PDF]
Using the theorem prover Isabelle/HOL we have formalized and proved correct an executable bytecode verifier in the style of Kildall's algorithm for a significant subset of the Java Virtual Machine. First an abstract framework for proving correctness of data flow based type inference algorithms for assembly languages is formalized.
openaire +1 more source
The formal verification of programs has progressed tremendously in the last decade. In this talk, I review some of the obstacles that [6, 8, 15, 18] remain to be lifted before source-level verification tools can be taken really seriously in the critical software industry.
openaire +1 more source
Verifiable outsourced attribute-based encryption with access update
In order to meet the secure and reliable access requirements for the encrypted data stored in the public cloud,a verifiable outsourced attribute-based encryption scheme with access update was proposed.Based on a standard KP-ABE scheme,verifiable ...
Suqing LIN
doaj +3 more sources

