default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st 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 II. Lecture Notes in Computer Science 10770, Springer 2018, ISBN 978-3-319-76580-8
Signatures
- Ming-Shing Chen, Andreas Hülsing, Joost Rijneveld, Simona Samardjiska, Peter Schwabe:
SOFIA: MQ MQ -Based Signatures in the QROM. 3-33 - Craig Gentry, Adam O'Neill, Leonid Reyzin:
A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures. 34-57 - San Ling, Khoa Nguyen, Huaxiong Wang, Yanhong Xu:
Constant-Size Group Signatures from Lattices. 58-88 - Ali El Kaafarani, Shuichi Katsumata:
Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices. 89-119
Structure-Preserving Signatures
- Charanjit S. Jutla, Miyako Ohkubo, Arnab Roy:
Improved (Almost) Tightly-Secure Structure-Preserving Signatures. 123-152 - Georg Fuchsbauer, Romain Gay:
Weakly Secure Equivalence-Class Signatures from Standard Assumptions. 153-183
Functional Encryption
- Fuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka:
Simple and Generic Constructions of Succinct Functional Encryption. 187-217 - Xiong Fan, Qiang Tang:
Making Public Key Functional Encryption Function Private, Distributively. 218-244 - Pratish Datta, Tatsuaki Okamoto, Junichi Tomida:
Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption. 245-277
Foundations
- Dana Dachman-Soled, Mukul Kulkarni, Aria Shahverdi:
Local Non-malleable Codes in the Bounded Retrieval Model. 281-311 - Brandon Broadnax, Valerie Fetzer, Jörn Müller-Quade, Andy Rupp:
Non-malleability vs. CCA-Security: The Case of Commitments. 312-337
Obfuscation-Based Cryptographic Constructions
- Thomas Agrikola, Dennis Hofheinz:
Interactively Secure Groups from Obfuscation. 341-370 - Pooya Farshim, Julia Hesse, Dennis Hofheinz, Enrique Larraia:
Graded Encoding Schemes from Obfuscation. 371-400
Protocols
- Benedikt Auerbach, Bertram Poettering:
Hashing Solutions Instead of Generating Problems: On the Interactive Certification of RSA Moduli. 403-430 - Stanislaw Jarecki, Hugo Krawczyk, Maliheh Shirvanian, Nitesh Saxena:
Two-Factor Authentication with End-to-End Password Security. 431-461
Blockchain
- Juan A. Garay, Aggelos Kiayias, Nikos Leonardos, Giorgos Panagiotakos:
Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup. 465-495
Zero-Knowledge
- Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. 499-529 - Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin:
Compact Zero-Knowledge Proofs of Small Hamming Weight. 530-560 - Jonathan Bootle, Jens Groth:
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials. 561-588 - Yi Deng, Xuyang Song, Jingyue Yu, Yu Chen:
On the Security of Classic Protocols for Unique Witness Relations. 589-615
Lattices
- Navid Alamati, Chris Peikert, Noah Stephens-Davidowitz:
New (and Old) Proof Systems for Lattice Problems. 619-643 - Fabrice Benhamouda, Olivier Blazy, Léo Ducas, Willy Quach:
Hash Proof Systems over Lattices Revisited. 644-674 - Chris Peikert, Sina Shiehian:
Privately Constraining and Programming PRFs, the LWE Way. 675-701 - Zvika Brakerski, Elena Kirshanova, Damien Stehlé, Weiqiang Wen:
Learning with Errors and Extrapolated Dihedral Cosets. 702-727 - Andreas Hülsing, Tanja Lange, Kit Smeets:
Rounded Gaussians - Fast and Secure Constant-Time Sampling for Lattice-Based Crypto. 728-757
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 2026-02-16 22:52 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:
