Universally composable zero-knowledge arguments and commitments from signature cards

MaRDI QIDQ5445491zbMATH OpenFDO

Authors Dennis Hofheinz, Joern Mueller-Quade, Dominique Unruh

Publication date 5 March 2008

zbMATH Keywords

catalyst functionalitiescommitmentssignature cardsuniversal composabilityzero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Theory of Cryptography
• Long-Term Security and Universal Composability
• Long-term security and universal composability
• scientific article; zbMATH DE number 1942445
• A Framework for Universally Composable Non-committing Blind Signatures

Cited in

(8)

• Everlasting multi-party computation
• Topology-hiding computation for networks with unknown delays
• (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens
• Secure set intersection with untrusted hardware tokens
• Founding Cryptography on Tamper-Proof Hardware Tokens
• Possibility and impossibility results for selective decommitments
• David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
• Long-term security and universal composability

This page was built for publication: Universally composable zero-knowledge arguments and commitments from signature cards

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