-
2
-
-
77956586366
-
-
Department of CS, Yale University, Technical report
-
Aspnes, J., Jackson, C., Krishnamurthy, A.: Exposing computationally-challenged byzantine impostors. Department of CS, Yale University, Technical report (2005)
-
(2005)
Exposing Computationally-Challenged Byzantine Impostors
-
-
Aspnes, J.1
Jackson, C.2
Krishnamurthy, A.3
-
3
-
-
0021980820
-
Trading group theory for randomness
-
Babai, L.: Trading group theory for randomness. In: STOC (1985)
-
(1985)
STOC
-
-
Babai, L.1
-
6
-
-
0027726717
-
Random oracles are practical: A paradigm for designing efficient protocols
-
Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM CCS (1993)
-
(1993)
ACM CCS
-
-
Bellare, M.1
Rogaway, P.2
-
7
-
-
84898960610
-
Completeness theorems for noncryptographic fault-tolerant distributed computation
-
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation. In: STOC (1988)
-
(1988)
STOC
-
-
Ben-Or, M.1
Goldwasser, S.2
Wigderson, A.3
-
8
-
-
70350379222
-
Secure multiparty computation goes live
-
Dingledine, R., Golle, P. (eds.), Springer, Heidelberg
-
Bogetoft, P., Christensen, D.L., Damgård, I., Geisler, M., Jakobsen, T., Krøigaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325–343. Springer, Heidelberg (2009)
-
(2009)
FC 2009. LNCS
, vol.5628
, pp. 325-343
-
-
Bogetoft, P.1
Christensen, D.L.2
Damgård, I.3
Geisler, M.4
Jakobsen, T.5
Krøigaard, M.6
Nielsen, J.D.7
Nielsen, J.B.8
Nielsen, K.9
Pagter, J.10
Schwartzbach, M.11
Toft, T.12
-
9
-
-
0035163054
-
Universally composable security: A new paradigm for cryptographic protocols
-
Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001)
-
(2001)
FOCS
-
-
Canetti, R.1
-
10
-
-
0036038991
-
Universally composable twoparty and multi-party secure computation
-
Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable twoparty and multi-party secure computation. In: STOC (2002)
-
(2002)
STOC
-
-
Canetti, R.1
Lindell, Y.2
Ostrovsky, R.3
Sahai, A.4
-
11
-
-
84957671573
-
Multiparty unconditionally secure protocols (Extended abstract)
-
Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC (1988)
-
(1988)
STOC
-
-
Chaum, D.1
Crépeau, C.2
Damgård, I.3
-
13
-
-
22344447481
-
Byzantine agreement given partial broadcast
-
Considine, J., Fitzi, M., Franklin, M.K., Levin, L.A., Maurer, U.M., Metcalf, D.: Byzantine agreement given partial broadcast. J. Cryptol. 18(3), 191–217 (2005)
-
(2005)
J. Cryptol
, vol.18
, Issue.3
, pp. 191-217
-
-
Considine, J.1
Fitzi, M.2
Franklin, M.K.3
Levin, L.A.4
Maurer, U.M.5
Metcalf, D.6
-
14
-
-
0001683636
-
Authenticated algorithms for byzantine agreement
-
Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656–666 (1983)
-
(1983)
SIAM J. Comput
, vol.12
, Issue.4
, pp. 656-666
-
-
Dolev, D.1
Strong, H.R.2
-
15
-
-
84947273682
-
The sybil attack
-
Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.), Springer, Heidelberg
-
Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002)
-
(2002)
IPTPS 2002. LNCS
, vol.2429
, pp. 251-260
-
-
Douceur, J.R.1
-
16
-
-
84943235829
-
Pricing via processing or combatting junk mail
-
Brickell, E.F. (ed.), Springer, Heidelberg
-
Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139–147. Springer, Heidelberg (1993)
-
(1993)
CRYPTO 1992. LNCS
, vol.740
, pp. 139-147
-
-
Dwork, C.1
Naor, M.2
-
17
-
-
33745136796
-
Pebbling and proofs of work
-
Shoup, V. (ed.), Springer, Heidelberg
-
Dwork, C., Naor, M., Wee, H.M.: Pebbling and proofs of work. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 37–54. Springer, Heidelberg (2005)
-
(2005)
CRYPTO 2005. LNCS
, vol.3621
, pp. 37-54
-
-
Dwork, C.1
Naor, M.2
Wee, H.M.3
-
18
-
-
33845223165
-
A randomized protocol for signing contracts
-
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: CRYPTO (1982)
-
(1982)
CRYPTO
-
-
Even, S.1
Goldreich, O.2
Lempel, A.3
-
19
-
-
84910683812
-
Majority is not enough: Bitcoin mining is vulnerable
-
Eyal, I., Sirer, E.G.: Majority is not enough: Bitcoin mining is vulnerable. In: Financial Cryptography (2014)
-
(2014)
Financial Cryptography
-
-
Eyal, I.1
Sirer, E.G.2
-
21
-
-
0040597467
-
Private coins versus public coins in interactive proof systems
-
Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: STOC (1986)
-
(1986)
STOC
-
-
Goldwasser, S.1
Sipser, M.2
-
22
-
-
84873944088
-
Universally composable synchronous computation
-
Sahai, A. (ed.), Springer, Heidelberg
-
Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477–498. Springer, Heidelberg (2013)
-
(2013)
TCC 2013. LNCS
, vol.7785
, pp. 477-498
-
-
Katz, J.1
Maurer, U.2
Tackmann, B.3
Zikas, V.4
-
23
-
-
84943379751
-
Pseudonymous secure computation from time-lock puzzles
-
report 2014/857
-
Katz, J., Miller, A., Shi, E.: Pseudonymous secure computation from time-lock puzzles. Cryptology ePrint Archive, report 2014/857, 2014
-
(2014)
Cryptology Eprint Archive
-
-
Katz, J.1
Miller, A.2
Shi, E.3
-
24
-
-
84976699318
-
The byzantine generals problem
-
Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
-
(1982)
ACM Trans. Program. Lang. Syst
, vol.4
, Issue.3
, pp. 382-401
-
-
Lamport, L.1
Shostak, R.2
Pease, M.3
-
25
-
-
77952345661
-
Split-ballot voting: Everlasting privacy with distributed trust
-
Moran, T., Naor, M.: Split-ballot voting: everlasting privacy with distributed trust. In: ACM CCS (2007)
-
(2007)
ACM CCS
-
-
Moran, T.1
Naor, M.2
-
27
-
-
0020829007
-
Transaction protection by beacons
-
Rabin, M.O.: Transaction protection by beacons. J. Comput. Syst. Sci. 27(2), 256–267 (1983)
-
(1983)
J. Comput. Syst. Sci
, vol.27
, Issue.2
, pp. 256-267
-
-
Rabin, M.O.1
-
30
-
-
79961186203
-
Protocols for secure computations (Extended abstract)
-
Yao, A.C-C.: Protocols for secure computations (extended abstract). In: FOCS (1982)
-
(1982)
FOCS
-
-
Yao, A.C.-C.1
|