scientific article; zbMATH DE number 3960854
From MaRDI portal
Publication:3729902
Recommendations
Cited in
(only showing first 100 items - show all)- A proof of security of Yao's protocol for two-party computation
- Separating models of learning with faulty teachers
- Handling expected polynomial-time strategies in simulation-based security proofs
- Reducing complexity assumptions for statistically-hiding commitment
- Upper and lower bounds on black-box steganography
- Cryptography with constant input locality
- An unpredictability approach to finite-state randomness
- A study of password security
- Universal forecasting algorithms
- Almost everywhere high nonuniform complexity
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Definitions and properties of zero-knowledge proof systems
- A random number generator based on elliptic curve operations
- Protecting data privacy in private information retrieval schemes
- Hardness results for neural network approximation problems
- 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
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Pattern matching on encrypted streams
- Quantum algorithms for the \(k\)-XOR problem
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Efficient authentication from hard learning problems
- Keymill: side-channel resilient key generator, a new concept for SCA-security by design
- Leakage-resilient cryptography from puncturable primitives and obfuscation
- Non-interactive secure computation from one-way functions
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- On the impossibility of structure-preserving deterministic primitives
- On the security of the WOTS-PRF signature scheme
- 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
- A randomness test for block ciphers
- Shared generation of pseudo-random functions
- Guaranteeing the diversity of number generators
- A construction of the simplest super pseudorandom permutation generator
- Mathematical problems in cryptology
- Computational indistinguishability: A sample hierarchy
- Revocable hierarchical identity-based encryption with adaptive security
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Private information retrieval with sublinear online time
- Efficient simulation of random states and random unitaries
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Adaptively secure constrained pseudorandom functions in the standard model
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Collision-resistant and pseudorandom function based on Merkle-Damgård hash function
- On the streaming indistinguishability of a random permutation and a random function
- Key-homomorphic pseudorandom functions from LWE with small modulus
- Hidden cosets and applications to unclonable cryptography
- Computational hardness of optimal fair computation: beyond Minicrypt
- Evolving homomorphic secret sharing for hierarchical access structures
- MoSS: modular security specifications framework
- Functional encryption for Turing machines with dynamic bounded collusion from LWE
- Targeted lossy functions and applications
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Efficient noise generation to achieve differential privacy with applications to secure multiparty computation
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
- Incremental cryptography revisited: PRFs, nonces and modular design
- Simpler constructions of asymmetric primitives from obfuscation
- CCA secure \textit{a posteriori} openable encryption in the standard model
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Tree-based cryptographic access control
- Lightweight, maliciously secure verifiable function secret sharing
- Incompressible cryptography
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Batch-OT with optimal rate
- From cryptomania to obfustopia through secret-key functional encryption
- From minicrypt to obfustopia via private-key functional encryption
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- On the universal steganography of optimal rate
- Pseudorandom functions in NC class from the standard LWE assumption
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution
- Obfuscation for cryptographic purposes
- How should we solve search problems privately?
- Bounds on the efficiency of black-box commitment schemes
- Bandwidth-efficient attribute-based key-insulated signatures with message recovery
- 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
- From non-adaptive to adaptive pseudorandom functions
- Computing on authenticated data
- More efficient DDH pseudorandom generators
- Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness
- Hardness-preserving reductions via cuckoo hashing
- Lower bounds and impossibility results for concurrent self composition
- A one-time stegosystem and applications to efficient covert communication
- Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts
- Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
- Practical construction and analysis of pseudo-randomness primitives
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- Pseudorandom sources for BPP
- A new framework for deniable secure key exchange
- Block encryption of quantum messages
- The round complexity of quantum zero-knowledge
- Simulatable verifiable random function from the LWE assumption
- Round-Optimal Password-Based Group Key Exchange Protocols in the Standard Model
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3729902)
