Secure two-party computation over a Z-channel

DOI10.1007/978-3-642-24316-5_3MaRDI QIDQ3092345zbMATH OpenOpenAlexFDO

Authors Paolo Palmieri, Olivier Pereira

Publication date 16 September 2011

Published in Provable Security (Search for Journal in Brave)

Full work available at URL http://eprints.bournemouth.ac.uk/22160/1/Palmieri_Pereira_PROVSEC2011.pdf

zbMATH Keywords

cryptography on noisy channelsinformation theoretic securityOblivious transfersecure multi-party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Secure two-party computation over unreliable channels
• Security in Communication Networks
• Constant-rate oblivious transfer from noisy channels
• Efficient oblivious transfer protocols achieving a non-zero rate from any non-trivial noisy correlation
• Oblivious Transfer from Weak Noisy Channels

Cites work

• An analysis of the timed Z-channel
• Building oblivious transfer on channel delays
• Oblivious Transfer from Weak Noisy Channels
• Oblivious-Transfer Amplification
• On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
• On the Oblivious-Transfer Capacity of Noisy Resources
• Security in Communication Networks
• The limiting behavior of the Z-channel (Corresp.)
• Theory of Cryptography

Cited in

(6)

• Secure two-party computation over unreliable channels
• Implementing information-theoretically secure oblivious transfer from packet reordering
• Towards secure two-party computation from the wire-tap channel
• scientific article; zbMATH DE number 1222850 (Why is no real title available?)
• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• Secure computation from elastic noisy channels

This page was built for publication: Secure two-party computation over a Z-channel

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