Strong Conditional Oblivious Transfer and Computing on Intervals

DOI10.1007/978-3-540-30539-2_36MaRDI QIDQ5465835zbMATH OpenOpenAlexFDO

Authors Vladimir Kolesnikov, Ian Blake

Publication date 12 August 2005

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• One-round secure comparison of integers
• Public Key Cryptography - PKC 2006
• Oblivious-Transfer Amplification
• Efficient oblivious transfer protocols
• scientific article; zbMATH DE number 1952770

Cited in

(11)

• Constant-round client-aided secure comparison protocol
• Communication optimal Tardos-based asymmetric fingerprinting
• Client-aided two-party secure interval test protocol
• Universally Composable Adaptive Priced Oblivious Transfer
• Secure multi-party computation protocol for sequencing problem
• One-round secure comparison of integers
• Tight Bounds on Oblivious Chaining
• Mathematical analysis and simulation of multiple keys and S-boxes in a multinode network for secure transmission
• A simpler rate-optimal CPIR protocol
• Public Key Cryptography - PKC 2006
• Secure computation of the median (and other elements of specified ranks)

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

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