On Invertible Sampling and Adaptive Security

DOI10.1007/978-3-642-17373-8_27MaRDI QIDQ3058673zbMATH OpenOpenAlexFDO

Authors Yuval Ishai, Abishek Kumarasubramanian, Claudio Orlandi, Amit Sahai

Publication date 7 December 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-17373-8_27

Mathematics Subject Classification ID

Cryptography (94A60) Sampling theory in information and communication theory (94A20)

Recommendations

• Secure sampling with sublinear communication
• Adaptively secure coin-flipping, revisited
• Secure random sampling in differential privacy
• Provably Secure Steganography and the Complexity of Sampling
• A holistic approach towards side-channel secure fixed-weight polynomial sampling
• Adaptive security of practical garbling schemes
• A Secure Algorithm for Rounded Gaussian Sampling
• Adaptive security with quasi-optimal rate
• Secure computation against adaptive auxiliary information

Cited in

(7)

• Adaptively secure computation for RAM programs
• Better two-round adaptive multi-party computation
• The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
• Candidate obfuscation via oblivious LWE sampling
• Black-box constant-round secure 2PC with succinct communication
• Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness
• On constant-round concurrent zero-knowledge from a knowledge assumption

This page was built for publication: On Invertible Sampling and Adaptive Security

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