Pages that link to "Item:Q2874521"
From MaRDI portal
The following pages link to Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation (Q2874521):
Displaying 50 items.
- Sender dynamic, non-repudiable, privacy-preserving and strong secure group communication protocol (Q778404) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Traitor-tracing from LWE made simple and attribute-based (Q1631335) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- Generic hardness of inversion on ring and its relation to self-bilinear map (Q1989358) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Leakage-resilient key exchange and two-seed extractors (Q2096493) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings (Q2096502) (← links)
- Traceable secret sharing and applications (Q2129017) (← links)
- White box traitor tracing (Q2139638) (← links)
- Constructions for quantum indistinguishability obfuscation (Q2146070) (← links)
- Simpler constructions of asymmetric primitives from obfuscation (Q2152062) (← links)
- Incompressible cryptography (Q2170026) (← links)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions (Q2170046) (← links)
- New approaches to traitor tracing with embedded identities (Q2175935) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- Secret-sharing for NP (Q2397445) (← links)
- Algebraic generalization of Diffie-Hellman key exchange (Q2413287) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- Towards tight adaptive security of non-interactive key exchange (Q2697896) (← links)
- NIKE from affine determinant programs (Q2697912) (← links)
- Round-Optimal Password-Based Group Key Exchange Protocols in the Standard Model (Q2794493) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Reconfigurable Cryptography: A Flexible Approach to Long-Term Security (Q2796136) (← 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)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← 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)
- Separating Computational and Statistical Differential Privacy in the Client-Server Model (Q3179372) (← links)
- Strong Hardness of Privacy from Weak Traitor Tracing (Q3179374) (← links)
- The Complexity of Differential Privacy (Q5021135) (← links)
- Collusion Resistant Traitor Tracing from Learning with Errors (Q5130846) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Universal Samplers with Fast Verification (Q5738767) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Indistinguishability obfuscation (Q6198645) (← links)
