메뉴 건너뛰기




Volumn , Issue , 2016, Pages 839-858

Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts

Author keywords

[No Author keywords available]

Indexed keywords

DATA PRIVACY; PROGRAM COMPILERS;

EID: 84987677692     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2016.55     Document Type: Conference Paper
Times cited : (1975)

References (59)
  • 1
    • 84987662160 scopus 로고    scopus 로고
    • http://koinify.com
  • 2
    • 84987661886 scopus 로고    scopus 로고
    • Amazon ec2 pricing. http://aws.amazon.com/ec2/pricing
  • 3
    • 84987673049 scopus 로고    scopus 로고
    • Augur. http://www.augur.net
  • 4
    • 84987617760 scopus 로고    scopus 로고
    • bitoinj. https://bitcoinj.github.io
  • 6
    • 84987610274 scopus 로고    scopus 로고
    • Skuchain. http://www.skuchain.com
  • 8
    • 84987661889 scopus 로고    scopus 로고
    • Complete characterization of fairness in secure two-party computation of boolean functions
    • G. Asharov, A. Beimel, N. Makriyannis, and E. Omri. Complete characterization of fairness in secure two-party computation of boolean functions. In TCC, 2015
    • (2015) TCC
    • Asharov, G.1    Beimel, A.2    Makriyannis, N.3    Omri, E.4
  • 9
    • 84892153753 scopus 로고
    • Provision of public goods: Fully implementing the core through private contributions
    • M. Bagnoli and B. L. Lipman. Provision of public goods: Fully implementing the core through private contributions. The Review of Economic Studies, 1989
    • (1989) The Review of Economic Studies
    • Bagnoli, M.1    Lipman, B.L.2
  • 12
    • 84889685593 scopus 로고    scopus 로고
    • Snarks for C: Verifying program executions succinctly and in zero knowledge
    • E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, and M. Virza. Snarks for C: verifying program executions succinctly and in zero knowledge. In CRYPTO, 2013
    • (2013) CRYPTO
    • Ben-Sasson, E.1    Chiesa, A.2    Genkin, D.3    Tromer, E.4    Virza, M.5
  • 13
    • 84945197063 scopus 로고    scopus 로고
    • Secure sampling of public parameters for succinct zero knowledge proofs
    • E. Ben-Sasson, A. Chiesa, M. Green, E. Tromer, and M. Virza. Secure sampling of public parameters for succinct zero knowledge proofs. In S and P, 2015
    • (2015) S and P
    • Ben-Sasson, E.1    Chiesa, A.2    Green, M.3    Tromer, E.4    Virza, M.5
  • 14
    • 84945240441 scopus 로고    scopus 로고
    • Scalable zero knowledge via cycles of elliptic curves
    • E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza. Scalable zero knowledge via cycles of elliptic curves. In CRYPTO, 2014
    • (2014) CRYPTO
    • Ben-Sasson, E.1    Chiesa, A.2    Tromer, E.3    Virza, M.4
  • 15
    • 85075922906 scopus 로고    scopus 로고
    • Succinct noninteractive zero knowledge for a von neumann architecture
    • E. Ben-Sasson, A. Chiesa, E. Tromer, and M. Virza. Succinct noninteractive zero knowledge for a von neumann architecture. In Security, 2014
    • (2014) Security
    • Ben-Sasson, E.1    Chiesa, A.2    Tromer, E.3    Virza, M.4
  • 16
    • 55249095082 scopus 로고    scopus 로고
    • Short pcps with polylog query complexity
    • E. Ben-Sasson and M. Sudan. Short pcps with polylog query complexity. SIAM J. Comput., 2008
    • (2008) SIAM J. Comput
    • Ben-Sasson, E.1    Sudan, M.2
  • 17
    • 84945178660 scopus 로고    scopus 로고
    • How to use bitcoin to design fair protocols
    • I. Bentov and R. Kumaresan. How to Use Bitcoin to Design Fair Protocols. In CRYPTO, 2014
    • (2014) CRYPTO
    • Bentov, I.1    Kumaresan, R.2
  • 18
    • 84879803522 scopus 로고    scopus 로고
    • Recursive composition and bootstrapping for snarks and proof-carrying data
    • N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. Recursive composition and bootstrapping for snarks and proof-carrying data. In STOC, 2013
    • (2013) STOC
    • Bitansky, N.1    Canetti, R.2    Chiesa, A.3    Tromer, E.4
  • 19
    • 80052383468 scopus 로고    scopus 로고
    • Sharemind: A framework for fast privacy-preserving computations
    • D. Bogdanov, S. Laur, and J. Willemson. Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS. 2008
    • (2008) ESORICS
    • Bogdanov, D.1    Laur, S.2    Willemson, J.3
  • 21
    • 0035163054 scopus 로고    scopus 로고
    • Universally composable security: A new paradigm for cryptographic protocols
    • R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS, 2001
    • (2001) FOCS
    • Canetti, R.1
  • 22
    • 4944266340 scopus 로고    scopus 로고
    • Universally composable signature, certification, and authentication
    • R. Canetti. Universally composable signature, certification, and authentication. In CSF, 2004
    • (2004) CSF
    • Canetti, R.1
  • 23
    • 44449096427 scopus 로고    scopus 로고
    • Universally composable security with global setup
    • R. Canetti, Y. Dodis, R. Pass, and S. Walfish. Universally composable security with global setup. In TCC. 2007
    • (2007) TCC
    • Canetti, R.1    Dodis, Y.2    Pass, R.3    Walfish, S.4
  • 24
    • 0012610677 scopus 로고
    • Limits on the security of coin flips when half the processors are faulty
    • R. Cleve. Limits on the security of coin flips when half the processors are faulty. In STOC, 1986
    • (1986) STOC
    • Cleve, R.1
  • 26
    • 84945188476 scopus 로고    scopus 로고
    • Pinocchio Coin: Building Zerocoin from a succinct pairing-based proof system
    • G. Danezis, C. Fournet, M. Kohlweiss, and B. Parno. Pinocchio Coin: building Zerocoin from a succinct pairing-based proof system. In PETShop, 2013
    • (2013) PETShop
    • Danezis, G.1    Fournet, C.2    Kohlweiss, M.3    Parno, B.4
  • 27
    • 85003833669 scopus 로고    scopus 로고
    • Bitcoin transaction malleability and mtgox
    • Springer
    • C. Decker and R. Wattenhofer. Bitcoin transaction malleability and mtgox. In ESORICS. Springer, 2014
    • (2014) ESORICS
    • Decker, C.1    Wattenhofer, R.2
  • 29
    • 84910683812 scopus 로고    scopus 로고
    • Majority is not enough: Bitcoin mining is vulnerable
    • I. Eyal and E. G. Sirer. Majority is not enough: Bitcoin mining is vulnerable. In FC, 2014
    • (2014) FC
    • Eyal, I.1    Sirer, E.G.2
  • 31
    • 85076296923 scopus 로고    scopus 로고
    • Zø: An optimizing distributing zeroknowledge compiler
    • M. Fredrikson and B. Livshits. Zø: An optimizing distributing zeroknowledge compiler. In USENIX Security, 2014
    • (2014) USENIX Security
    • Fredrikson, M.1    Livshits, B.2
  • 32
    • 84978170294 scopus 로고    scopus 로고
    • The bitcoin backbone protocol: Analysis and applications
    • J. A. Garay, A. Kiayias, and N. Leonardos. The bitcoin backbone protocol: Analysis and applications. In Eurocrypt, 2015
    • (2015) Eurocrypt
    • Garay, J.A.1    Kiayias, A.2    Leonardos, N.3
  • 33
    • 84889679875 scopus 로고    scopus 로고
    • Quadratic span programs and succinct NIZKs without PCPs
    • R. Gennaro, C. Gentry, B. Parno, and M. Raykova. Quadratic span programs and succinct NIZKs without PCPs. In Eurocrypt, 2013
    • (2013) Eurocrypt
    • Gennaro, R.1    Gentry, C.2    Parno, B.3    Raykova, M.4
  • 35
    • 84987662189 scopus 로고    scopus 로고
    • The ring of gyges: Using smart contracts for crime
    • A. Juels, A. Kosba, and E. Shi. The ring of gyges: Using smart contracts for crime. Manuscript, 2015
    • (2015) Manuscript
    • Juels, A.1    Kosba, A.2    Shi, E.3
  • 39
    • 84893284162 scopus 로고    scopus 로고
    • PCF: A portable circuit format for scalable two-party secure computation
    • B. Kreuter, B. Mood, A. Shelat, and K. Butler. PCF: A portable circuit format for scalable two-party secure computation. In Security, 2013
    • (2013) Security
    • Kreuter, B.1    Mood, B.2    Shelat, A.3    Butler, K.4
  • 40
    • 84910657489 scopus 로고    scopus 로고
    • How to use bitcoin to incentivize correct computations
    • R. Kumaresan and I. Bentov. How to Use Bitcoin to Incentivize Correct Computations. In CCS, 2014
    • (2014) CCS
    • Kumaresan, R.1    Bentov, I.2
  • 41
    • 84945182982 scopus 로고    scopus 로고
    • ObliVM: A programming framework for secure computation
    • C. Liu, X. S. Wang, K. Nayak, Y. Huang, and E. Shi. ObliVM: A programming framework for secure computation. In S and P, 2015
    • (2015) S and P
    • Liu, C.1    Wang, X.S.2    Nayak, K.3    Huang, Y.4    Shi, E.5
  • 43
    • 84881236275 scopus 로고    scopus 로고
    • Zerocoin: Anonymous distributed e-cash from bitcoin
    • I. Miers, C. Garman, M. Green, and A. D. Rubin. Zerocoin: Anonymous Distributed E-Cash from Bitcoin. In S and P, 2013
    • (2013) S and P
    • Miers, I.1    Garman, C.2    Green, M.3    Rubin, A.D.4
  • 44
    • 84893481888 scopus 로고    scopus 로고
    • Authenticated data structures, generically
    • A. Miller, M. Hicks, J. Katz, and E. Shi. Authenticated data structures, generically. In POPL, 2014
    • (2014) POPL
    • Miller, A.1    Hicks, M.2    Katz, J.3    Shi, E.4
  • 46
  • 49
    • 84881259359 scopus 로고    scopus 로고
    • Pinocchio: Nearly practical verifiable computation
    • B. Parno, C. Gentry, J. Howell, and M. Raykova. Pinocchio: Nearly practical verifiable computation. In S and P, 2013
    • (2013) S and P
    • Parno, B.1    Gentry, C.2    Howell, J.3    Raykova, M.4
  • 50
    • 84987961140 scopus 로고    scopus 로고
    • Micropayments for peer-to-peer currencies
    • R. Pass and abhi shelat. Micropayments for peer-to-peer currencies. In CCS, 2015
    • (2015) CCS
    • Pass, R.1    Shelat, A.2
  • 51
    • 84914124819 scopus 로고    scopus 로고
    • Wysteria: A programming language for generic, mixed-mode multiparty computations
    • A. Rastogi, M. A. Hammer, and M. Hicks. Wysteria: A programming language for generic, mixed-mode multiparty computations. In S and P, 2014
    • (2014) S and P
    • Rastogi, A.1    Hammer, M.A.2    Hicks, M.3
  • 52
    • 84900818871 scopus 로고    scopus 로고
    • Quantitative analysis of the full bitcoin transaction graph
    • D. Ron and A. Shamir. Quantitative Analysis of the Full Bitcoin Transaction Graph. In FC, 2013
    • (2013) FC
    • Ron, D.1    Shamir, A.2
  • 53
    • 53249142256 scopus 로고    scopus 로고
    • Formalizing and securing relationships on public networks
    • N. Szabo. Formalizing and securing relationships on public networks. First Monday, 1997
    • (1997) First Monday
    • Szabo, N.1
  • 55
    • 84980096808 scopus 로고
    • Counterspeculation, auctions, and competitive sealed tenders
    • W. Vickrey. Counterspeculation, auctions, and competitive sealed tenders. Journal of finance, 1961
    • (1961) Journal of Finance
    • Vickrey, W.1
  • 56
    • 84964736398 scopus 로고    scopus 로고
    • Efficient RAM and control flow in verifiable outsourced computation
    • R. S. Wahby, S. T. V. Setty, Z. Ren, A. J. Blumberg, and M. Walfish. Efficient RAM and control flow in verifiable outsourced computation. In NDSS, 2015
    • (2015) NDSS
    • Wahby, R.S.1    Setty, S.T.V.2    Ren, Z.3    Blumberg, A.J.4    Walfish, M.5
  • 58
    • 59449105095 scopus 로고    scopus 로고
    • Using replication and partitioning to build secure distributed systems
    • L. Zheng, S. Chong, A. C. Myers, and S. Zdancewic. Using replication and partitioning to build secure distributed systems. In S and P, 2003
    • (2003) S and P
    • Zheng, L.1    Chong, S.2    Myers, A.C.3    Zdancewic, S.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.