The following pages link to Bi-Deniable Public-Key Encryption (Q5199211):
Displaying 18 items.
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- An improved algorithm for learning sparse parities in the presence of noise (Q2034402) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- On selective-opening security of deterministic primitives (Q2061952) (← links)
- Fully deniable interactive encryption (Q2096511) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Deniable searchable symmetric encryption (Q2293186) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- A new framework for deniable secure key exchange (Q2672249) (← links)
- On the Hardness of Learning with Rounding over Small Modulus (Q2796126) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Deniable Attribute Based Encryption for Branching Programs from LWE (Q3181031) (← links)
- Deniability of Symmetric Encryption Based on Computational Indistinguishability from Probabilistic Ciphering (Q5117282) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
