Strong Conditional Oblivious Transfer and Computing on Intervals

DOI10.1007/978-3-540-30539-2_36zbMath1094.94027OpenAlexW1562018356MaRDI QIDQ5465835

Vladimir Kolesnikov, Ian F. Blake

Publication date: 12 August 2005

Published in: Advances in Cryptology - ASIACRYPT 2004 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30539-2_36

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Secure multi-party computation protocol for sequencing problem ⋮ Constant-round client-aided secure comparison protocol ⋮ Client-Aided Two-Party Secure Interval Test Protocol ⋮ Mathematical analysis and simulation of multiple keys and S-Boxes in a multinode network for secure transmission ⋮ Communication Optimal Tardos-Based Asymmetric Fingerprinting ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ Universally Composable Adaptive Priced Oblivious Transfer ⋮ A Simpler Rate-Optimal CPIR Protocol

This page was built for publication: Strong Conditional Oblivious Transfer and Computing on Intervals