Constrained pseudorandom functions and their applications
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Cutting-edge cryptography through the lens of secret sharing
- Certifying trapdoor permutations, revisited
- 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
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Constrained keys for invertible pseudorandom functions
- Leakage-resilient cryptography from puncturable primitives and obfuscation
- Non-naturally reductive Einstein metrics on \(\mathrm {SO}(n)\)
- Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Private information retrieval with sublinear online time
- Extracting randomness from extractor-dependent sources
- On publicly-accountable zero-knowledge and small shuffle arguments
- Adaptively secure constrained pseudorandom functions in the standard model
- Collusion resistant watermarkable PRFs from standard assumptions
- Hidden cosets and applications to unclonable cryptography
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Simpler constructions of asymmetric primitives from obfuscation
- Incompressible cryptography
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- 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
- Functional broadcast encryption with applications to data sharing for cloud storage
- Constrained pseudorandom functions from functional encryption
- Leakage resilience from program obfuscation
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Key regression from constrained pseudorandom functions
- Adaptively secure constrained pseudorandom functions
- Adaptively secure inner product encryption from LWE
- Security reductions for white-box key-storage in mobile payments
- Multi-client oblivious RAM with poly-logarithmic communication
- Incremental symmetric puncturable encryption with support for unbounded number of punctures
- The cost of adaptivity in security games on graphs
- Short attribute-based signatures for arbitrary Turing machines from standard assumptions
- Round-Optimal Password-Based Group Key Exchange Protocols in the Standard Model
- Indistinguishability obfuscation: from approximate to exact
- On the correlation intractability of obfuscated pseudorandom functions
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Constrained PRFs for unbounded inputs
- How to avoid obfuscation using witness PRFs
- Cutting-edge cryptography through the lens of secret sharing
- Functional encryption without obfuscation
- Constrained PRFs for unbounded inputs with short keys
- Signatures Resilient to Uninvertible Leakage
- On statistically secure obfuscation with approximate correctness
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- On the existence of extractable one-way functions
- Publicly evaluable pseudorandom functions and their applications
- How to Generate and Use Universal Samplers
- One-round attribute-based key exchange in the multi-party setting
- One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model
- Limits on the power of indistinguishability obfuscation and functional encryption
- The GGM Function Family Is a Weakly One-Way Family of Functions
- From cryptomania to obfustopia through secret-key functional encryption
- Single-key to multi-key functional encryption with polynomial loss
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- Indistinguishability obfuscation from compact functional encryption
- A quasipolynomial reduction for generalized selective decryption on trees
- Watermarking cryptographic capabilities
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- One-Round Attribute-Based Key Exchange in the Multi-Party Setting
- scientific article; zbMATH DE number 6866298 (Why is no real title available?)
- How to use indistinguishability obfuscation: deniable encryption, and more
- Pseudorandom functions: three decades later
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Witness maps and applications
- Constraining and watermarking PRFs from milder assumptions
- Key-homomorphic constrained pseudorandom functions
- Functional signatures and pseudorandom functions
- Constrained pseudorandom functions for unconstrained inputs revisited: achieving verifiability and key delegation
- Constraining pseudorandom functions privately
- Universal samplers with fast verification
- From Minicrypt to Obfustopia via private-key functional encryption
- Private puncturable PRFs from standard lattice assumptions
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Cryptography with updates
- Constrained Pseudorandom Functions for Unconstrained Inputs
- Session resumption protocols and efficient forward security for TLS 1.3 0-RTT
- Simple and generic constructions of succinct functional encryption
- Watermarking cryptographic functionalities from standard lattice assumptions
- On the complexity of compressing obfuscation
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
- Obfustopia built on secret-key functional encryption
- Adaptive Security via Deletion in Attribute-Based Encryption: Solutions from Search Assumptions in Bilinear Groups
- Symmetric Key Exchange with Full Forward Security and Robust Synchronization
- Explainable arguments
- One-One Constrained Pseudorandom Functions.
- Sublinear-communication secure multiparty computation does not require FHE
- Pseudorandom correlation functions from variable-density LPN, revisited
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Constrained pseudorandom functions from homomorphic secret sharing
- Programmable distributed point functions
- Forward-secure encryption with fast forwarding
- Adaptive multiparty NIKE
- Puncturable key wrapping and its applications
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
This page was built for publication: Constrained pseudorandom functions and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867158)
