Theory of Cryptography

DOI10.1007/11681878zbMath1112.94016OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898363

Tal Malkin, Nikolai Yakovenko, Ryan Moriarty

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/11681878

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (11)

One-message zero knowledge and non-malleable commitments ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Concurrently composable non-interactive secure computation ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Efficient hybrid encryption from ID-based encryption ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ General composition and universal composability in secure multiparty computation

This page was built for publication: Theory of Cryptography