Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18. PKC 2015: Gaithersburg, MD, USA
- Jonathan Katz:
Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings. Lecture Notes in Computer Science 9020, Springer 2015, ISBN 978-3-662-46446-5
Public-Key Encryption
- Shengli Liu, Kenneth G. Paterson:
Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms. 3-26 - Felix Heuer, Tibor Jager, Eike Kiltz
, Sven Schäge:
On the Selective Opening Security of Practical Public-Key Encryption Schemes. 27-51 - Mihir Bellare, Rafael Dowsley, Sriram Keelveedhi:
How Secure is Deterministic Encryption? 52-73
E-Cash
- Sébastien Canard, David Pointcheval, Olivier Sanders, Jacques Traoré:
Divisible E-Cash Made Practical. 77-100 - Foteini Baldimtsi, Melissa Chase, Georg Fuchsbauer, Markulf Kohlweiss:
Anonymous Transferable E-Cash. 101-124
Cryptanalysis
- Shuji Kijima, Ravi Montenegro:
Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem. 127-149 - Jean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Simona Samardjiska, Enrico Thomae:
A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems. 150-174 - Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich, Valérie Gauthier-Umaña:
A Polynomial-Time Attack on the BBCRS Scheme. 175-193 - Marta Conde Pena, Jean-Charles Faugère, Ludovic Perret:
Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case. 194-213
Digital Signatures I
- David Cash, Rafael Dowsley, Eike Kiltz:
Digital Signatures from Strong RSA without Prime Generation. 217-235 - Jacob Alperin-Sheriff:
Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions. 236-255 - Olivier Blazy, Saqib A. Kakvi, Eike Kiltz, Jiaxin Pan:
Tightly-Secure Signatures from Chameleon Hash Functions. 256-279
Password-Based Authentication
- Jan Camenisch, Robert R. Enderlein, Gregory Neven:
Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions. 283-307 - Mihir Bellare, Viet Tung Hoang:
Adaptive Witness Encryption and Asymmetric Password-Based Cryptography. 308-331 - Michel Abdalla, Fabrice Benhamouda, David Pointcheval:
Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks. 332-352
Pairing-Based Cryptography
- Gilles Barthe, Edvard Fagerholm, Dario Fiore, Andre Scedrov, Benedikt Schmidt, Mehdi Tibouchi:
Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds. 355-376 - Allison B. Lewko, Sarah Meiklejohn:
A Profitable Sub-prime Loan: Obtaining the Advantages of Composite Order in Prime-Order Bilinear Groups. 377-398
Digital Signatures II
- Phong Q. Nguyen, Jiang Zhang, Zhenfeng Zhang:
Simpler Efficient Group Signatures from Lattices. 401-426 - San Ling, Khoa Nguyen, Huaxiong Wang:
Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based. 427-449 - Benoît Libert, Marc Joye, Moti Yung, Thomas Peters:
Secure Efficient History-Hiding Append-Only Signatures in the Standard Model. 450-473
Efficient Constructions
- Florian Bergsma, Tibor Jager, Jörg Schwenk:
One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model. 477-494 - Ignacio Cascudo, Ivan Damgård, Bernardo Machado David, Irene Giacomelli, Jesper Buus Nielsen, Roberto Trifiletti:
Additively Homomorphic UC Commitments with Optimal Amortized Overhead. 495-515 - Mihir Bellare, Sriram Keelveedhi:
Interactive Message-Locked Encryption and Secure Deduplication. 516-538 - Robert Granger, Michael Scott:
Faster ECC over \mathbb F_2^521-1. 539-553
Cryptography with Imperfect Keys
- Baodong Qin, Shengli Liu, Tsz Hon Yuen, Robert H. Deng, Kefei Chen:
Continuous Non-malleable Key Derivation and Its Application to Related-Key Security. 557-578 - Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen, Daniele Venturi:
A Tamper and Leakage Resilient von Neumann Architecture. 579-603 - Nico Döttling:
Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification. 604-626
Interactive Proofs
- David Bernhard, Marc Fischlin, Bogdan Warinschi:
Adaptive Proofs of Knowledge in the Random Oracle Model. 629-649 - Pyrros Chaidos, Jens Groth:
Making Sigma-Protocols Non-interactive Without Random Oracles. 650-670
Lattice-Based Cryptography
- Emmanuela Orsini, Joop van de Pol, Nigel P. Smart:
Bootstrapping BGV Ciphertexts with a Wider Choice of p and q. 673-698 - Ryo Hiromasa, Masayuki Abe, Tatsuaki Okamoto:
Packing Messages and Optimizing Bootstrapping in GSW-FHE. 699-715 - Vadim Lyubashevsky, Daniel Wichs:
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions. 716-730
Identity-Based, Predicate, and Functional Encryption
- Michel Abdalla, Florian Bourse, Angelo De Caro, David Pointcheval:
Simple Functional Encryption Schemes for Inner Products. 733-751 - Romain Gay, Pierrick Méaux, Hoeteck Wee:
Predicate Encryption for Multi-dimensional Range Queries from Lattices. 752-776 - Shashank Agrawal, Shweta Agrawal, Saikrishna Badrinarayanan, Abishek Kumarasubramanian, Manoj Prabhakaran, Amit Sahai:
On the Practical Security of Inner Product Functional Encryption. 777-798 - Dennis Hofheinz, Jessica Koch, Christoph Striecks:
Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting. 799-822
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
