Another step towards realizing random oracles: non-malleable point obfuscation
From MaRDI portal
Publication:1648795
DOI10.1007/978-3-319-78381-9_10zbMath1423.94080OpenAlexW2794477358MaRDI QIDQ1648795
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_10
Related Items (7)
One-message zero knowledge and non-malleable commitments ⋮ COA-secure obfuscation and applications ⋮ Augmented random oracles ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ On the obfuscatability of quantum point functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimally fair coin toss
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- On strong simulation and composable point obfuscation
- The first collision for full SHA-1
- Basing cryptographic protocols on tamper-evident seals
- Advances in cryptology -- CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings
- Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
- Non-Malleable Functions and Their Applications
- Point-Function Obfuscation: A Framework and Generic Constructions
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Reusable Fuzzy Extractors for Low-Entropy Distributions
- Instantiating Random Oracles via UCEs
- On Virtual Grey Box Obfuscation for General Circuits
- Point Obfuscation and 3-Round Zero-Knowledge
- Tamper and Leakage Resilience in the Split-State Model
- Cryptographic Primitives Enforcing Communication and Storage Complexity
- The random oracle methodology, revisited
- Expedient Non-malleability Notions for Hash Functions
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Concurrent Nonmalleable Commitments
- On obfuscating point functions
- Practical Identity-Based Encryption Without Random Oracles
- Adaptive One-Way Functions and Applications
- Non-malleable Obfuscation
- Deterministic and Efficiently Searchable Encryption
- A Leakage-Resilient Mode of Operation
- Foundations of Non-malleable Hash and One-Way Functions
- Privacy and Communication Complexity
- Nonmalleable Cryptography
- On perfectly secure communication over arbitrary networks
- Topology-Hiding Computation
- Random-Oracle Uninstantiability from Indistinguishability Obfuscation
- Textbook non-malleable commitments
- How to Break MD5 and Other Hash Functions
- On the (im)possibility of obfuscating programs
- Leakage-Resilient Signatures with Graceful Degradation
- Advances in Cryptology - CRYPTO 2003
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- Simulatable Adaptive Oblivious Transfer
- Finding Collisions in the Full SHA-1
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Public-Key Cryptosystems Resilient to Key Leakage
- On lattices, learning with errors, random linear codes, and cryptography
- Efficient non-malleable commitment schemes
This page was built for publication: Another step towards realizing random oracles: non-malleable point obfuscation
