A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A Cheating Detectable Privacy-Preserving Data Sharing Scheme for Cloud Computing
2018
Security and Communication Networks
Preserved Fulltext
Cloud computing provides a new, attractive paradigm for the effective sharing of storage and computing resources among global consumers. ...
keys, and identifying cheaters if some users behave dishonestly. ...
Therefore, the share key can be verified by the user.
Identification of the Cheater. ...
doi:10.1155/2018/6174830
fatcat:jxmh3mtpxzajzcxcah7aolatz4
Space-Efficient Verifiable Secret Sharing Using Polynomial Interpolation
2018
IEEE Transactions on Cloud Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2015 pre-print arXiv:1401.7471v5 fatcat:7evdf463dvhjzekbz75icrcma4Other Versions
Verifiable Secret Sharing schemes solve this problem by allowing shareholders verifying the others' shares. ...
We present new verification algorithms providing arbitrary secret sharing schemes with cheater detection capabilities, and prove their space efficiency with regard to other schemes appeared in the literature ...
Verifiable Secret Sharing (VSS) [6] is therefore secret sharing augmented with features that allow only detection or also identification of any cheater in a coalition, unconditionally or with respect ...
doi:10.1109/tcc.2015.2396072
fatcat:viya4uykkredfeyvifz577ilam
Free Riding in Peer-to-Peer Networks
2009
IEEE Internet Computing
Preserved Fulltext
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.
They categorize proposed solutions and describe each category's important features and implementation issues together with some sample solutions. ...
For example, in a file-sharing P2P network, a free riding peer can share some files with fake filenames that resemble more popular ones. ...
In a filesharing P2P network, for example, if most peers prefer not to share, renewal or presentation of interesting con-tent might decrease with time; thus, the number of shared files can become limited ...
doi:10.1109/mic.2009.33
fatcat:b5eeanbyafgsnnm5dzjneowxsq
The Puzzling Science of Information Integrity
[chapter]
1995
IFIP Advances in Information and Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
He may act in ways not anticipated by the designer, or join forces with other participants to form cabals not planned for in the design. ...
The equipment can then be tested to verifY that it meets these specifications and certified that it does. ...
shared, and hence to the other parties share, and whose (joint) use can later be verified by others. ...
doi:10.1007/978-0-387-34943-5_2
fatcat:c53atlsxfzfwhdfnyoh63jmwfu
An Exhaustive Review on Security Issues in Cloud Computing
2019
KSII Transactions on Internet and Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It provides on demand services to customers and customers will pay for what they get. ...
In this paper we have discussed security challenges in cloud computing and also list recommended methods available for addressing them in the literature. ...
The symmetry property of bivariate polynomial & linearity of interpolated polynomial for cheater identification has been proposed A multi secret sharing scheme based on Boolean XOR and asymmetric modulo ...
doi:10.3837/tiis.2019.06.025
fatcat:d2lidmgohvashh6vbqchkvekti
Content based authentication of visual cryptography
2016
Multimedia tools and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Another expectation for future work is that while in the context of basic VC scheme, the result of embedding 2D barcode appears to be an optimal solution for VC authentication, while the research of how ...
for the VC identification. ...
In VC, cheaters are able to create fake shares so as to coax the genuine one for obtaining the secret. ...
doi:10.1007/s11042-016-3549-1
fatcat:u4qeo4sz25aelh6ojp7zkcjw2y
CellTrust: a reputation model for C2C commerce
2008
Electronic Commerce Research
Preserved Fulltext
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.
This paper is very interesting and our approach shares many characteristics with PeerTrust. ...
sharing [24, 31, 57] . ...
doi:10.1007/s10660-008-9019-8
fatcat:unkimvyafvdxzbpet4wetldc3u
A Security Analysis of Blockchain-based DID Services
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Decentralized identifiers (DID) has shown great potential for sharing user identities across different domains and services without compromising user privacy. ...
DID is designed to enable the minimum disclosure of the proof from a user's credentials on a need-to-know basis with a contextualized delegation. ...
share, the expandability for multi-secret sharing solution, etc. ...
doi:10.1109/access.2021.3054887
fatcat:jvcjhgeiy5aclikgv4m6gnpnlm
Unconditionally-Secure Robust Secret Sharing with Minimum Share Size
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
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.
In the paper, we propose a new unconditionally-secure robust secret sharing scheme for the case n ≥ 2t + 2 with share size equal to the secret size. ...
An n-player (t, δ)-secure robust secret sharing scheme is a (t, n)-threshold secret sharing scheme with the additional property that the secret can be recovered, with probability at least 1 − δ, from the ...
Financial support for this research was provided in part by Alberta Innovates -Technology Futures, in the Province of Alberta in Canada. ...
doi:10.1007/978-3-642-39884-1_9
fatcat:rebkvajxs5f7pochxvphgucyne
Robust Secret Image Sharing Scheme against Noise in Shadow Images
2021
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
ACKNOWLEDGMENT The authors would like to thank the editor and the anonymous reviewers for their valuable comments. ...
[17] showed up the lower bounds for verifiable secret sharing schemes. Liu et al. [18] exhibited a secret sharing scheme based on symmetric bivariate polynomial to identify faults and cheaters. ...
This scheme can verify for n 3 ≤ t ≤ (1 − ε) · n 2 corrupted shares, while the size of each share is O(L + λ ), where λ is the security parameter, larger than that of secret O(L). ...
doi:10.1109/access.2021.3056893
fatcat:yoex7gvsejehnejake5bt62y64
Usable optimistic fair exchange
2012
Computer Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged. ...
The rest of our protocol uses very efficient cryptography, making it perfectly suitable for a p2p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ...
As for the bottleneck that can be caused by the central Arbiter, Avoine et al. [6] show how to employ secret sharing techniques [44, 12] to distribute the shares of the secrets among arbiters. ...
doi:10.1016/j.comnet.2011.08.005
fatcat:c5g43fhgerhzng2ovgrejop53u
Usable Optimistic Fair Exchange
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged. ...
The rest of our protocol uses very efficient cryptography, making it perfectly suitable for a p2p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ...
As for the bottleneck that can be caused by the central Arbiter, Avoine et al. [6] show how to employ secret sharing techniques [44, 12] to distribute the shares of the secrets among arbiters. ...
doi:10.1007/978-3-642-11925-5_18
fatcat:kvo57753izhivgksxfqkf5bexy
A survey of peer-to-peer content distribution technologies
2004
ACM Computing Surveys
Preserved Fulltext
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.
Distributed computer architectures labeled "peer-to-peer" are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation ...
In this survey, we propose a framework for analyzing peer-to-peer content distribution technologies. ...
ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their insightful comments and suggestions. ...
doi:10.1145/1041680.1041681
fatcat:yr4rk6umqnbivp2jumyce6q45m
Idology and Its Applications in Public Security and Network Security
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Compare asymmetric RFIDs with BFIDs, and point out that a BFID is lightweight, economical, convenient, and environmentalistic, and more suitable for the anti-counterfeiting and source tracing of consumable ...
The authors design the structure of a united verification platform for BFIDs and the composition of an identification system, and discuss the wide applications of BFIDs in public security and network security ...
mobile number supplies shared storage and verification services for a wide variety of users or lessees . ere ƀ i = ḅ i 2 i with i = b i + (1) OUTPUT: a digest i easily known from D …b n 0. ...
arXiv:1609.05601v6
fatcat:h73taoiolfbuzhf73thd7z24om
Higher SLA satisfaction in datacenters with continuous VM placement constraints
2013
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems - HotDep '13
Preserved Fulltext
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.
We define a number of such properties and show that they vary widely among file systems. We conclude with implications for future file-system and dependability research. ...
In this paper, we argue that tracing the locking order, along with the local control-flow path affected by shared variables, allows to dramatically reduce the inference time to find a fault-inducing trace ...
Acknowledgments We wish to thank the anonymous HotDep reviewers for their comments. We also thank Jeff Mogul and Gustavo Alonso for helpful suggestions. ...
doi:10.1145/2524224.2524226
dblp:conf/hotdep/DangH13
fatcat:xe5soaxhengtxcufr5oahrxyoq
« Previous
Showing results 1 — 15 out of 127 results