메뉴 건너뛰기




Volumn , Issue , 2014, Pages 459-474

Zerocash: Decentralized anonymous payments from bitcoin

Author keywords

Bitcoin; decentralized electronic cash; zero knowledge

Indexed keywords

KNOWLEDGE MANAGEMENT;

EID: 84910677439     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2014.36     Document Type: Conference Paper
Times cited : (1536)

References (34)
  • 1
    • 0001604533 scopus 로고    scopus 로고
    • Blind signatures for untraceable payments
    • D. Chaum, "Blind signatures for untraceable payments," in CRYPTO '82.
    • CRYPTO '82
    • Chaum, D.1
  • 3
    • 84914126295 scopus 로고    scopus 로고
    • Auditable, anonymous electronic cash
    • T. Sander and A. Ta-Shma, "Auditable, anonymous electronic cash," in CRYPTO '99.
    • CRYPTO '99
    • Sander, T.1    Ta-Shma, A.2
  • 4
    • 84856200215 scopus 로고    scopus 로고
    • An analysis of anonymity in the Bitcoin system
    • F. Reid and H. Martin, "An analysis of anonymity in the Bitcoin system," in SocialCom/PASSAT '11.
    • SocialCom/PASSAT '11
    • Reid, F.1    Martin, H.2
  • 5
    • 84940423444 scopus 로고    scopus 로고
    • Bitter to better - How to make Bitcoin a better currency
    • S. Barber, X. Boyen, E. Shi, and E. Uzun, "Bitter to better - how to make Bitcoin a better currency," in FC '12.
    • FC '12
    • Barber, S.1    Boyen, X.2    Shi, E.3    Uzun, E.4
  • 8
  • 9
    • 79952505412 scopus 로고    scopus 로고
    • Short pairing-based non-interactive zero-knowledge arguments
    • J. Groth, "Short pairing-based non-interactive zero-knowledge arguments," in ASIACRYPT '10.
    • ASIACRYPT '10
    • Groth, J.1
  • 10
    • 84879830090 scopus 로고    scopus 로고
    • Progression-free sets and sublinear pairing-based noninteractive zero-knowledge arguments
    • H. Lipmaa, "Progression-free sets and sublinear pairing-based noninteractive zero-knowledge arguments," in TCC '12.
    • TCC '12
    • Lipmaa, H.1
  • 15
    • 85051020443 scopus 로고    scopus 로고
    • Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
    • H. Lipmaa, "Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes," in ASIACRYPT '13.
    • ASIACRYPT '13
    • Lipmaa, H.1
  • 17
    • 84914126286 scopus 로고    scopus 로고
    • Information propagation in the Bitcoin network
    • C. Decker and R. Wattenhofer, "Information propagation in the Bitcoin network," in P2P '13.
    • P2P '13
    • Decker, C.1    Wattenhofer, R.2
  • 18
  • 19
    • 84914126284 scopus 로고    scopus 로고
    • Pinocchio coin: Building Zerocoin from a succinct pairing-based proof system
    • [Online]
    • G. Danezis, C. Fournet, M. Kohlweiss, and B. Parno, "Pinocchio Coin: building Zerocoin from a succinct pairing-based proof system," in PETShop '13. [Online]. Available: http://www0.cs.ucl.ac.uk/staff/G. Danezis/papers/DanezisFournetKohlweissParno13.pdf
    • PETShop '13
    • Danezis, G.1    Fournet, C.2    Kohlweiss, M.3    Parno, B.4
  • 22
    • 33645588981 scopus 로고    scopus 로고
    • Secure identity based encryption without random oracles
    • D. Boneh and X. Boyen, "Secure identity based encryption without random oracles," in CRYPTO '04.
    • CRYPTO '04
    • Boneh, D.1    Boyen, X.2
  • 23
    • 84914126281 scopus 로고    scopus 로고
    • Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks
    • R. Gennaro, "Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks," in CRYPTO '04.
    • CRYPTO '04
    • Gennaro, R.1
  • 24
    • 85134315885 scopus 로고    scopus 로고
    • Separating succinct non-interactive arguments from all falsifiable assumptions
    • C. Gentry and D. Wichs, "Separating succinct non-interactive arguments from all falsifiable assumptions," in STOC '11.
    • STOC '11
    • Gentry, C.1    Wichs, D.2
  • 25
    • 84856494511 scopus 로고    scopus 로고
    • From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
    • N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer, "From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again," in ITCS '12.
    • ITCS '12
    • Bitansky, N.1    Canetti, R.2    Chiesa, A.3    Tromer, E.4
  • 28
    • 38549138054 scopus 로고    scopus 로고
    • New proofs for NMAC and HMAC: Security without collision-resistance
    • M. Bellare, "New proofs for NMAC and HMAC: security without collision-resistance," in CRYPTO '06.
    • CRYPTO '06
    • Bellare, M.1
  • 30
    • 17144422244 scopus 로고    scopus 로고
    • A proposal for an ISO standard for public key encryption (version 2.1)
    • V. Shoup, "A proposal for an ISO standard for public key encryption (version 2.1)," IACR E-Print Archive, 2001.
    • (2001) IACR E-Print Archive
    • Shoup, V.1
  • 31
    • 23944524767 scopus 로고    scopus 로고
    • [Online]
    • Certicom Research, "SEC 1: Elliptic curve cryptography," 2000. [Online]. Available: http://www.secg.org/collateral/sec1 final.pdf
    • (2000) SEC 1: Elliptic Curve Cryptography
  • 33
    • 84914126277 scopus 로고    scopus 로고
    • Mixminion: Design of a type III anonymous remailer protocol
    • G. Danezis, R. Dingledine, and N. Mathewson, "Mixminion: design of a type III anonymous remailer protocol," in SP '03.
    • SP '03
    • Danezis, G.1    Dingledine, R.2    Mathewson, N.3


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