Pages that link to "Item:Q5402990"
From MaRDI portal
The following pages link to Functional Signatures and Pseudorandom Functions (Q5402990):
Displayed 50 items.
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss (Q3181035) (← links)
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption (Q3297610) (← links)
- Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116) (← links)
- A Quasipolynomial Reduction for Generalized Selective Decryption on Trees (Q3457130) (← links)
- Watermarking Cryptographic Capabilities (Q4561266) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- (Q4638057) (← links)
- How to Use Indistinguishability Obfuscation: Deniable Encryption, and More (Q4989921) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Witness Maps and Applications (Q5041158) (← links)
- Constraining and Watermarking PRFs from Milder Assumptions (Q5041166) (← links)
- Constrained Pseudorandom Functions for Unconstrained Inputs Revisited: Achieving Verifiability and Key Delegation (Q5738765) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Universal Samplers with Fast Verification (Q5738767) (← links)
- Predictable Arguments of Knowledge (Q5738785) (← links)
- From Minicrypt to Obfustopia via Private-Key Functional Encryption (Q5738873) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Cryptography with Updates (Q5738983) (← links)
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT (Q5918347) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Watermarking cryptographic functionalities from standard lattice assumptions (Q5918350) (← links)
- On the complexity of compressing obfuscation (Q5918748) (← links)
- Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
- Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation (Q5919024) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups (Q6041288) (← links)
- Symmetric Key Exchange with Full Forward Security and Robust Synchronization (Q6045078) (← links)
- Explainable arguments (Q6045191) (← links)
- Sublinear-communication secure multiparty computation does not require FHE (Q6061356) (← links)
- Pseudorandom correlation functions from variable-density LPN, revisited (Q6067361) (← links)
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness (Q6085266) (← links)
- Constrained pseudorandom functions from homomorphic secret sharing (Q6085268) (← links)
- Multimodal private signatures (Q6104359) (← links)
- Protean Signature Schemes (Q6104624) (← links)
- Function-Dependent Commitments for Verifiable Multi-party Computation (Q6108843) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- IBE with incompressible master secret and small identity secrets (Q6114253) (← links)
- Adaptive multiparty NIKE (Q6114272) (← links)
- Puncturable key wrapping and its applications (Q6132430) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions (Q6134825) (← links)
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs (Q6134855) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
- Oblivious transfer with constant computational overhead (Q6138086) (← links)
- The power of undirected rewindings for adaptive security (Q6145931) (← links)
- Beyond software watermarking: traitor-tracing for pseudorandom functions (Q6157551) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)