A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Efficient Set Operations in the Presence of Malicious Adversaries
2011
Journal of Cryptology
Preserved Fulltext
We revisit the problem of constructing efficient secure twoparty protocols for set-intersection and set-union, focusing on the model of malicious parties. ...
Our protocols readily transform into protocols that are UC-secure. 313 for set-intersection and set-union that are secure in the malicious setting and are of better complexity to those known. ...
Secure Set-Intersection in the Presence of Malicious Adversaries We now get to the main contribution of this work -a protocol that securely computes F ∩ in the presence of malicious adversaries, in the ...
doi:10.1007/s00145-011-9098-x
fatcat:qfhanrutgzgdxescf47mo6qokm
Efficient Set Operations in the Presence of Malicious Adversaries
[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 2018; you can also visit the original URL.
The file type is application/pdf.
We revisit the problem of constructing efficient secure twoparty protocols for set-intersection and set-union, focusing on the model of malicious parties. ...
Our protocols readily transform into protocols that are UC-secure. 313 for set-intersection and set-union that are secure in the malicious setting and are of better complexity to those known. ...
Secure Set-Intersection in the Presence of Malicious Adversaries We now get to the main contribution of this work -a protocol that securely computes F ∩ in the presence of malicious adversaries, in the ...
doi:10.1007/978-3-642-13013-7_19
fatcat:wtswfk6pwrekreoikbnnb7pedy
Privacy-Preserving Data Mining in Presence of Covert Adversaries
[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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, for the first time in data-mining area, we build efficient and secure dot product and set-intersection protocols in covert adversarial model. ...
, we envisage the need for 'covert' adversarial model that performs in between the semi-honest and malicious models, both in terms of security guarantee and computational cost. ...
But this protocol has been shown secure only in the semi-honest adversarial model. Recently, [9] proposed efficient set operations against the malicious adversaries. ...
doi:10.1007/978-3-642-17316-5_41
fatcat:6unizehclbgvddh2jz37xp2c2i
The IPS Compiler: Optimizations, Variants and Concrete Efficiency
[chapter]
2011
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.
In addition, it deepens our understanding of the model of security in the presence of covert adversaries. ...
The IPS compiler has many important properties: it provides a radically different way of obtaining security in the presence of malicious adversaries with no honest majority, it is black-box in the underlying ...
in the presence of malicious adversaries. ...
doi:10.1007/978-3-642-22792-9_15
fatcat:3l2hppqvnngshkovq5dlgf5zdm
Efficient Privacy-Preserving Data Mining in Malicious Model
[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 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we build efficient and secure dot product and set-intersection protocols in malicious model. ...
the assumption of semi-honest adversary is unrealistic in some settings. ...
But this protocol has been shown secure only in the semihonest adversarial model. Recently, [7] proposed efficient set operations against the malicious adversaries. ...
doi:10.1007/978-3-642-17316-5_36
fatcat:voalkktbvnfwvjzfqy63qix3ai
Privacy Protection Against Malicious Adversaries in Distributed Information Sharing Systems
2008
IEEE Transactions on Knowledge and Data Engineering
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 2008; you can also visit the original URL.
The file type is application/pdf.
We consider threats from malicious adversaries that can deviate from the designated protocol and change their input databases. ...
We address issues related to sharing information in a distributed system consisting of autonomous entities, each of which holds a private database. ...
Part of the results in this paper appears in the Proceedings of the International Conference on Very Large Data Bases (VLDB), pp. 889-900, 2005 [17] . ...
doi:10.1109/tkde.2007.1069
fatcat:cmszyufb2jeshbz4t2j7q32qt4
Multi-stage secure clusterhead selection using discrete rule-set against unknown attacks in wireless sensor network
2020
International Journal of Electrical and Computer Engineering (IJECE)
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.
The proposed system also makes construct a rule-set in order to learn the nature of the communication iin order to have a discrete knowledge about the intensity of adversaries. ...
Therefore, this paper introduces a simple and cost-effective modelling of a security system that offers security by ensuring secure selection of clusterhead during the data aggregation process in WSN. ...
This operation is followed by constructing the design in order to investigate the intensity of the attacker followed by applying this rule set in order to ensure proper selection. ...
doi:10.11591/ijece.v10i4.pp4296-4304
fatcat:ykyti6u64fgxpbp65jn5tzxtpm
Efficient Approximate Query Processing in Peer-to-Peer Networks
2007
IEEE Transactions on Knowledge and Data Engineering
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 2008; you can also visit the original URL.
The file type is application/pdf.
We consider threats from malicious adversaries that can deviate from the designated protocol and change their input databases. ...
We address issues related to sharing information in a distributed system consisting of autonomous entities, each of which holds a private database. ...
Any opinions, findings, conclusions, and/or recommendations expressed in this material, either expressed or implied, are those of the authors and do not necessarily reflect the views of the sponsor listed ...
doi:10.1109/tkde.2007.1064
fatcat:zhlfq7zxhncablg7lhljk3h3ye
Secure linear system computation in the presence of malicious adversaries
2014
Science China Information Sciences
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.
Thus, these general results are optimal in this case. In this paper, we construct efficient secure linear system protocols in the presence of malicious adversaries. ...
There are some kind of general solutions that could solve the linear system computation in the presence of malicious adversaries. ...
This work was supported by the National Natural Science Foundation of China (Grant Nos. 61379154 and U1135001). ...
doi:10.1007/s11432-014-5160-2
fatcat:dty32caarfbbhlwztlbfriiep4
Performance evaluation of large-scale dynamic systems
2012
Performance Evaluation Review
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.
Given robust operations and adversarial strategies, we propose an analytical model of the local behavior of clusters, based on Markov chains. ...
open, one needs to defend against the presence of malicious nodes that try to subvert the system. ...
number of malicious peers in the core set is equal to x and the number of malicious peers in the spare set is equal to y. ...
doi:10.1145/2185395.2185447
fatcat:zrtu7vixwzd7bn4sks2d5j6npy
StakeCube: Combining Sharding and Proof-of-Stake to Build Fork-Free Secure Permissionless Distributed Ledgers
[chapter]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
Our work focuses on the design of a scalable permissionless blockchain in the proof-of-stake setting. ...
In particular, we use a distributed hash table as a building block to set up randomized shards, and then leverage the sharded architecture to validate blocks in an efficient manner. ...
, users presence and stake transfer to operate in a PoS setting. ...
doi:10.1007/978-3-030-31277-0_10
fatcat:h6nt6xy2hnhbrhb4vn2y54lof4
Privacy-Preserving Set Operations in the Presence of Rational Parties
2012
2012 26th International Conference on Advanced Information Networking and Applications Workshops
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.
In this paper, we build efficient and private set operations avoiding the use of expensive tools like homomorphic encryption, zero-knowledge proof, and oblivious transfer. ...
Protocols for privacy-preserving set operations have considered semi-honest and malicious adversarial models in cryptographic settings, whereby an adversary is assumed to follow or arbitrarily deviate ...
Malicious adversaries: Security in the presence of malicious parties allows arbitrary deviations from the protocol. ...
doi:10.1109/waina.2012.17
dblp:conf/aina/MiyajiR12
fatcat:yzhskmswzbdcri5hdx2gyoli7a
Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity
2012
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
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.
Specifically, our protocols require O(n 2 kλ) bits of communication andÕ(n 2 λ + (nλ + n 2 )k) group multiplications per player in the malicious adversary setting, where k is the size of each dataset and ...
However, all currently known secure set intersection protocols for n > 2 parties have computational costs that are quadratic in the (maximum) number of entries in the dataset contributed by each party, ...
Construction in Malicious Adversary Model We give a protocol PPSI-MAL securely computing multi-party set intersection in the presence of malicious adversary in the figure 2. ...
doi:10.1587/transfun.e95.a.1366
fatcat:7l6eby3bprei5ej3m4pkly5kdm
PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn
2008
2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing 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 2017; you can also visit the original URL.
The file type is application/pdf.
In spite of a powerful adversary that can inspect the whole system and issue malicious join requests as often as it wishes, Peer-Cube guarantees robust operations in O(logN ) messages, with N the number ...
of peers in the system. ...
Acknowledgment We would like to thank the CAPES-COFECUB program 497-05 for having partially supported this work. ...
doi:10.1109/saso.2008.44
dblp:conf/saso/AnceaumeLRB08
fatcat:cj4r6yqhqjbqjlobkd4ljau5pm
Security and privacy in sensor networks
2003
Computer
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 2004; you can also visit the original URL.
The file type is application/pdf.
Hence, at the software level, sensor networks need new capabilities to ensure secure operation even in the presence of a small number of malicious network nodes. ...
Efficient discovery of the best disjoint paths to use for such an operation is another research challenge. ...
I
Haowen Chan is a doctoral student in the Department of Computer ...
doi:10.1109/mc.2003.1236475
fatcat:jfp7gjnmlzcuxakmtptngrjntu
« Previous
Showing results 1 — 15 out of 13,182 results