A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Efficient, secure, private distance bounding without key updates
2013
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks - WiSec '13
We propose a new distance bounding protocol, which builds upon the private RFID authentication protocol by Peeters and Hermans [25] . ...
In contrast to most distance-bounding protocols in literature, our construction is based on publickey cryptography. ...
We would like to thank Saartje Verheyen, without whom this paper would not have been possible. ...
doi:10.1145/2462096.2462129
dblp:conf/wisec/HermansPO13
fatcat:3xp7i4ilovdm3b3wnoefi4d6v4
Dynamic Membership Management in Anonymous and Deniable Distance Bounding
2020
Sustainability
For secure location proof in many applications, distance bounding protocols are considered as one of the useful tools that can be used in practice. ...
To handle the security problem, a prover-anonymous and deniable distance bounding protocol is proposed, which can guarantee the privacy of the prover even though the verifier is corrupted. ...
Conclusions In this paper, we review the efficiency of the prover-anonymous and deniable distance bounding protocol. ...
doi:10.3390/su122410330
fatcat:rldlcjdbl5e7rh7fugdytx2a6i
Toward More Secure and Reliable Access Control
2012
IEEE pervasive computing
Distance Bounding Secure distance-bounding protocols measure the time of flight to determine an upper bound Conventional access control mechanisms, relying on a single security token to authenticate remote ...
A threshold-based distancebounding protocol that distributes a user's private key among various personal devices improves system security and reliability. the AuThoRS Roel Peeters is a PhD student in the ...
In particular, we envision personal devices that have a private key but can't update the key or store additional data (a car key fob, for example). ...
doi:10.1109/mprv.2011.42
fatcat:546wft6snzc5pcq5catnag547m
Prover anonymous and deniable distance-bounding authentication
2014
Proceedings of the 9th ACM symposium on Information, computer and communications security - ASIA CCS '14
Finally, we present an efficient protocol that achieves these strong guarantees, give exact bounds for each of its security properties, and prove these statements formally. ...
In this paper, we propose an efficient distance-bounding protocol that gives strong prover privacy guarantees even with respect to the verifier or to a centralized back-end server, storing prover information ...
Private and secure public-key distance bounding -application to NFC payment. ...
doi:10.1145/2590296.2590331
dblp:conf/ccs/GambsOR14
fatcat:jcz67e4onfb53ohtibmkr5ca54
An Efficient Identity Based Encryption in Cloud Computing with Outsourced Revocation
2020
International Journal of Scientific Research in Computer Science Engineering and Information Technology
However, one of the main efficiency drawbacks of IBE is the overhead computation at Private Key Generator (PKG) during user revocation. ...
Our scheme offloads most of the key generation related operations during key-issuing and key-update processes to a Key Update Cloud Service Provider, leaving only a constant number of simple operations ...
It presented an efficient protocol to securely outsource the sequence comparisons between two servers to overcome the problem of computing using the edit distance between two sequences. ...
doi:10.32628/cseit20668
fatcat:foc35bd6ofcw7l5sl72c4b2bcq
A survey of secure wireless ad hoc routing
2004
IEEE Security and Privacy
In this case, the channel over which it receives the private key must be secure against eavesdropping. ...
Establishing private keys Some ad hoc network routing protocols require shared private keys between all pairs of nodes in the network. ...
doi:10.1109/msp.2004.1
fatcat:at4yxm6cafbrhg7cb2wwthqblm
zPROBE: Zero Peek Robustness Checks for Federated Learning
[article]
2022
arXiv
pre-print
We leverage the derived statistical bounds in zero-knowledge proofs to detect and remove malicious updates without revealing the private user updates. ...
However, keeping the individual updates private allows malicious users to perform Byzantine attacks and degrade the model accuracy without being detected. ...
We circumvent this challenge by forming clusters of users, where our secure aggregation can be used to efficiently compute the average of their updates. ...
arXiv:2206.12100v1
fatcat:sbiezhbzprfbtlo4sdrtnppwsq
Data Security and Privacy Protection for Cloud Storage: A Survey
2020
IEEE Access
Finally, we discuss several open research topics of data security for cloud storage. ...
Secondly, we give a detailed analysis on challenges and requirements of data security and privacy protection in cloud storage system. ...
In this scheme, when the leakage length of the master key and the private key is bounded, the proposed scheme is secure under the standard model. ...
doi:10.1109/access.2020.3009876
fatcat:6kcb3junlzhvvcq3qhztumpdqq
Revocable Identity-Based Encryption from Codes with Rank Metric
[chapter]
2018
Lecture Notes in Computer Science
In this paper, we present an identity-based encryption scheme from codes with efficient key revocation. ...
We adopt the same trapdoor function to add efficient key revocation functionality in the RankIBE scheme. ...
We are able to add revocable functionality without any increase in the size of ciphertext. The inclusion of binary tree data structure improves the efficiency of secret key updates. ...
doi:10.1007/978-3-319-76953-0_23
fatcat:feppnvzs4vh2dixqswhwlggcqa
Flatee: Federated Learning Across Trusted Execution Environments
[article]
2021
arXiv
pre-print
Federated learning allows us to distributively train a machine learning model where multiple parties share local model parameters without sharing private data. ...
We describe Flatee, an efficient privacy-preserving federated learning framework across TEEs, which considerably reduces training and communication time. ...
E and D are post-quantum secure en/decryption; "pk" and "sk" denote public and private keys (private keys never leave SGX). Threat Model and Poisoning Attacks. ...
arXiv:2111.06867v1
fatcat:rl2rysly7fcbtnw32acea4liu4
Pseudonym Generation with Combining the Identity Based and Attribute Based Encryption with Outsourced Revocation in Cloud Computing
2016
International Journal of Science and Research (IJSR)
For this, we generate a hybrid private key for each user, in which an AND gate is used to connect and bound the identity component and time component. But KU-CSP is untrusted. ...
The use of Key update cloud service provider (KU-CSP) offloads most of key generation operations during key-issuing and key-update process leaving only a number of simple operations for PKG and users to ...
The CSPs then simply update all private keys by using the traditional key update technique and transfer the private keys to unrevoked users. ...
doi:10.21275/v5i6.nov164503
fatcat:k3xhmc7lfvbxtjmomvru3bxhie
∑oφoς
2016
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16
This work proposes Σoφoς as a forward private SSE scheme with performance similar to existing less secure schemes, and that is conceptually simpler (and also more efficient) than previous forward private ...
Recent work shows that dynamic schemes -in which the data is efficiently updatable -leaking some information on updated keywords are subject to devastating adaptative attacks breaking the privacy of the ...
Acknowledgements The author thanks Pierre-Alain Fouque and David Pointcheval for their help on clarifying the proof of security, and Brice Minaud and anonymous reviewers for helpful comments. ...
doi:10.1145/2976749.2978303
dblp:conf/ccs/Bost16
fatcat:vx3lm5klsnedljzj3uxbq432du
A secure routing model based on distance vector routing algorithm
2012
Science China Information Sciences
Distance vector routing protocols have been widely adopted as an efficient routing mechanism in current Internet, and many wireless networks. ...
A secure routing model based on distance vector routing algorithm. ...
key infrastructure (PKI), which means that each node has the corresponding public key and private key; 2) each node has the unique network ID which is bound with the prefix of the user network; and 3) ...
doi:10.1007/s11432-012-4659-7
fatcat:uqlbgz2bifbvletsw27bxuvzcq
Efficient targeted key subset retrieval in fractal hash sequences
2013
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13
Proposed solutions such as TV-OTS rely on hash chain generated values for keys, achieving reliable security by using only a small subset of generated values from each chain. ...
This work is motivated by the need for efficient message authentication in low-latency multicast systems. ...
When used for message authentication, hash chains allow private keys to be refreshed without the need to distribute new public keys. ...
doi:10.1145/2508859.2516739
dblp:conf/ccs/CairnsGH13
fatcat:nevux2xtlza27ci5nxy4i2ck3i
Secure deduplication storage systems supporting keyword search
2015
Journal of computer and system sciences (Print)
In these constructions, the integrity of the data can be realized by just checking the convergent key, without other traditional integrity auditing mechanisms. ...
Finally, security analysis is given. ...
updated. ...
doi:10.1016/j.jcss.2014.12.026
fatcat:dc4prtdu6bcvviqacochjvi2ye
« Previous
Showing results 1 — 15 out of 34,818 results