Another step towards realizing random oracles: non-malleable point obfuscation
type: Item
instance of: scholarly article
title: Another step towards realizing random oracles: non-malleable point obfuscation
zbMATH Open document ID: 1423.94080
DOI: 10.1007/978-3-319-78381-9_10
author: Ilan Komargodski
author: Eylon Yogev
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6900680
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 10
OpenAlex ID: W2794477358
cites work: Expedient Non-malleability Notions for Hash Functions
cites work: On the (im)possibility of obfuscating programs
cites work: Deterministic and Efficiently Searchable Encryption
cites work: Instantiating Random Oracles via UCEs
cites work: Point-Function Obfuscation: A Framework and Generic Constructions
cites work: On strong simulation and composable point obfuscation
cites work: On Virtual Grey Box Obfuscation for General Circuits
cites work: Point Obfuscation and 3-Round Zero-Knowledge
cites work: Foundations of Non-malleable Hash and One-Way Functions
cites work: Random-Oracle Uninstantiability from Indistinguishability Obfuscation
cites work: Simulatable Adaptive Oblivious Transfer
cites work: Q4364570
cites work: Reusable Fuzzy Extractors for Low-Entropy Distributions
cites work: The random oracle methodology, revisited
cites work: Q4542530
cites work: Non-malleable Obfuscation
cites work: Non-Malleable Functions and Their Applications
cites work: Q2778839
cites work: Nonmalleable Cryptography
cites work: Efficient non-malleable commitment schemes
cites work: Candidate indistinguishability obfuscation and functional encryption for all circuits
cites work: Practical Identity-Based Encryption Without Random Oracles
cites work: Cryptographic Primitives Enforcing Communication and Storage Complexity
cites work: Textbook non-malleable commitments
cites work: Constant-Round Nonmalleable Commitments from Any One-Way Function
cites work: Adaptive One-Way Functions and Applications
cites work: Unprovable security of perfect NIZK and non-interactive non-malleable commitments
cites work: Concurrent Nonmalleable Commitments
cites work: Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
cites work: The first collision for full SHA-1
cites work: Q2707453
cites work: Finding Collisions in the Full SHA-1
cites work: How to Break MD5 and Other Hash Functions
cites work: On obfuscating point functions
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Universally Composable Multi-party Computation Using Tamper-Proof Hardware
cites work: On perfectly secure communication over arbitrary networks
cites work: Privacy and Communication Complexity
cites work: Basing cryptographic protocols on tamper-evident seals
cites work: An optimally fair coin toss
cites work: Topology-Hiding Computation
cites work: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
cites work: Q4941869
cites work: Q4434879
cites work: Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
cites work: Tamper and Leakage Resilience in the Split-State Model
cites work: Public-Key Cryptosystems Resilient to Key Leakage
cites work: Leakage-Resilient Signatures with Graceful Degradation
cites work: A Leakage-Resilient Mode of Operation
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Advances in cryptology -- CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14--18, 2011. Proceedings
description: scientific article; zbMATH DE number 6900680