On the complexity of simulating auxiliary input

DOI10.1007/978-3-319-78372-7_12MaRDI QIDQ1653096zbMATH OpenOpenAlexFDO

Authors Yi-Hsiu Chen, Kai-Min Chung, Jyun-Jie Liao

Publication date 17 July 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78372-7_12

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Simulating auxiliary inputs, revisited
• How to fake auxiliary input
• The impossibility of obfuscation with auxiliary input or a universal simulator
• How to simulate it -- a tutorial on the simulation proof technique
• Efficiently simulating high min-entropy sources in the presence of side information

Cited in

(5)

• ABE for circuits with constant-size secret keys and adaptive security
• Simulating auxiliary inputs, revisited
• Amplifying the security of functional encryption, unconditionally
• How to fake auxiliary input
• Computational two-party correlation: a dichotomy for key-agreement protocols

This page was built for publication: On the complexity of simulating auxiliary input

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