Results 31 to 40 of about 26,946 (315)
, 2020 Device-independent quantum key distribution provides security even when the equipment used to communicate over the quantum channel is largely uncharacterized.
Bancal, J. -D. +5 more
core +2 more sources
Robustness Verification of Support Vector Machines [PDF]
, 2019 We study the problem of formally verifying the robustness to adversarial examples of support vector machines (SVMs), a major machine learning model for classification and regression tasks.
A Miné +25 more
core +2 more sources
Enabling Confidentiality in Content-Based Publish/Subscribe Infrastructures [PDF]
, 2006 Content-Based Publish/Subscribe (CBPS) is an interaction model where the interests of subscribers are stored in a content-based forwarding infrastructure to guide routing of notifications to interested parties.
Raiciu, C, Rosenblum, DS
core +1 more source
, 2013 arXiv admin note: text overlap with arXiv:1310.8038, arXiv:1310 ...
Li, Angsheng, Pan, Yicheng, Zhang, Wei
openaire +2 more sources
PS-TRUST: Provably Secure Solution for Truthful Double Spectrum Auctions [PDF]
, 2013 Truthful spectrum auctions have been extensively studied in recent years. Truthfulness makes bidders bid their true valuations, simplifying greatly the analysis of auctions.
Chen, Zhili +6 more
core +1 more source
On Provable White-Box Security in the Strong Incompressibility Model
Transactions on Cryptographic Hardware and Embedded Systems, 2023 Incompressibility is a popular security notion for white-box cryptography and captures that a large encryption program cannot be compressed without losing functionality. Fouque, Karpman, Kirchner and Minaud (FKKM) defined strong incompressibility, where
Estuardo Alpirez Bock +2 more
doaj +1 more source
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search [PDF]
, 2013 By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem.
A. Ambainis +39 more
core +2 more sources
Future Internet, 2018 Provable Data Possession (PDP) protocol makes it possible for cloud users to check whether the cloud servers possess their original data without downloading all the data.
Hongbin Yang +3 more
doaj +1 more source
Provable Security Against a Differential Attack
DAIMI Report Series, 1994 The purpose of this paper is to show that there exist DES-like iterated ciphers, which are provably resistant against differential attacks. The main result on the security of a DES-like cipher with independent round keys is Theorem 1, which gives an upper bound to the probability of <em>s</em>-round differentials, as defined in <em> ...
Kaisa Nyberg, Lars R. Knudsen
openaire +4 more sources
Collection analysis for Horn clause programs [PDF]
, 2006 We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them.
Miller, Dale
core +4 more sources