Functional signatures and pseudorandom functions
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Leakage-resilient cryptography from puncturable primitives and obfuscation
- The GGM Function Family Is a Weakly One-Way Family of Functions
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Hierarchical Attribute-Based Signatures
- Constrained pseudorandom functions from homomorphic secret sharing
- IBE with incompressible master secret and small identity secrets
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- A modular approach to unclonable cryptography
- Backward private dynamic searchable encryption with update pattern
- Symmetric Key Exchange with Full Forward Security and Robust Synchronization
- Constrained pseudorandom functions from functional encryption
- Adaptive security in SNARGs via iO and lossy functions
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Function-Dependent Commitments for Verifiable Multi-party Computation
- Key regression from constrained pseudorandom functions
- On the existence of extractable one-way functions
- Indistinguishability obfuscation: from approximate to exact
- The cost of adaptivity in security games on graphs
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Adaptively secure puncturable pseudorandom functions via puncturable identity-based KEMs
- Watermarking PRFs and PKE against quantum adversaries
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Publicly evaluable pseudorandom functions and their applications
- Collusion resistant watermarkable PRFs from standard assumptions
- Leakage resilience from program obfuscation
- Puncturable key wrapping and its applications
- How to Generate and Use Universal Samplers
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs
- Oblivious transfer with constant computational overhead
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Public-key watermarking schemes for pseudorandom functions
- Bicameral and auditably private signatures
- Offline witness encryption with semi-adaptive security
- Delegatable functional signatures
- Functional broadcast encryption with applications to data sharing for cloud storage
- The power of undirected rewindings for adaptive security
- Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups
- Protean Signature Schemes
- Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
- Unlinkable and invisible \(\gamma \)-sanitizable signatures
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- Predicate signatures from pair encodings via dual system proof technique
- Beyond software watermarking: traitor-tracing for pseudorandom functions
- Non-interactive anonymous router with quasi-linear router computation
- Universal samplers with fast verification
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Cutting-edge cryptography through the lens of secret sharing
- A simple construction of iO for Turing machines
- FE and iO for Turing machines from minimal assumptions
- Watermarking PRFs under standard assumptions: public marking and security with extraction queries
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Functional encryption without obfuscation
- Indistinguishability obfuscation from compact functional encryption
- Correlated pseudorandomness from expand-accumulate codes
- Multi-input functional encryption with unbounded-message security
- Watermarking cryptographic functionalities from standard lattice assumptions
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- Simulation-based secure functional encryption in the random oracle model
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Watermarking cryptographic capabilities
- How to avoid obfuscation using witness PRFs
- Limits on the power of indistinguishability obfuscation and functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Sublinear-communication secure multiparty computation does not require FHE
- Constraining pseudorandom functions privately
- From Minicrypt to Obfustopia via private-key functional encryption
- Private puncturable PRFs from standard lattice assumptions
- Programmable distributed point functions
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Multiparty non-interactive key exchange and more from isogenies on elliptic curves
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- On the correlation intractability of obfuscated pseudorandom functions
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- On the (in)security of SNARKs in the presence of oracles
- Verifiable computation for randomized algorithm
- Explainable arguments
- Simple and generic constructions of succinct functional encryption
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- On the complexity of compressing obfuscation
- Multimodal private signatures
- Simpler constructions of asymmetric primitives from obfuscation
- Private functional signatures: definition and construction
- Collusion-resistant functional encryption for RAMs
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Pseudorandom functions: three decades later
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Functional signcryption: notion, construction, and applications
- Adaptive multiparty NIKE
- Constraining and watermarking PRFs from milder assumptions
- Certifying trapdoor permutations, revisited
- A quasipolynomial reduction for generalized selective decryption on trees
- On statistically secure obfuscation with approximate correctness
- Traceable policy-based signatures and instantiation from lattices
- Fully dynamic attribute-based signatures for circuits from codes
This page was built for publication: Functional signatures and pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402990)
