Doubly half-injective PRGs for incompressible white-box cryptography

DOI10.1007/978-3-030-12612-4_10MaRDI QIDQ2290450zbMATH OpenOpenAlexFDO

Authors Estuardo Alpirez Bock, Alessandro Amadori, Joppe W. Bos, Chris Brzuska, W. Michiels

Publication date 28 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-12612-4_10

zbMATH Keywords

incompressibilityone-way permutationswhite-box cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Towards practical whitebox cryptography: optimizing efficiency and space hardness
• A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch
• New constructions of hinting PRGs, OWFs with encryption, and more
• Targeted invertible pseudorandom functions and deterministic format-transforming encryption
• Efficient and Provable White-Box Primitives
• Computing OR on a randomized fixed adversary CRCW PRAM
• Incremental cryptography revisited: PRFs, nonces and modular design
• On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
• On efficient leakage-resilient pseudorandom functions with hard-to-invert leakages
• Towards Security Notions for White-Box Cryptography

Cited in

(7)

• Security reductions for white-box key-storage in mobile payments
• Efficient and Provable White-Box Primitives
• WEM: a new family of white-box block ciphers based on the Even-Mansour construction
• White-box cryptography with global device binding from message-recoverable signatures and token-based obfuscation
• A modular approach to the incompressibility of block-cipher-based AEADs
• Succinct PPRFs via memory-tight reductions
• Simple watermarking pseudorandom functions from extractable pseudorandom generators

This page was built for publication: Doubly half-injective PRGs for incompressible white-box cryptography

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