Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Non-malleable coding against bit-wise and split-state tampering: Label: en
The inverse of \(\chi\) and its applications to Rasta-like ciphers: Label: en
On the communication efficiency of statistically secure asynchronous MPC with optimal resilience: Label: en
Bootstrapping for BGV and BFV revisited: Label: en
Adaptively secure MPC with sublinear communication complexity: Label: en
An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption: Label: en
No-signaling linear PCPs: Label: en
Oblivious RAM with worst-case logarithmic overhead: Label: en
Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH: Label: en
Correction to: ``Locally computable UOWHF with linear shrinkage: Label: en
SLAP: simpler, improved private stream aggregation from ring learning with errors: Label: en
Topical collection on computing on encrypted data: Label: en
On the (in)security of ROS: Label: en
Breaking the decisional Diffie-Hellman problem for class group actions using genus theory: extended version: Label: en
Semi-quantum money: Label: en
Correction to: ``Unconditionally secure computation against low-complexity leakage: Label: en
Locality-preserving oblivious RAM: Label: en
Tight tradeoffs in searchable symmetric encryption: Label: en
Rotational differential-linear cryptanalysis revisited: Label: en
Can PPAD hardness be based on standard cryptographic assumptions?: Label: en
Minicrypt primitives with algebraic structure and applications: Label: en
Bootstrapping for helib: Label: en
On the hardness of module learning with errors with short distributions: Label: en
Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions: Label: en
Tighter security proofs for GPV-IBE in the quantum random oracle model: Label: en
The number of almost perfect nonlinear functions grows exponentially: Label: en
Toward non-interactive zero-knowledge proofs for NP from LWE: Label: en
Obfustopia built on secret-key functional encryption: Label: en
Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1: Label: en
Robust information-theoretic private information retrieval: Label: en
On unconditionally secure distributed oblivious transfer: Label: en
A forward-secure public-key encryption scheme: Label: en
Primality proving via one round in ECPP and one iteration in AKS: Label: en
Experimental quantum cryptography.: Label: en
Pseudorandom generators and the frequency of simplicity: Label: en
Ideal secret sharing schemes with multiple secrets: Label: en
Joint encryption and message-efficient secure computation: Label: en
Efficient cryptographic schemes provably as secure as subset sum: Label: en
Reflection cryptanalysis of PRINCE-like ciphers: Label: en
A unified approach to deterministic encryption: new constructions and a connection to computational entropy: Label: en
Tight security for signature schemes without random oracles: Label: en
Provable unlinkability against traffic analysis with low message overhead: Label: en
Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography: Label: en
Protocols for multiparty coin toss with a dishonest majority: Label: en
How to achieve perfect simulation and a complete problem for non-interactive perfect zero-knowledge: Label: en
On the complexity of constructing pseudorandom functions (especially when they don't exist): Label: en
GNUC: a new universal composability framework: Label: en
Improved single-key attacks on 8-round AES-192 and AES-256: Label: en
Secure multi-party computation without agreement: Label: en
Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography: Label: en