On Invertible Sampling and Adaptive Security

DOI10.1007/978-3-642-17373-8_27zbMath1253.94052OpenAlexW1511581834MaRDI QIDQ3058673

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)

Related Items (5)

Adaptively secure computation for RAM programs ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness ⋮ Candidate obfuscation via oblivious LWE sampling

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