David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware

DOI10.1007/978-3-540-78967-3_30MaRDI QIDQ5458612zbMATH OpenOpenAlexFDO

Authors Tal Moran, Gil Segev

Publication date 15 April 2008

Published in Advances in Cryptology – EUROCRYPT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78967-3_30

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Reusing tamper-proof hardware in UC-secure protocols
• scientific article; zbMATH DE number 1842484
• Universally composable secure computation with corrupted tokens

Cites work

• A Parallel Repetition Theorem
• Automata, Languages and Programming
• Cryptography in the Multi-string Model
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 1024065 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 1394320 (Why is no real title available?)
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• On the limitations of universally composable two-party computation without set-up assumptions
• Quantum cryptography: public key distribution and coin tossing
• Theory of Cryptography
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• Universally Composable Multiparty Computation with Partially Isolated Parties
• Universally Composable Security with Global Setup
• Universally composable two-party and multi-party secure computation
• Universally composable zero-knowledge arguments and commitments from signature cards

Cited in

(17)

• Pattern matching on encrypted streams
• A unified approach to constructing black-box UC protocols in trusted setup models
• Non-interactive secure computation from one-way functions
• Reusing tamper-proof hardware in UC-secure protocols
• Everlasting UC commitments from fully malicious PUFs
• DL-extractable UC-commitment schemes
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
• UC commitments for modular protocol design and applications to revocation and attribute tokens
• Weakening the isolation assumption of tamper-proof hardware tokens
• Secure outsourced computation
• Secure set intersection with untrusted hardware tokens
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Founding Cryptography on Tamper-Proof Hardware Tokens
• One-Time Programs
• Universally Composable Multi-party Computation Using Tamper-Proof Hardware
• New Constructions for UC Secure Computation Using Tamper-Proof Hardware
• Constant round adaptively secure protocols in the tamper-proof hardware model

Describes a project that uses

Uses Software

• Goliath

This page was built for publication: David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458612)