Abstract is missing.
- Simple Chosen-Ciphertext Security from Low-Noise LPNEike Kiltz, Daniel Masny, Krzysztof Pietrzak. 1-18 [doi]
- Leakage-Flexible CCA-secure Public-Key Encryption: Simple Construction and Free of PairingBaodong Qin, Shengli Liu. 19-36 [doi]
- A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware (sPA1) Encryption SchemeDana Dachman-Soled. 37-55 [doi]
- Chosen Ciphertext Security via UCETakahiro Matsuda 0002, Goichiro Hanaoka. 56-76 [doi]
- Proxy Re-encryption from LatticesElena Kirshanova. 77-94 [doi]
- Re-encryption, Functional Re-encryption, and Multi-hop Re-encryption: A Framework for Achieving Obfuscation-Based Security and Instantiations from LatticesNishanth Chandran, Melissa Chase, Feng-Hao Liu, Ryo Nishimaki, Keita Xagawa. 95-112 [doi]
- Verifiable Set Operations over Outsourced DatabasesRan Canetti, Omer Paneth, Dimitrios Papadopoulos, Nikos Triandopoulos. 113-130 [doi]
- Verifiable Oblivious StorageDaniel Apon, Jonathan Katz, Elaine Shi, Aishwarya Thiruvengadam. 131-148 [doi]
- Achieving Privacy in Verifiable Computation with Multiple Servers - Without FHE and without Pre-processingPrabhanjan Ananth, Nishanth Chandran, Vipul Goyal, Bhavana Kanukurthi, Rafail Ostrovsky. 149-166 [doi]
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly SettingSébastien Canard, David Pointcheval, Olivier Sanders. 167-184 [doi]
- Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial CongruencesJingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, Rina Zeitoun. 185-202 [doi]
- Elliptic and Hyperelliptic Curves: A Practical Security AnalysisJoppe W. Bos, Craig Costello, Andrea Miele. 203-220 [doi]
- Discrete Logarithm in GF(2809) with FFSRazvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, Paul Zimmermann. 221-238 [doi]
- Identity-Based Lossy Trapdoor Functions: New Definitions, Hierarchical Extensions, and ImplicationsAlex Escala, Javier Herranz, Benoît Libert, Carla Ràfols. 239-256 [doi]
- Bounded-Collusion Identity-Based Encryption from Semantically-Secure Public-Key Encryption: Generic Constructions with Short CiphertextsStefano Tessaro, David A. Wilson. 257-274 [doi]
- A Framework and Compact Constructions for Non-monotonic Attribute-Based EncryptionShota Yamada, Nuttapong Attrapadung, Goichiro Hanaoka, Noboru Kunihiro. 275-292 [doi]
- Online/Offline Attribute-Based EncryptionSusan Hohenberger, Brent Waters. 293-310 [doi]
- Scale-Invariant Fully Homomorphic Encryption over the IntegersJean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi. 311-328 [doi]
- Enhanced Chosen-Ciphertext Security and ApplicationsDana Dachman-Soled, Georg Fuchsbauer, Payman Mohassel, Adam O'Neill. 329-344 [doi]
- Lattice-Based Group Signature Scheme with Verifier-Local RevocationAdeline Langlois, San Ling, Khoa Nguyen, Huaxiong Wang. 345-361 [doi]
- Leakage-Resilient Signatures with Graceful DegradationJesper Buus Nielsen, Daniele Venturi, Angela Zottarel. 362-379 [doi]
- On the Lossiness of the Rabin Trapdoor FunctionYannick Seurin. 380-398 [doi]
- Solving Random Subset Sum Problem by l p -norm SVP OracleGengran Hu, Yanbin Pan, Feng Zhang. 399-410 [doi]
- Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal LatticeTsukasa Ishiguro, Shinsaku Kiyomoto, Yutaka Miyake, Tsuyoshi Takagi. 411-428 [doi]
- Lazy Modulus Switching for the BKW Algorithm on LWEMartin R. Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret. 429-445 [doi]
- Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic AssumptionsMartin R. Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret, Yosuke Todo, Keita Xagawa. 446-464 [doi]
- Related Randomness Attacks for Public Key EncryptionKenneth G. Paterson, Jacob C. N. Schuldt, Dale L. Sibborn. 465-482 [doi]
- Encryption Schemes Secure under Related-Key and Key-Dependent Message AttacksFlorian Böhl, Gareth T. Davies, Dennis Hofheinz. 483-500 [doi]
- Functional Signatures and Pseudorandom FunctionsElette Boyle, Shafi Goldwasser, Ioana Ivan. 501-519 [doi]
- Policy-Based SignaturesMihir Bellare, Georg Fuchsbauer. 520-537 [doi]
- Generalizing Homomorphic MACs for Arithmetic CircuitsDario Catalano, Dario Fiore, Rosario Gennaro, Luca Nizzardo. 538-555 [doi]
- General Impossibility of Group Homomorphic Encryption in the Quantum WorldFrederik Armknecht, Tommaso Gagliardoni, Stefan Katzenbeisser, Andreas Peter. 556-573 [doi]
- On Minimal Assumptions for Sender-Deniable Public Key EncryptionDana Dachman-Soled. 574-591 [doi]
- Traceable Group EncryptionBenoît Libert, Moti Yung, Marc Joye, Thomas Peters. 592-610 [doi]
- Practical Covert AuthenticationStanislaw Jarecki. 611-629 [doi]
- Fine-Tuning Groth-Sahai ProofsAlex Escala, Jens Groth. 630-649 [doi]
- Cross-Domain Secure ComputationChongwon Cho, Sanjam Garg, Rafail Ostrovsky. 650-668 [doi]
- On the Security of the Pre-shared Key Ciphersuites of TLSYong Li, Sven Schäge, Zheng Yang, Florian Kohlar, Jörg Schwenk. 669-684 [doi]