Randomized partial checking revisited

DOI10.1007/978-3-642-36095-4_8MaRDI QIDQ4910229zbMATH OpenOpenAlexFDO

Authors Shahram Khazaei, Douglas Wikström

Publication date 18 March 2013

Published in Topics in Cryptology – CT-RSA 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36095-4_8

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Selected Areas in Cryptography
• Theory of Cryptography
• How to break a practical MIX and design a new one
• Optimistic Mixing for Exit-Polls
• An Efficient Publicly Verifiable Mix-Net for Long Inputs

Cited in

(5)

• Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
• Checking Big Suffix and LCP Arrays by Probabilistic Methods
• scientific article; zbMATH DE number 1884415 (Why is no real title available?)
• cMix: mixing with minimal real-time asymmetric cryptographic operations
• Verifiable Obtained Random Subsets for Improving SPHINCS+

This page was built for publication: Randomized partial checking revisited

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