scientific article; zbMATH DE number 1842483
From MaRDI portal
zbMath1001.68511MaRDI QIDQ4783716
Amit Sahai, Steven Rudich, Boaz Barak, Ke Yang, Russell Impagliazzo, Oded Goldreich, Salil P. Vadhan
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials, The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO, On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation, How to Compute in the Presence of Leakage, The Journey from NP to TFNP Hardness, Fast and Adaptively Secure Signatures in the Random Oracle Model from Indistinguishability Obfuscation (Short Paper), One-Time Programs with Limited Memory, Limits on the Power of Indistinguishability Obfuscation and Functional Encryption, Verifiable Computation for Randomized Algorithm, Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation, Secret Sharing for mNP: Completeness Results, Secure Obfuscation in a Weak Multilinear Map Model, Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents, Semi-adaptive Security and Bundling Functionalities Made Generic and Easy, From Cryptomania to Obfustopia Through Secret-Key Functional Encryption, Watermarking Cryptographic Capabilities, Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings, Reusable Two-Round MPC from LPN, Traceable PRFs: Full Collusion Resistance and Active Security, Explainable arguments, Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs, On Simplifying Expressions with Mixed Boolean-Arithmetic, Registered attribute-based encryption, Multi-key and multi-input predicate encryption from learning with errors, Broadcast, trace and revoke with optimal parameters from polynomial hardness, Laconic function evaluation for Turing machines, Structure-preserving compilers from new notions of obfuscations, Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation, End-to-end secure messaging with traceability only for illegal content, White-box cryptography with global device binding from message-recoverable signatures and token-based obfuscation, Identity-based encryption in DDH hard groups, TIDE: a novel approach to constructing timed-release encryption, Witness encryption from smooth projective hashing system, Collusion resistant copy-protection for watermarkable functionalities, Rate-1 incompressible encryption from standard assumptions, Fully-secure MPC with minimal trust, The power of natural properties as oracles, Smart contract watermarking based on code obfuscation, On access control encryption without sanitization, Watermarkable public key encryption with efficient extraction under standard assumptions, Witness encryption and null-iO from evasive LWE, Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \), SNARGs for monotone policy batch NP, Generic constructions of master-key KDM secure attribute-based encryption, The pseudorandom oracle model and ideal obfuscation, Computational wiretap coding from indistinguishability obfuscation, Multikey Fully Homomorphic Encryption and Applications, Multi-input attribute based encryption and predicate encryption, Beyond software watermarking: traitor-tracing for pseudorandom functions, On elapsed time consensus protocols, Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation, Public-key watermarking schemes for pseudorandom functions, Lockable obfuscation from circularly insecure fully homomorphic encryption, Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation, Lower bounds for the number of decryption updates in registration-based encryption, PPAD is as hard as LWE and iterated squaring, Instantiability of classical random-oracle-model encryption transforms, Security-preserving distributed samplers: how to generate any CRS in one round without random oracles, How to use (plain) witness encryption: registered ABE, flexible broadcast, and more, Constant input attribute based (and predicate) encryption from evasive and tensor LWE, Indistinguishability obfuscation, Semantics-based software watermarking by abstract interpretation, Structure Versus Hardness Through the Obfuscation Lens, Modeling Random Oracles Under Unpredictable Queries, A Note on Obfuscation for Cryptographic Functionalities of Secret-Operation Then Public-Encryption, Bicompletions of Distance Matrices, Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption, Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Public-Seed Pseudorandom Permutations, Cryptography with Updates, Candidate iO from homomorphic encryption schemes, Private Circuits II: Keeping Secrets in Tamperable Circuits, One-Time Programs, Watermarking cryptographic functionalities from standard lattice assumptions, Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness, Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation, Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions, Can PPAD hardness be based on standard cryptographic assumptions?, Minicrypt primitives with algebraic structure and applications, On the Complexity of Computational Problems Regarding Distributions, Unnamed Item, Secure Obfuscation of Encrypted Verifiable Encrypted Signatures, Creating Transformations for Matrix Obfuscation, Towards Security Notions for White-Box Cryptography, Unnamed Item, Can a Program Reverse-Engineer Itself?, How to Use Indistinguishability Obfuscation: Deniable Encryption, and More, On Symmetric Encryption and Point Obfuscation, Obfuscation of Hyperplane Membership, Founding Cryptography on Tamper-Proof Hardware Tokens, Unnamed Item, Lattice-Based SNARGs and Their Application to More Efficient Obfuscation, In search of an easy witness: Exponential time vs. probabilistic polynomial time., On the round complexity of secure quantum computation, Impossibility of quantum virtual black-box obfuscation of classical circuits, New approaches for quantum copy-protection, Broadcast-optimal two round MPC with an honest majority, Three-round secure multiparty computation from black-box two-round oblivious transfer, Counterexamples to new circular security assumptions underlying iO, Certifying trapdoor permutations, revisited, Upgrading to functional encryption, Registration-based encryption: removing private-key generator from IBE, FE and iO for Turing machines from minimal assumptions, Watermarking PRFs under standard assumptions: public marking and security with extraction queries, White box traitor tracing, Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time, Fiat-Shamir for highly sound protocols is instantiable, Optimizing registration based encryption, Chosen ciphertext secure keyed-homomorphic public-key cryptosystems, Software watermarking: a semantics-based approach, Secret-sharing for NP, Transferable quantum cheque scheme based on quantum public-key cryptography, Generalising the array split obfuscation, Cryptanalysis of candidate obfuscators for affine determinant programs, Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\), Incompressible cryptography, Unclonable polymers and their cryptographic applications, Distributed (correlation) samplers: how to remove a trusted dealer in one round, Single-server private information retrieval with sublinear amortized time, Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions, Obfuscated fuzzy Hamming distance and conjunctions from subset product problems, Attribute based encryption for deterministic finite automata from DLIN, New approaches to traitor tracing with embedded identities, Permuted puzzles and cryptographic hardness, Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications, On virtual grey box obfuscation for general circuits, Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation, Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications, On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input, Multi-input Functional Encryption with Unbounded-Message Security, Verifiable Functional Encryption, How to Generate and Use Universal Samplers, Efficient and Provable White-Box Primitives, Access control encryption with efficient verifiable sanitized decryption, Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting), Leakage-Resilient IND-CCA KEM from the Extractable Hash Proofs with Indistinguishability Obfuscation, One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model, Securely obfuscating re-encryption, Random walks and concurrent zero-knowledge, Offline witness encryption with semi-adaptive security, A low-cost memory remapping scheme for address bus protection, On the obfuscatability of quantum point functions, Towards a theory of data entanglement, Generic hardness of inversion on ring and its relation to self-bilinear map, Obfuscating conjunctions, Efficient obfuscation for CNF circuits and applications in cloud computing, Classical leakage resilience from fault-tolerant quantum computation, White-box cryptography: don't forget about grey-box attacks, Using algebraic models of programs for detecting metamorphic malwares, Lower bounds and the hardness of counting properties, Obfuscation for cryptographic purposes, Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings, On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models, Output-Compressing Randomized Encodings and Applications, Perfect Structure on the Edge of Chaos, How to build time-lock encryption, How to Avoid Obfuscation Using Witness PRFs, Cutting-Edge Cryptography Through the Lens of Secret Sharing, Contention in Cryptoland: Obfuscation, Leakage and UCE, Point-Function Obfuscation: A Framework and Generic Constructions, Obfuscating circuits via composite-order graded encoding, Clever Arbiters Versus Malicious Adversaries, Server-aided private set intersection based on reputation, On best-possible obfuscation, On strong simulation and composable point obfuscation, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information, Candidate iO from homomorphic encryption schemes, Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE, Secure software leasing, Threshold garbled circuits and ad hoc secure computation, Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification, Candidate obfuscation via oblivious LWE sampling, Towards accountability in CRS generation, Non-interactive anonymous router, Offline Witness Encryption, BETA: biometric-enabled threshold authentication, On Adaptively Secure Multiparty Computation with a Short CRS, On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs, Signatures Resilient to Uninvertible Leakage, Shorter Circuit Obfuscation in Challenging Security Models, Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption, On Statistically Secure Obfuscation with Approximate Correctness, On the Existence of Extractable One-Way Functions, Fine-Grained Cryptography, Leakage resilience from program obfuscation, A decentralized multi-authority ciphertext-policy attribute-based encryption with mediated obfuscation, Collusion resistant watermarkable PRFs from standard assumptions, Verifiable registration-based encryption, Keyed-fully homomorphic encryption without indistinguishability obfuscation, IND-secure quantum symmetric encryption based on point obfuscation, Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
