Pages that link to "Item:Q2867158"
From MaRDI portal
The following pages link to Constrained Pseudorandom Functions and Their Applications (Q2867158):
Displaying 50 items.
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Certifying trapdoor permutations, revisited (Q1629429) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries (Q1631357) (← links)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
- Leakage-resilient cryptography from puncturable primitives and obfuscation (Q1710617) (← links)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions (Q1747658) (← links)
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions (Q1753168) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- Extracting randomness from extractor-dependent sources (Q2055613) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- Collusion resistant watermarkable PRFs from standard assumptions (Q2096500) (← links)
- Hidden cosets and applications to unclonable cryptography (Q2120094) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Incompressible cryptography (Q2170026) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- From cryptomania to obfustopia through secret-key functional encryption (Q2175212) (← links)
- From minicrypt to obfustopia via private-key functional encryption (Q2175213) (← links)
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves (Q2191198) (← links)
- Functional broadcast encryption with applications to data sharing for cloud storage (Q2224865) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Key regression from constrained pseudorandom functions (Q2414039) (← links)
- Adaptively secure inner product encryption from LWE (Q2691591) (← links)
- Security reductions for white-box key-storage in mobile payments (Q2692343) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Incremental symmetric puncturable encryption with support for unbounded number of punctures (Q2697484) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions (Q2701493) (← links)
- Round-Optimal Password-Based Group Key Exchange Protocols in the Standard Model (Q2794493) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Perfect Structure on the Edge of Chaos (Q2796138) (← links)
- How to Avoid Obfuscation Using Witness PRFs (Q2799104) (← links)
- Cutting-Edge Cryptography Through the Lens of Secret Sharing (Q2799105) (← links)
- Functional Encryption Without Obfuscation (Q2799106) (← links)
- Constrained PRFs for Unbounded Inputs with Short Keys (Q2822688) (← links)
- Signatures Resilient to Uninvertible Leakage (Q2827729) (← links)
- On Statistically Secure Obfuscation with Approximate Correctness (Q2829230) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- One-Round Attribute-Based Key Exchange in the Multi-party Setting (Q2953862) (← links)
- One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model (Q2980868) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
