default search action
21st PKC 2018: Rio de Janeiro, Brazil
- Michel Abdalla
, Ricardo Dahab:
Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I. Lecture Notes in Computer Science 10769, Springer 2018, ISBN 978-3-319-76577-8
Key-Dependent-Message and Selective-Opening Security
- Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny:
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. 3-31 - Fuyuki Kitagawa, Keisuke Tanaka:
Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption. 32-61 - Lin Lyu
Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions. 62-92
Searchable and Fully Homomorphic Encryption
- Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs:
Multi-Key Searchable Encryption, Revisited. 95-124 - Yarkin Doröz, Jeffrey Hoffstein
Fully Homomorphic Encryption from the Finite Field Isomorphism Problem. 125-155
Public-Key Encryption
- Federico Giacon, Eike Kiltz
Hybrid Encryption in a Multi-user Setting, Revisited. 159-189 - Federico Giacon, Felix Heuer, Bertram Poettering
KEM Combiners. 190-218 - David Derler
Revisiting Proxy Re-encryption: Forward Secrecy, Improved Security, and Applications. 219-250
Encryption with Bad Randomness
- Zhengan Huang, Junzuo Lai, Wenbin Chen, Man Ho Au, Zhen Peng, Jin Li:
Hedged Nonce-Based Public-Key Encryption: Adaptive Security Under Randomness Failures. 253-279 - Takahiro Matsuda, Jacob C. N. Schuldt:
Related Randomness Security for Public Key Encryption, Revisited. 280-311
Subversion Resistance
- Georg Fuchsbauer:
Subversion-Zero-Knowledge SNARKs. 315-347 - Benedikt Auerbach
Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups. 348-377
Cryptanalysis
- Daniel Hart, DoHoon Kim, Giacomo Micheli, Guillermo Pascual-Perez
A Practical Cryptanalysis of WalnutDSA TM. 381-406 - Gottfried Herold, Elena Kirshanova, Thijs Laarhoven:
Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving. 407-436 - Tadanori Teruya
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem. 437-460
Composable Security
- Jeremias Mechler, Jörn Müller-Quade, Tobias Nilges:
Reusing Tamper-Proof Hardware in UC-Secure Protocols. 463-493 - Christian Badertscher
On Composable Security for Digital Signatures. 494-523
Oblivious Transfer
- Baiyu Li, Daniele Micciancio
Equational Security Proofs of Oblivious Transfer Protocols. 527-553 - Peter Scholl
Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. 554-583
Multiparty Computation
- Tore Kasper Frederiksen, Benny Pinkas, Avishay Yanai
Committed MPC - Maliciously Secure Multiparty Computation from Homomorphic Commitments. 587-619 - Yehuda Lindell, Avishay Yanai
Fast Garbling of Circuits over 3-Valued Logic. 620-643 - Stanislaw Jarecki:
Efficient Covert Two-Party Computation. 644-674 - Deepesh Data, Manoj Prabhakaran:
Towards Characterizing Securely Computable Two-Party Randomized Functions. 675-697 - Yuval Ishai, Manika Mittal, Rafail Ostrovsky:
On the Message Complexity of Secure Multiparty Computation. 698-711
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-11-15 19:46 CET 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: