Witness encryption and its applications
From MaRDI portal
Publication:5495817
DOI10.1145/2488608.2488667zbMath1293.94066OpenAlexW2085983185MaRDI QIDQ5495817
Amit Sahai, Craig Gentry, Sanjam Garg, Brent Waters
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488667
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)
Related Items
One-Way Functions and (Im)perfect Obfuscation, Witness Maps and Applications, Three-round secure multiparty computation from black-box two-round oblivious transfer, Security definitions on time-lock puzzles, Cutting-edge cryptography through the lens of secret sharing, Registration-based encryption: removing private-key generator from IBE, Succinct non-interactive arguments via linear interactive proofs, A simple construction of iO for Turing machines, The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks, Secret Sharing for mNP: Completeness Results, From Cryptomania to Obfustopia Through Secret-Key Functional Encryption, Practical witness-key-agreement for blockchain-based dark pools financial trading, Survey of information security, Simpler constructions of asymmetric primitives from obfuscation, An improved affine equivalence algorithm for random permutations, Secret-sharing for NP, COA-secure obfuscation and applications, Cryptanalysis of multilinear maps from ideal lattices: revisited, Storing and Retrieving Secrets on a Blockchain, From cryptomania to obfustopia through secret-key functional encryption, Proofs of Work from worst-case assumptions, Attribute based encryption for deterministic finite automata from DLIN, Public-coin differing-inputs obfuscator for hiding-input point function with multi-bit output and its applications, Explainable arguments, Multilinear maps from obfuscation, Multi-key and multi-input predicate encryption from learning with errors, Laconic function evaluation for Turing machines, 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, Transparent batchable time-lock puzzles and applications to Byzantine consensus, Multiparty non-interactive key exchange and more from isogenies on elliptic curves, Identity-based encryption in DDH hard groups, Witness encryption from smooth projective hashing system, Automated analysis of cryptographic assumptions in generic group models, Multi-authority ABE from lattices without random oracles, ABE for circuits with constant-size secret keys and adaptive security, Fully-secure MPC with minimal trust, Witness encryption and null-iO from evasive LWE, Concurrently composable non-interactive secure computation, Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees, Knowledge encryption and its applications to simulatable protocols with low round-complexity, Witness-based searchable encryption, SNARGs for monotone policy batch NP, Candidate witness encryption from lattice techniques, Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication, Astrolabous: a universally composable time-lock encryption scheme, Forward-secure public key encryption without key update from proof-of-stake blockchain, Smooth zero-knowledge hash functions, Universal ring signatures in the standard model, How to use (plain) witness encryption: registered ABE, flexible broadcast, and more, Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness, Disappearing cryptography in the bounded storage model, Offline witness encryption with semi-adaptive security, On the complexity of compressing obfuscation, Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits, Predictable Arguments of Knowledge, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Cryptography with Updates, Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness, Multilinear Maps from Obfuscation, Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs, How to build time-lock encryption, How to Avoid Obfuscation Using Witness PRFs, Cutting-Edge Cryptography Through the Lens of Secret Sharing, Functional Encryption Without Obfuscation, Constrained pseudorandom functions from functional encryption, Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits, Unbounded multi-party computation from learning with errors, Offline Witness Encryption, On the CCA compatibility of public-key infrastructure, The magic of ELFs, How to Use Indistinguishability Obfuscation: Deniable Encryption, and More, On succinct arguments and witness encryption from groups, (Commit-and-prove) predictable arguments with privacy, A gapless code-based hash proof system based on RQC and its applications, Towards witness encryption without multilinear maps, Breaking the Sub-Exponential Barrier in Obfustopia, Weak Zero-Knowledge beyond the Black-Box Barrier, Succinct non-interactive secure computation
