Recommendations
Cited in
(only showing first 100 items - show all)- Two-round threshold signature from algebraic one-more learning with errors
- Backward private dynamic searchable encryption with update pattern
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Cryptographic group actions and applications
- Pseudorandom functions in NC class from the standard LWE assumption
- Adaptively sound zero-knowledge SNARKs for UP
- Witness encryption and null-iO from evasive LWE
- CCA updatable encryption against malicious re-encryption attacks
- A combinatorial approach to quantum random functions
- Improving speed and security in updatable encryption schemes
- The direction of updatable encryption does not matter much
- Cryptographic primitives with hinting property
- Indistinguishability obfuscation: from approximate to exact
- Incremental symmetric puncturable encryption with support for unbounded number of punctures
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Updatable encryption in distributed storage systems using key-homomorphic pseudorandom functions
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Key-homomorphic constrained pseudorandom functions
- Distributed pseudorandom functions for general access structures in NP
- Updatable tokenization: formal definitions and provably secure constructions
- Symmetric primitives with structured secrets
- Quantum algorithms for the \(k\)-XOR problem
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Distributed broadcast encryption from lattices
- Homomorphic public-key cryptosystems and encrypting Boolean circuits
- Key-homomorphic and aggregate verifiable random functions
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
- Strongly secure universal thresholdizer
- Interval key-encapsulation mechanism
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- An algebraic framework for pseudorandom functions and applications to related-key security
- Cryptanalysis of the CLT13 multilinear map
- Updatable searchable symmetric encryption: definitions and constructions
- Indistinguishability obfuscation from well-founded assumptions
- Unidirectional updatable encryption and proxy re-encryption from DDH
- SoK: signatures with randomizable keys
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Revisiting updatable encryption: controlled forward security, constructions and a puncturable perspective
- Adaptively secure distributed PRFs from LWE
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Return of GGH15: provable security against zeroizing attacks
- Traitor-tracing from LWE made simple and attribute-based
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Minicrypt primitives with algebraic structure and applications
- Functional encryption without obfuscation
- Key-homomorphic pseudorandom functions from LWE with small modulus
- New and improved key-homomorphic pseudorandom functions
- Watermarking cryptographic functionalities from standard lattice assumptions
- Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
- Watermarking cryptographic capabilities
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- LERNA: secure single-server aggregation via key-homomorphic masking
- Private puncturable PRFs from standard lattice assumptions
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model
- No-directional and backward-leak uni-directional updatable encryption are equivalent
- Collusion resistant traitor tracing from learning with errors
- On the correlation intractability of obfuscated pseudorandom functions
- CCA-1 secure updatable encryption with adaptive security
- Efficient secure storage with version control and key rotation
- Homomorphic proxy re-authenticators and applications to verifiable multi-user data aggregation
- Multi-authority ABE from lattices without random oracles
- Multilinear maps from obfuscation
- Updatable encryption from group actions
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- cMix: mixing with minimal real-time asymmetric cryptographic operations
- CCA secure updatable encryption from non-mappable group actions
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
- Revisiting the robustness of (R/M)LWR under polynomial moduli with its applications
- Universally composable password-hardened encryption
- Context-dependent threshold decryption and its applications
- Pilvi: lattice threshold PKE with small decryption shares and improved security
- \textsf{PERKS}: persistent and distributed key acquisition for secure storage from passwords
- Epoch confidentiality in updatable encryption
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Learning with errors over group rings constructed by semi-direct product
- Pseudorandom functions: three decades later
- Forward-secure encryption with fast forwarding
- Traceable ring signatures: general framework and post-quantum security
- CNF-FSS and its applications
- Lattice-based e-cash, revisited
- LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
- Related-key security for pseudorandom functions beyond the linear barrier
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Secure multiparty computation with free branching
- A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems
- Multiparty reusable non-interactive secure computation from LWE
- \textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning
- Towards sound fresh re-keying with hard (physical) learning problems
- Updatable public key encryption in the standard model
- PAORE: public-key authenticated order-revealing encryption
- Hardness of (M)LWE with semi-uniform seeds
- Cryptography with updates
- Unidirectional key update in updatable encryption, revisited
This page was built for publication: Key homomorphic PRFs and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845686)
