-
3
-
-
0001126172
-
Pricing via processing or combatting junk mail
-
C. Dwork and M. Naor, "Pricing via processing or combatting junk mail," in CRYPTO, 1993.
-
(1993)
CRYPTO
-
-
Dwork, C.1
Naor, M.2
-
4
-
-
70449877805
-
Folding@ home: Lessons from eight years of volunteer distributed computing
-
A. L. Beberg, D. L. Ensign, G. Jayachandran, S. Khaliq, and V. S. Pande, "Folding@ home: Lessons from eight years of volunteer distributed computing," in Parallel & Distributed Processing (IPDPS), 2009, pp. 1-8.
-
(2009)
Parallel & Distributed Processing (IPDPS)
, pp. 1-8
-
-
Beberg, A.L.1
Ensign, D.L.2
Jayachandran, G.3
Khaliq, S.4
Pande, V.S.5
-
5
-
-
74049103479
-
PORs: Proofs of retrievability for large files
-
A. Juels and B. S. Kaliski Jr, "PORs: Proofs of retrievability for large files," in ACM CCS, 2007, pp. 584-597.
-
(2007)
ACM CCS
, pp. 584-597
-
-
Juels, A.1
Kaliski, B.S.2
-
6
-
-
84966956460
-
Understanding cloud failures
-
28 Nov.
-
R. K. Ko, S. S. Lee, and V. Rajan, "Understanding cloud failures," IEEE Spectrum, vol. 49, no. 12, 28 Nov. 2012.
-
(2012)
IEEE Spectrum
, vol.49
, Issue.12
-
-
Ko, R.K.1
Lee, S.S.2
Rajan, V.3
-
8
-
-
17544377746
-
Oceanstore: An architecture for global-scale persistent storage
-
J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer et al., "Oceanstore: An architecture for global-scale persistent storage," ACM Sigplan Notices, vol. 35, no. 11, pp. 190-201, 2000.
-
(2000)
ACM Sigplan Notices
, vol.35
, Issue.11
, pp. 190-201
-
-
Kubiatowicz, J.1
Bindel, D.2
Chen, Y.3
Czerwinski, S.4
Eaton, P.5
Geels, D.6
Gummadi, R.7
Rhea, S.8
Weatherspoon, H.9
Weimer, W.10
-
9
-
-
84893243047
-
Information propagation in the Bitcoin network
-
C. Decker and R. Wattenhofer, "Information propagation in the Bitcoin network," in IEEE P2P, 2013.
-
(2013)
IEEE P2P
-
-
Decker, C.1
Wattenhofer, R.2
-
10
-
-
74049144464
-
HAIL: A highavailability and integrity layer for cloud storage
-
K. D. Bowers, A. Juels, and A. Oprea, "HAIL: a highavailability and integrity layer for cloud storage," in ACM CCS, 2009, pp. 187-198.
-
(2009)
ACM CCS
, pp. 187-198
-
-
Bowers, K.D.1
Juels, A.2
Oprea, A.3
-
11
-
-
84914130740
-
Government shutdown closes Library of Congress - Online too
-
1 Oct.
-
C. Kellogg, "Government shutdown closes Library of Congress - online too," Los Angeles Times, 1 Oct. 2013.
-
(2013)
Los Angeles Times
-
-
Kellogg, C.1
-
12
-
-
84910683812
-
Majority is not enough: Bitcoin mining is vulnerable
-
March
-
I. Eyal and E. G. Sirer, "Majority is not enough: Bitcoin mining is vulnerable," in In FC'14), March 2014.
-
(2014)
FC'14
-
-
Eyal, I.1
Sirer, E.G.2
-
13
-
-
84940409394
-
The economics of bitcoin mining or, bitcoin in the presence of adversaries
-
J. A. Kroll, I. C. Davey, and E. W. Felten, "The economics of bitcoin mining or, bitcoin in the presence of adversaries," WEIS, 2013.
-
(2013)
WEIS
-
-
Kroll, J.A.1
Davey, I.C.2
Felten, E.W.3
-
15
-
-
84947431932
-
Better than BiBa: Short onetime signatures with fast signing and verifying
-
Springer
-
L. Reyzin and N. Reyzin, "Better than BiBa: Short onetime signatures with fast signing and verifying," in Information Security and Privacy. Springer, 2002, pp. 144-153.
-
(2002)
Information Security and Privacy
, pp. 144-153
-
-
Reyzin, L.1
Reyzin, N.2
-
16
-
-
84914130737
-
-
online full version:, March
-
A. Miller, A. Juels, E. Shi, B. Parno, and J. Katz, "Permacoin: Repurposing bitcoin work for data preservation," online full version: http://cs.umd.edu/-amiller/permacoin full.pdf, March 2014.
-
(2014)
Permacoin: Repurposing Bitcoin Work for Data Preservation
-
-
Miller, A.1
Juels, A.2
Shi, E.3
Parno, B.4
Katz, J.5
-
17
-
-
84881236275
-
Zerocoin: Anonymous distributed e-cash from bitcoin
-
IEEE
-
I. Miers, C. Garman, M. Green, and A. D. Rubin, "Zerocoin: Anonymous distributed e-cash from bitcoin," in Security and Privacy (SP), 2013 IEEE Symposium on. IEEE, 2013, pp. 397-411.
-
(2013)
Security and Privacy (SP), 2013 IEEE Symposium on
, pp. 397-411
-
-
Miers, I.1
Garman, C.2
Green, M.3
Rubin, A.D.4
-
19
-
-
0003918928
-
-
UC Berkeley, Tech. Rep
-
P. Lyman, H. Varian, J. Dunn, A. Strygin, and K. Swearingen, "How much information?" UC Berkeley, Tech. Rep., 2000.
-
(2000)
How Much Information?
-
-
Lyman, P.1
Varian, H.2
Dunn, J.3
Strygin, A.4
Swearingen, K.5
-
20
-
-
84881259359
-
Pinocchio: Nearly practical verifiable computation
-
B. Parno, C. Gentry, J. Howell, and M. Raykova, "Pinocchio: Nearly practical verifiable computation," in IEEE Symposium on Security and Privacy, 2013, pp. 238-252.
-
(2013)
IEEE Symposium on Security and Privacy
, pp. 238-252
-
-
Parno, B.1
Gentry, C.2
Howell, J.3
Raykova, M.4
-
21
-
-
84888986259
-
Practical dynamic proofs of retrievability
-
E. Shi, E. Stefanov, and C. Papamanthou, "Practical dynamic proofs of retrievability," in ACM CCS, 2013, pp. 325-336.
-
(2013)
ACM CCS
, pp. 325-336
-
-
Shi, E.1
Stefanov, E.2
Papamanthou, C.3
-
23
-
-
85084161366
-
-
DTIC Document, Tech. Rep
-
R. Dingledine, N. Mathewson, and P. Syverson, "Tor: The second-generation onion router," DTIC Document, Tech. Rep., 2004.
-
(2004)
Tor: The Second-generation Onion Router
-
-
Dingledine, R.1
Mathewson, N.2
Syverson, P.3
-
24
-
-
31744450082
-
Advances in prospect theory: Cumulative representation of uncertainty
-
A. Tversky and D. Kahneman, "Advances in prospect theory: Cumulative representation of uncertainty," J. Risk Uncertainty, vol. 5, no. 4, pp. 297-323, 1992.
-
(1992)
J. Risk Uncertainty
, vol.5
, Issue.4
, pp. 297-323
-
-
Tversky, A.1
Kahneman, D.2
-
25
-
-
3142766865
-
Are all lotteries regressive? Evidence from the powerball
-
June
-
E. Oster, "Are all lotteries regressive? evidence from the powerball," National Tax Journal, June, 2004.
-
(2004)
National Tax Journal
-
-
Oster, E.1
-
26
-
-
74049136395
-
Proofs of retrievability: Theory and implementation
-
K. D. Bowers, A. Juels, and A. Oprea, "Proofs of retrievability: Theory and implementation," in CCSW, 2009, pp. 43-54.
-
(2009)
CCSW
, pp. 43-54
-
-
Bowers, K.D.1
Juels, A.2
Oprea, A.3
-
27
-
-
58349118819
-
Compact proofs of retrievability
-
H. Shacham and B. Waters, "Compact proofs of retrievability," in Asiacrypt, 2008, pp. 90-107.
-
(2008)
Asiacrypt
, pp. 90-107
-
-
Shacham, H.1
Waters, B.2
-
28
-
-
74049102823
-
Provable data possession at untrusted stores
-
G. Ateniese et al., "Provable data possession at untrusted stores," in ACM CCS, 2007, pp. 598-609.
-
(2007)
ACM CCS
, pp. 598-609
-
-
Ateniese, G.1
-
29
-
-
0020915882
-
Blind signatures for untraceable payments
-
D. Chaum, "Blind signatures for untraceable payments." in Crypto, vol. 82, 1982, pp. 199-203.
-
(1982)
Crypto
, vol.82
, pp. 199-203
-
-
Chaum, D.1
-
31
-
-
77956586366
-
Exposing computationally-challenged byzantine impostors
-
Yale University, New Haven, CT, Tech. Rep
-
J. Aspnes, C. Jackson, and A. Krishnamurthy, "Exposing computationally-challenged byzantine impostors," Department of Computer Science, Yale University, New Haven, CT, Tech. Rep, 2005.
-
(2005)
Department of Computer Science
-
-
Aspnes, J.1
Jackson, C.2
Krishnamurthy, A.3
-
34
-
-
0036038685
-
Storage management and caching in past, a large-scale, persistent peer-topeer storage utility
-
ACM
-
A. Rowstron and P. Druschel, "Storage management and caching in past, a large-scale, persistent peer-topeer storage utility," in ACM SIGOPS Operating Systems Review, vol. 35, no. 5. ACM, 2001, pp. 188-201.
-
(2001)
ACM SIGOPS Operating Systems Review
, vol.35
, Issue.5
, pp. 188-201
-
-
Rowstron, A.1
Druschel, P.2
-
35
-
-
57349142855
-
Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems
-
-, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," in Middleware, 2001, pp. 329-350.
-
(2001)
Middleware
, pp. 329-350
-
-
Rowstron, A.1
Druschel, P.2
-
36
-
-
0010387472
-
Peer-to-peer data trading to preserve information
-
B. F. Cooper and H. Garcia-Molina, "Peer-to-peer data trading to preserve information," ACM TOIS, vol. 20, no. 2, pp. 133-170, 2002.
-
(2002)
ACM TOIS
, vol.20
, Issue.2
, pp. 133-170
-
-
Cooper, B.F.1
Garcia-Molina, H.2
|