| Updating Key Size Estimations for Pairings |
11 |
| Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression |
7 |
| Nonlinear Invariant Attack: Practical Attack on Full SCREAM, iSCREAM, and Midori64 |
5 |
| Asymptotically Efficient Lattice-Based Digital Signatures |
5 |
| Making the Impossible Possible |
5 |
| Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions |
4 |
| Improved Security Proofs in Lattice-Based Cryptography: Using the R,nyi Divergence Rather than the Statistical Distance |
4 |
| Minimizing the Two-Round Even-Mansour Cipher |
3 |
| Practical Homomorphic Message Authenticators for Arithmetic Circuits |
3 |
| Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions |
3 |
| Multidimensional Linear Cryptanalysis |
3 |
| Making Masking Security Proofs Concrete (Or How to Evaluate the Security of Any Leaking Device), Extended Version |
3 |
| Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting |
3 |
| Classical Leakage Resilience from Fault-Tolerant Quantum Computation |
2 |
| Unifying Leakage Models: From Probing Attacks to Noisy Leakage |
2 |
| Incremental Deterministic Public-Key Encryption |
2 |
| How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function? |
2 |
| Function-Private Functional Encryption in the Private-Key Setting |
2 |
| Small CRT-Exponent RSA Revisited |
2 |
| Beyond Conventional Security in Sponge-Based Authenticated Encryption Modes |
2 |
| Key-Recovery Attacks on ASASA |
2 |
| Efficient Slide Attacks |
1 |
| Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ |
1 |
| Multivariate High-Order Attacks of Shuffled Tables Recomputation |
1 |
| Robust Encryption |
1 |
| Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors |
1 |
| Structure-Preserving Signatures on Equivalence Classes and Constant-Size Anonymous Credentials |
1 |
| Cryptanalysis of the CLT13 Multilinear Map |
0 |
| On Tight Security Proofs for Schnorr Signatures |
0 |
| (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens |
0 |
| Automated Analysis of Cryptographic Assumptions in Generic Group Models |
0 |
| Non-black-box Simulation in the Fully Concurrent Setting, Revisited |
0 |
| From Physical to Stochastic Modeling of a TERO-Based TRNG |
0 |
| Hardness-Preserving Reductions via Cuckoo Hashing |
0 |
| Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier |
0 |
| On the (Im-)Possibility of Extending Coin Toss |
0 |
| Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions |
0 |
| Everlasting Multi-party Computation |
0 |
| Optimal Security Proofs for Full Domain Hash, Revisited |
0 |
| All-But-Many Encryption |
0 |
| A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption |
0 |
| Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings |
0 |
| On the Impossibility of Structure-Preserving Deterministic Primitives |
0 |
| Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem |
0 |
| On the Tightness of Forward-Secure Signature Reductions |
0 |
| Round-Efficient Black-Box Construction of Composable Multi-Party Computation |
0 |
| Constant-Round Maliciously Secure Two-Party Computation in the RAM Model |
0 |
| What Security Can We Achieve Within 4 Rounds? |
0 |
| White-Box Cryptography: Don't Forget About Grey-Box Attacks |
0 |
| Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs |
0 |
