A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Coding Constructions for Blacklisting Problems without Computational Assumptions
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
Using error-correcting codes, and avoiding any computational assumptions in our constructions, we construct natural schemes that completely avoid any dependence on n in the transmission overhead. ...
Specifically, we construct: (i) (for illustrative purposes,) a randomized scheme where the server's storage is exponential (in n), but the transmission overhead is O(k), and each user's storage is O(kn ...
In this work, we use error-correcting codes and cover-free set systems to yield natural constructions to solve this problem, without the need for any computational assumptions. ...
doi:10.1007/3-540-48405-1_38
fatcat:qs7kfhxvsbcjlg42cbpz7723m4
Blacklisting Misbehaving Users for Enhancing Security in Anonymizing Networks
2013
IOSR Journal of Computer 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 2018; you can also visit the original URL.
The file type is application/pdf.
To address this problem, we present Nymble, a system in which servers can "blacklist" misbehaving users, thereby blocking users without compromising their anonymity. ...
Nymble is a system in which servers can "blacklist" misbehaving users, thereby blocking users without compromising their anonymity and the privacy of blacklisted users is maintained. ...
Problem Definition: Nymble aims for four security goals: Blacklistability, Nonframeability, Rate-limiting and Anonimity. B. ...
doi:10.9790/0661-0951520
fatcat:34ijb5qc35ekzprchmldjqs6oq
PEREA
2008
Proceedings of the 15th ACM conference on Computer and communications security - CCS '08
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 BLAC and EPID, however, the computation required for authentication at the server is linear in the size (L) of the revocation list. ...
We propose PEREA, a new anonymous authentication scheme for which this bottleneck computation is independent of the size of the revocation list. ...
Using our source code for BLAC, we compared its efficiency with PEREA. Since our PEREA prototype is not multi-threaded, we disabled multi-threading in BLAC's code for a fair comparison. ...
doi:10.1145/1455770.1455813
dblp:conf/ccs/TsangAKS08
fatcat:dksldza3rvgwvpeoyunlslvk7q
BLAC
2010
ACM Transactions on Privacy and Security
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.
Since revoked users remain anonymous, misbehaviors can be judged subjectively without users fearing arbitrary deanonymization by a TTP. ...
Additionally, our construction supports a d-strikes-out revocation policy, whereby users who have been subjectively judged to have repeatedly misbehaved at least d times are revoked from the system. ...
Tsang was a PhD student in the Computer Science program at Dartmouth College, and passed away on October 27, 2009 as a victim to cancer. He was 28 years old. ...
doi:10.1145/1880022.1880033
fatcat:3z7te3274vdbxfnusfkqdeixay
Decentralized Blacklistable Anonymous Credentials with Reputation
[chapter]
2018
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.
To simplify the construction, we also present a generic framework for constructing our new system. ...
trust assumption is made. ...
In the beginning, the ideal world adversary S runs the setup protocol of the decentralized blacklistable anonymous credential system with reputation, and give the generated public parameter params to A ...
doi:10.1007/978-3-319-93638-3_41
fatcat:y3vohfr4cjau7mvs37dqmsydde
Extending Nymble-like Systems
2011
2011 IEEE Symposium on Security and Privacy
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 2016; you can also visit the original URL.
The file type is application/pdf.
We present several extensions to the Nymble framework for anonymous blacklisting systems. First, we show how to distribute the Verinym Issuer as a threshold entity. ...
Finally, we revisit the objective blacklisting mechanism used in Jack, and generalize this idea to enable objective blacklisting in other Nymble-like systems. ...
Acknowledgements: We thank Aniket Kate and the anonymous reviewers for their helpful comments. This work was supported by NSERC, MITACS, and a David R. Cheriton Graduate Scholarship. ...
doi:10.1109/sp.2011.17
dblp:conf/sp/HenryG11a
fatcat:nxkuczzsmvc4bcvt4nezx67qky
Filtering sources of unwanted traffic
2008
2008 Information Theory and Applications Workshop
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 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we develop a family of algorithms that, given a blacklist containing the source IP addresses of unwanted traffic and a constraint on the number of filters, construct a set of filtering rules ...
One way to deal with this problem is to filter unwanted traffic at the routers based on source IP addresses. ...
Since the greedy algorithm has low complexity and computes the optimal, this is the algorithm to use for problem P 0 , for all practical purposes.
B. ...
doi:10.1109/ita.2008.4601049
fatcat:dj2inb7vwjbulok5esixrtrioi
Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
[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 2018; you can also visit the original URL.
The file type is application/pdf.
We construct a novel special honest verifier zero-knowledge argument for correct polynomial evaluation. ...
Non-membership proofs can be used to design anonymous blacklisting schemes allowing online services to block misbehaving users without learning the identity of the user. ...
Furthermore, accumulators rely on cryptographic assumptions that have been less studied than the discrete logarithm problem, for instance the strong RSA assumption or the pairing-based q-SDH assumption ...
doi:10.1007/978-3-642-38348-9_38
fatcat:bstzf6xuebfwxnoee7krnilhzi
Nymble: Blocking Misbehaving Users in Anonymizing Networks
2011
IEEE Transactions on Dependable and Secure 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.
To address this problem, we present Nymble, a system in which servers can "blacklist" misbehaving users, thereby blocking users without compromising their anonymity. ...
Our system is thus agnostic to different servers' definitions of misbehavior -servers can blacklist users for whatever reason, and the privacy of blacklisted users is maintained. ...
We are grateful for the suggestions and help from Roger Dingledine and Nick Mathewson. ...
doi:10.1109/tdsc.2009.38
fatcat:kjhpaoz3gjhljboafvcm6jlu7e
Server-side detection of malware infection
2009
Proceedings of the 2009 workshop on New security paradigms workshop - NSPW '09
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 review the intertwined problems of malware and online fraud, and argue that the fact that service providers often are financially responsible for fraud causes a relative lack of incentives for clients ...
We introduce an exceedingly lightweight audit mechanism to address this need -permitting for post-mortem infection analysis -and prove its security properties based on standard cryptographic hardness assumptions ...
for hosting the workshop. ...
doi:10.1145/1719030.1719033
dblp:conf/nspw/JakobssonJ09
fatcat:vxiggpcjcfb3dii34464gbw5xy
Finite alphabet source recovery in polynomial systems
2002
Systems & control letters (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 2007; you can also visit the original URL.
The file type is application/pdf.
Although it is di cult to derive a condition which is readily veriÿable for most systems, this paper derives a relatively simple condition for source recovery to be feasible in bilinear and other a ne-in-parameter ...
Source recovery endeavours to determine the source vector given only the output vector and, in particular, without knowledge of the parameter vector. ...
The author also thanks Professor Uwe Helmke for critical comments on an earlier draft. ...
doi:10.1016/s0167-6911(02)00180-9
fatcat:3pphqberujgwnnpskig3dykcry
CorLayer: A Transparent Link Correlation Layer for Energy-Efficient Broadcast
2015
IEEE/ACM Transactions on Networking
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 present the design and implementation of CorLayer, a general supporting layer for energy efficient reliable broadcast that carefully blacklists certain poorly correlated wireless links. ...
the performance of network protocols such as broadcast, multi-cast, opportunistic forwarding and network coding. ...
Prabal Dutta and the reviewers for their valuable comments. ...
doi:10.1109/tnet.2014.2347806
fatcat:4nmktx4i7vfbvk5ri6f3uejoby
Page 5993 of Mathematical Reviews Vol. , Issue 2000h
[page]
2000
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
constructions for blacklisting problems without computational assumptions (609-623); R. ...
Lecture Notes in Computer Science, 1666.
Springer-Verlag, Berlin, 1999. xii+639 pp. $91.00. ...
Sparkle
2015
Proceedings of the 5th International Workshop on Cloud Data and Platforms - CloudDP '15
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.
Hence it could also serve as a foundation model for further studies in decentralised scheduling. ...
The pseudo code for determining traffic light colour is given in Algorithm 1. ...
However, with traffic light introduced, it can be deduced that this assumption does not hold for red-coloured workers. ...
doi:10.1145/2744210.2744212
dblp:conf/eurosys/HaoSZZWL15
fatcat:nc4r6uqnp5eprdvqbyi3y3uypu
Making a Nymbler Nymble Using VERBS
[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 2019; you can also visit the original URL.
The file type is application/pdf.
signatures on the output -all without revealing neither the result of the computation, nor any potentially identifying information, to the signature issuing authority. ...
who are responsible for ensuring that no user is able to obtain multiple credentials. ...
Kate, Greg Zaverucha, Jalaj Upadhyay, Mark Giesbrecht, Femi Olumofin, Urs Hengartner, Greta Coger, and the PETS 2010 anonymous reviewers for their helpful suggestions which greatly improved this paper. ...
doi:10.1007/978-3-642-14527-8_7
fatcat:uubde4jjf5fn3gokqncly6shfq
« Previous
Showing results 1 — 15 out of 2,865 results