Corpus ID: 6117736

How to Use SNARKs in Universally Composable Protocols

@article{Kosba2015HowTU,
  title={How to Use SNARKs in Universally Composable Protocols},
  author={A. Kosba and Zhichao Zhao and A. Miller and Y. Qian and T.-H. Hubert Chan and Charalampos Papamanthou and R. Pass and A. Shelat and E. Shi},
  journal={IACR Cryptol. ePrint Arch.},
  year={2015},
  volume={2015},
  pages={1093}
}
  • A. Kosba, Zhichao Zhao, +6 authors E. Shi
  • Published 2015
  • Computer Science
  • IACR Cryptol. ePrint Arch.
  • The past several years have seen tremendous advances in practical, general-purpose, noninteractive proof systems called SNARKs. These building blocks are efficient and convenient, with multiple publicly available implementations, including tools to compile high-level code (e.g., written in C) to arithmetic circuits, the native representation used by SNARK constructions. However, while we would like to use these primitives in UC-secure protocols—which are provably-secure even when composed with… CONTINUE READING
    Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
    • 1,038
    • Open Access
    On Scaling Decentralized Blockchains - (A Position Paper)
    • 397
    • Open Access
    The Ring of Gyges: Investigating the Future of Criminal Smart Contracts
    • 110
    • Open Access
    Simulation-Extractable SNARKs Revisited
    • 9
    • Open Access
    Sublinear Zero-Knowledge Arguments for RAM Programs
    • 9
    • Open Access
    Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake
    • 15
    • Open Access
    Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal
    • 10
    • Open Access
    Provable Security for Cryptocurrencies
    • 4
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 49 REFERENCES
    Universally composable security: a new paradigm for cryptographic protocols
    • 2,532
    • Open Access
    Zerocash: Decentralized Anonymous Payments from Bitcoin
    • 893
    • Open Access
    Pinocchio: Nearly Practical Verifiable Computation
    • 255
    • Open Access
    Universal Composition with Joint State
    • 254
    • Open Access
    Universally Composable Security with Global Setup
    • 262
    • Open Access