Results 21 to 30 of about 192,432 (282)

PLTL Partitioned Model Checking for Reactive Systems under Fairness Assumptions [PDF]

open access: yes, 2005
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified through a top-down refinement process.
Bellegarde, Françoise   +3 more
core   +3 more sources

Multikey Verifiable Homomorphic Encryption

open access: yesIEEE Access, 2022
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

Rapidly Verifiable XMSS Signatures

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2020
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

A Verifiable Fully Homomorphic Encryption Scheme for Cloud Computing Security

open access: yesTechnologies, 2019
Performing smart computations in a context of cloud computing and big data is highly appreciated today. It allows customers to fully benefit from cloud computing capacities (such as processing or storage) without losing confidentiality of sensitive data.
Ahmed EL-YAHYAOUI   +1 more
doaj   +1 more source

Verifying Robocup Teams [PDF]

open access: yes, 2009
Verification of multi-agent systems is a challenging task due to their dynamic nature, and the complex interactions between agents. An example of such a system is the RoboCup Soccer Simulator, where two teams of eleven independent agents play a game of football against each other.
Benac Earle C.   +3 more
openaire   +2 more sources

Unconditionally verifiable blind computation [PDF]

open access: yes, 2014
Blind Quantum Computing (BQC) allows a client to have a server carry out a quantum computation for them such that the client's input, output and computation remain private. A desirable property for any BQC protocol is verification, whereby the client can
A. Ambainis   +15 more
core   +5 more sources

Verifying the Verifier: eBPF Range Analysis Verification

open access: yes, 2023
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

Analysis of an ABE Scheme with Verifiable Outsourced Decryption

open access: yesSensors, 2018
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 Origin of Neutrino Mass at TeV Scale [PDF]

open access: yes, 2001
The physics responsible for neutrino mass may reside at or below the TeV energy scale. The neutrino mass matrix in the $(\nu_e, \nu_\mu, \nu_\tau)$ basis may then be deduced from future high-energy accelerator experiments.
Brown   +18 more
core   +3 more sources

Verifiable attribute-based searchable encryption scheme based on blockchain

open access: yesTongxin xuebao, 2020
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  

Home - About - Disclaimer - Privacy