Succinct PPRFs via memory-tight reductions
From MaRDI portal
Cites work
- Adaptive multiparty NIKE
- Adaptively sound zero-knowledge SNARKs for UP
- Barriers in cryptography with weak, correlated and leaky sources
- Breaking the sub-exponential barrier in obfustopia
- CoCoA: concurrent continuous group key agreement
- Continuous group key agreement with active security
- DeCAF: Decentralizable CGKA with fast healing
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Doubly half-injective PRGs for incompressible white-box cryptography
- Efficient schemes for committing authenticated encryption
- Evasive LWE assumptions: definitions, classes, and counterexamples
- Fork-resilient continuous group key agreement
- Grafting key trees: efficient key management for overlapping groups
- Hiding in plain sight: memory-tight proofs via randomness programming
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 3557241 (Why is no real title available?)
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation via mathematical proofs of equivalence
- Memory lower bounds of reductions revisited
- Memory-tight multi-challenge security of public-key encryption
- Memory-tight reductions
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- On extractability obfuscation
- On perfect correctness in (lockable) obfuscation
- On the cost of post-compromise security in concurrent continuous group-key agreement
- On the insider security of MLS
- On the memory-tightness of hashed ElGamal
- On the price of concurrency in group ratcheting protocols
- On the streaming indistinguishability of a random permutation and a random function
- On the worst-case inefficiency of CGKA
- Output-compressing randomized encodings and applications
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
- Public-coin differing-inputs obfuscation and its applications
- Quasi-linear indistinguishability obfuscation via mathematical proofs of equivalence and applications
- Random oracles in a quantum world
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Security analysis and improvements for the IETF MLS standard for group messaging
- Signatures with memory-tight security in the quantum random oracle model
- Succinct garbling and indistinguishability obfuscation for RAM programs
- Succinct randomized encodings and their applications
- Super-linear time-memory trade-offs for symmetric encryption
- The cost of maintaining keys in dynamic groups with applications to multicast encryption and group messaging
- The memory-tightness of authenticated encryption
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Tight time-memory trade-offs for symmetric encryption
This page was built for publication: Succinct PPRFs via memory-tight reductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862731)
