Lower Bounds in the Hardware Token Model

DOI10.1007/978-3-642-54242-8_28MaRDI QIDQ5746358zbMATH OpenOpenAlexFDO

Authors Shashank Agrawal, Vipul Goyal, Manoj Prabhakaran, Alon Rosen, Prabhanjan Ananth

Publication date 18 February 2014

Published in Theory of Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Weakening the isolation assumption of tamper-proof hardware tokens
• Lower bounds for concurrent zero knowledge
• Selected Areas in Cryptography
• Threshold circuit lower bounds on cryptographic functions
• Нижние оценки для практической секретности ключа
• The price of verifiability: lower bounds for verifiable random functions
• Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
• Lower bounds on the efficiency of encryption and digital signature schemes

Cited in

(5)

• General Statistically Secure Computation with Bounded-Resettable Hardware Tokens
• Weakening the isolation assumption of tamper-proof hardware tokens
• Secure computation using leaky tokens
• Interactive locking, zero-knowledge PCPs, and unconditional cryptography
• Unconditional UC-secure computation with (stronger-malicious) PUFs

This page was built for publication: Lower Bounds in the Hardware Token Model

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