Results 21 to 30 of about 27,441 (278)
Simulating Auxiliary Inputs, Revisited [PDF]
, 2016 For any pair $(X,Z)$ of correlated random variables we can think of $Z$ as a randomized function of $X$. Provided that $Z$ is short, one can make this function computationally efficient by allowing it to be only approximately correct.
A Buldas +9 more
core +2 more sources
Practical Fault-Tolerant Data Aggregation
, 2016 During Financial Cryptography 2012 Chan et al. presented a novel privacy-protection fault-tolerant data aggregation protocol. Comparing to previous work, their scheme guaranteed provable privacy of individuals and could work even if some number of users ...
Grining, Krzysztof +2 more
core +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
Provably Secure Reflection Ciphers
, 2022 sponsorship: This work was supported in part by the Research Council KU Leuven: GOA TENSE (C16/15/058). Tim Beyne and Yu Long Chen are supported by a Ph.D. Fellowship from the Research Foundation -Flanders (FWO). The authors thank the reviewers for their valuable comments and suggestions.
Beyne, Tim, Chen, Yu Long
openaire +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
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
On Large Tweaks in Tweakable Even-Mansour with Linear Tweak and Key Mixing
IACR Transactions on Symmetric Cryptology, 2023 In this paper, we provide the first analysis of the Iterated Tweakable Even-Mansour cipher with linear tweak and key (or tweakey) mixing, henceforth referred as TEML, for an arbitrary tweak(ey) size kn for all k ≥ 1, and arbitrary number of rounds r ≥ 2.
Benoît Cogliati +3 more
doaj +1 more source
Dynamic Traitor Tracing Schemes, Revisited [PDF]
, 2013 We revisit recent results from the area of collusion-resistant traitor tracing, and show how they can be combined and improved to obtain more efficient dynamic traitor tracing schemes.
Laarhoven, Thijs
core +3 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
Unidirectional Variable Threshold Proxy Re-signature Scheme with Provable Security [PDF]
Jisuanji gongcheng, 2016 In most existing threshold proxy re-signature schemes,threshold value is essentially immutable.However,depending on the significance of re-signature message,the value should be changed dynamically in many practical applications.Based on proxy re ...
XU Haifeng,HONG Xuan
doaj +1 more source