Theory of Cryptography

DOI10.1007/b95566zbMath1197.94184OpenAlexW2498336418MaRDI QIDQ5901786

Alon Rosen, Yan Zong Ding, Danny Harnik, Ronen Shaltiel

Publication date: 14 May 2009

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

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

Mathematics Subject Classification ID

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

Related Items (16)

Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ An improved affine equivalence algorithm for random permutations ⋮ Incompressible cryptography ⋮ High entropy random selection protocols ⋮ Smooth projective hashing and two-message oblivious transfer ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Optimal Reductions Between Oblivious Transfers Using Interactive Hashing ⋮ Information-Theoretic Conditions for Two-Party Secure Function Evaluation ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Fine-grained cryptography revisited ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Weak Oblivious Transfer from Strong One-Way Functions ⋮ On the Power of Secure Two-Party Computation ⋮ Rationality in the Full-Information Model ⋮ The Many Entropies in One-Way Functions ⋮ Two-round oblivious transfer from CDH or LPN

This page was built for publication: Theory of Cryptography