Topics in Cryptology – CT-RSA 2006

DOI10.1007/11605805zbMATH Open1125.94032DBLPconf/ctrsa/2006OpenAlexW2564556261MaRDI QIDQ5898572

Marc Fischlin

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11605805

Mathematics Subject Classification ID

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

Related Items (7)

A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer ⋮ \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits ⋮ A framework for universally composable oblivious transfer from one-round key-exchange ⋮ A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort ⋮ Theory of Cryptography ⋮ (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens ⋮ General composition and universal composability in secure multiparty computation

This page was built for publication: Topics in Cryptology – CT-RSA 2006

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