ALAMBIC

AppLicAtions of MalleaBIlity in Cryptography
ANR (2016-2020)

Research project funded by the french Agence Nationale de la Recherche (2016-2020).

Partners


  • École normale supérieure / DI-ENS
  • ENS Lyon / LIP
  • Université de Limoges / XLIM
  • Help of the ANR 534,760 euros
  • Beginning and duration of the scientific project: October 2016 - 48 Months
  • Project coordinator: Damien Vergnaud


Project Summary


Cryptography is a crucial and ubiquitous component of information security. It permits to deal with basic computer security needs, related to e.g. confidentiality, privacy, integrity or authentication, but also more unconventional ones. For instance, the basic goal of an encryption scheme is to guarantee the confidentiality of data. However, when encryption schemes are deployed in more complex environments, the demands for security of encryption grow beyond just the basic confidentiality requirement. In 1991, Dolev, Dwork and Naor defined the notion of non-malleability. This ensures that it is infeasible for an adversary to modify ciphertexts into other ciphertexts of messages which are related to the decryption of the first ones. The notion of non-malleability was then applied successfully to various cryptographic primitives such as commitments, zero-knowledge proofs or multi-party computation.

On the other hand, it has been realized that, in specific settings, malleability in cryptographic protocols can actually be a very useful feature. The notion of homomorphic encryption allows specific types of computations to be carried out on ciphertexts and generate an encrypted result which, when decrypted, matches the result of operations performed on the plaintexts. Until recently, all the homomorphic encryption schemes were able to perform only one type of operation (addition or multiplication) on ciphertexts. In 2009, Gentry proposed the first fully homomorphic encryption scheme. His scheme (and subsequent improvements) supports both addition and multiplication and therefore any circuit can be homomorphically evaluated on ciphertexts. The homomorphic property can be used to create secure voting systems, collision-resistant hash functions, private information retrieval schemes, and -- for fully homomorphic encryption -- enables widespread use of cloud computing by ensuring the confidentiality of processed data. Recently, it has been shown that malleability is an interesting feature for other primitives (such as, counter-intuitively, signatures or proof systems) and it is the main goal of this research project to investigate further theoretical and practical AppLicAtions of MalleaBIlity in Cryptography.

In order to reach an accurate analysis that covers a spectrum of study as large as possible, this research proposal focuses on three different aspects: secure computation outsourcing and server-aided cryptography, homomorphic encryption and applications and ``paradoxical'' applications of malleability. More generally, the main objectives of the proposal are the following:

  • Define theoretical models for "malleable" cryptographic primitives that captures strong practical attacks (in particular, in the settings of secure computation outsourcing, server-aided cryptography, cloud computing and cryptographic proof systems);
  • Analyze the security and efficiency of primitives and constructions that rely on malleability;
  • Conceive novel cryptographic primitives and constructions (for secure computation outsourcing, server-aided cryptography, multi-party computation, homomorphic encryption and their applications);
  • Implement these new constructions in order to validate their efficiency and effective security.


Publications


2022

  1. Cryptanalysis of Modular Exponentiation Outsourcing Protocols
    Charles Bouillaguet, Florette Martinez, and Damien Vergnaud
    Comput. J. 65, 9, pp. 2299-2314 (2022).
    open access doi
  2. Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions
    Benoı̂t Libert, Ky Nguyen, and Alain Passelègue
    In Security and Cryptography for Networks - 13th International Conference, SCN 2022, Amalfi, Italy, September 12-14, 2022, Proceedings (Clemente Galdi, and Stanislaw Jarecki, eds), Springer, Lecture Notes in Computer Science, vol. 13409, pp. 336–361 (2022).
    doi
  3. New and Improved Constructions for Partially Equivocable Public Key Encryption
    Benoı̂t Libert, Alain Passelègue, and Mahshid Riahinia
    In Security and Cryptography for Networks - 13th International Conference, SCN 2022, Amalfi, Italy, September 12-14, 2022, Proceedings (Clemente Galdi, and Stanislaw Jarecki, eds), Springer, Lecture Notes in Computer Science, vol. 13409, pp. 197–219 (2022).
    doi
  4. One-Shot Fiat-Shamir-Based NIZK Arguments of Composite Residuosity and Logarithmic-Size Ring Signatures in the Standard Model
    Benoı̂t Libert, Khoa Nguyen, Thomas Peters, and Moti Yung
    In Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part II (Orr Dunkelman, and Stefan Dziembowski, eds), Springer, Lecture Notes in Computer Science, vol. 13276, pp. 488–519 (2022).
    doi
  5. Anamorphic Encryption: Private Communication Against a Dictator
    Giuseppe Persiano, Duong Hieu Phan, and Moti Yung
    In Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part II (Orr Dunkelman, and Stefan Dziembowski, eds), Springer, Lecture Notes in Computer Science, vol. 13276, pp. 34–63 (2022).
    doi
  6. Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model
    Julien Devevey, Benoı̂t Libert, and Thomas Peters
    In Public-Key Cryptography - PKC 2022 - 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8-11, 2022, Proceedings, Part I (Goichiro Hanaoka, Junji Shikata, and Yohei Watanabe, eds), Springer, Lecture Notes in Computer Science, vol. 13177, pp. 615–646 (2022).
    doi

2021

  1. Hardware Security without Secure Hardware: How to Decrypt with a Password and a Server
    Olivier Blazy, Laura Brouilhet, Céline Chevalier, Patrick Towa, Ida Tucker, and Damien Vergnaud
    Theor. Comput. Sci. 895, pp. 178–211 (2021).
    open access doi
  2. Public Key Encryption with Flexible Pattern Matching
    Elie Bouscatié, Guilhem Castagnos, and Olivier Sanders
    In Advances in Cryptology - ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6-10, 2021, Proceedings, Part IV (Mehdi Tibouchi, and Huaxiong Wang, eds), Springer, Lecture Notes in Computer Science, vol. 13093, pp. 342–370 (2021).
    doi
  3. Efficient CCA Timed Commitments in Class Groups
    Sri Aravinda Krishnan Thyagarajan, Guilhem Castagnos, Fabien Laguillaumie, and Giulio Malavolta
    In CCS ’21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021 (Yongdae Kim, Jong Kim, Giovanni Vigna, and Elaine Shi, eds), ACM, pp. 2663–2684 (2021).
    doi
  4. Zero-Knowledge Proofs for Committed Symmetric Boolean Functions
    San Ling, Khoa Nguyen, Duong Hieu Phan, Hanh Tang, and Huaxiong Wang
    In Post-Quantum Cryptography - 12th International Workshop, PQCrypto 2021, Daejeon, South Korea, July 20-22, 2021, Proceedings (Jung Hee Cheon, and Jean-Pierre Tillich, eds), Springer, Lecture Notes in Computer Science, vol. 12841, pp. 339–359 (2021).
    doi
  5. Adaptively Secure Distributed PRFs from sf LWE
    Benoı̂t Libert, Damien Stehlé, and Radu Titiu
    J. Cryptol. 34, 3, pp. 29 (2021).
    doi
  6. Bifurcated Signatures: Folding the Accountability vs. Anonymity Dilemma into a Single Private Signing Scheme
    Benoı̂t Libert, Khoa Nguyen, Thomas Peters, and Moti Yung
    In Advances in Cryptology - EUROCRYPT 2021 - 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17-21, 2021, Proceedings, Part III (Anne Canteaut, and François-Xavier Standaert, eds), Springer, Lecture Notes in Computer Science, vol. 12698, pp. 521–552 (2021).
    doi
  7. Non-interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings
    Julien Devevey, Benoı̂t Libert, Khoa Nguyen, Thomas Peters, and Moti Yung
    In Public-Key Cryptography - PKC 2021 - 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10-13, 2021, Proceedings, Part I (Juan A. Garay, ed), Springer, Lecture Notes in Computer Science, vol. 12710, pp. 659–690 (2021).
    doi
  8. Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
    Céline Chevalier, Fabien Laguillaumie, and Damien Vergnaud
    Algorithmica 83, 1, pp. 72-115 (2021).
    open access doi

2020

  1. Public-Key Generation with Verifiable Randomness
    Olivier Blazy, Patrick Towa, and Damien Vergnaud
    In Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part I (Shiho Moriai, and Huaxiong Wang, eds), Springer, Lecture Notes in Computer Science, vol. 12491, pp. 97–127 (2020).
    open access doi
  2. Catalic: Delegated PSI Cardinality with Applications to Contact Tracing
    Thai Duong, Duong Hieu Phan, and Ni Trieu
    In Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part III (Shiho Moriai, and Huaxiong Wang, eds), Springer, Lecture Notes in Computer Science, vol. 12493, pp. 870–899 (2020).
    doi
  3. Simulation-Sound Arguments for LWE and Applications to KDM-CCA2 Security
    Benoı̂t Libert, Khoa Nguyen, Alain Passelègue, and Radu Titiu
    In Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part I (Shiho Moriai, and Huaxiong Wang, eds), Springer, Lecture Notes in Computer Science, vol. 12491, pp. 128–158 (2020).
    doi
  4. Succinct Diophantine-Satisfiability Arguments
    Patrick Towa, and Damien Vergnaud
    In Advances in Cryptology - ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part III (Shiho Moriai, and Huaxiong Wang, eds), Springer, Lecture Notes in Computer Science, vol. 12493, pp. 774–804 (2020).
    open access doi
  5. A Concise Bounded Anonymous Broadcast Yielding Combinatorial Trace-and-Revoke Schemes
    Xuan Thanh Do, Duong Hieu Phan, and Moti Yung
    In Applied Cryptography and Network Security - 18th International Conference, ACNS 2020, Rome, Italy, October 19-22, 2020, Proceedings, Part II (Mauro Conti, Jianying Zhou, Emiliano Casalicchio, and Angelo Spognardi, eds), Springer, Lecture Notes in Computer Science, vol. 12147, pp. 145–164 (2020).
    doi
  6. Universally Composable Relaxed Password Authenticated Key Exchange
    Michel Abdalla, Manuel Barbosa, Tatiana Bradley, Stanislaw Jarecki, Jonathan Katz, and Jiayu Xu
    In Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part I (Daniele Micciancio, and Thomas Ristenpart, eds), Springer, Lecture Notes in Computer Science, vol. 12170, pp. 278–307 (2020).
    doi
  7. New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More
    Benoı̂t Libert, Alain Passelègue, Hoeteck Wee, and David J. Wu
    In Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10-14, 2020, Proceedings, Part III (Anne Canteaut, and Yuval Ishai, eds), Springer, Lecture Notes in Computer Science, vol. 12107, pp. 410–441 (2020).
    doi
  8. Adaptive Simulation Security for Inner Product Functional Encryption
    Shweta Agrawal, Benoı̂t Libert, Monosij Maitra, and Radu Titiu
    In Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020, Proceedings, Part I (Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, eds), Springer, Lecture Notes in Computer Science, vol. 12110, pp. 34–64 (2020).
    doi
  9. Bandwidth-Efficient Threshold EC-DSA
    Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, and Ida Tucker
    In Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020, Proceedings, Part II (Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, eds), Springer, Lecture Notes in Computer Science, vol. 12111, pp. 266–296 (2020).
    doi
  10. Linearly-Homomorphic Signatures and Scalable Mix-Nets
    Chloé Hébant, Duong Hieu Phan, and David Pointcheval
    In Public-Key Cryptography - PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Edinburgh, UK, May 4-7, 2020, Proceedings, Part II (Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas, eds), Springer, Lecture Notes in Computer Science, vol. 12111, pp. 597–627 (2020).
    doi
  11. Comment on "Efficient and Secure Outsourcing Scheme for RSA Decryption in Internet of Things"
    Damien Vergnaud
    IEEE Internet Things J. 7, 11, pp. 11327-11329 (2020).
    open access doi
  12. Traceable Inner Product Functional Encryption
    Xuan Thanh Do, Duong Hieu Phan, and David Pointcheval
    In Topics in Cryptology - CT-RSA 2020 - The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24-28, 2020, Proceedings (Stanislaw Jarecki, ed), Springer, Lecture Notes in Computer Science, vol. 12006, pp. 564–585 (2020).
    doi

2019

  1. Multi-Client Functional Encryption for Linear Functions in the Standard Model from LWE
    Benoı̂t Libert, and Radu Titiu
    In Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8-12, 2019, Proceedings, Part III (Steven D. Galbraith, and Shiho Moriai, eds), Springer, Lecture Notes in Computer Science, vol. 11923, pp. 520–551 (2019).
    doi
  2. Shorter Pairing-Based Arguments Under Standard Assumptions
    Alonso González, and Carla Ràfols
    In Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8-12, 2019, Proceedings, Part III (Steven D. Galbraith, and Shiho Moriai, eds), Springer, Lecture Notes in Computer Science, vol. 11923, pp. 728–757 (2019).
    doi
  3. Cryptanalysis of Server-Aided RSA Protocols with Private-Key Splitting
    Thierry Mefenza, and Damien Vergnaud
    Comput. J. 62, 8, pp. 1194–1213 (2019).
    doi
  4. ABE for DFA from k-Lin
    Junqing Gong, Brent Waters, and Hoeteck Wee
    In Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II (Alexandra Boldyreva, and Daniele Micciancio, eds), Springer, Lecture Notes in Computer Science, vol. 11693, pp. 732–764 (2019).
    doi
  5. Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations
    Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, and Ida Tucker
    In Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part III (Alexandra Boldyreva, and Daniele Micciancio, eds), Springer, Lecture Notes in Computer Science, vol. 11694, pp. 191–221 (2019).
    doi
  6. Shorter Ring Signatures from Standard Assumptions
    Alonso González
    In Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Beijing, China, April 14-17, 2019, Proceedings, Part I (Dongdai Lin, and Kazue Sako, eds), Springer, Lecture Notes in Computer Science, vol. 11442, pp. 99–126 (2019).
    doi
  7. Lossy Algebraic Filters with Short Tags
    Benoı̂t Libert, and Chen Qian
    In Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Beijing, China, April 14-17, 2019, Proceedings, Part I (Dongdai Lin, and Kazue Sako, eds), Springer, Lecture Notes in Computer Science, vol. 11442, pp. 34–65 (2019).
    doi
  8. Shorter Quadratic QA-NIZK Proofs
    Vanesa Daza, Alonso González, Zaira Pindado, Carla Ràfols, and Javier Silva
    In Public-Key Cryptography - PKC 2019 - 22nd IACR International Conference on Practice and Theory of Public-Key Cryptography, Beijing, China, April 14-17, 2019, Proceedings, Part I (Dongdai Lin, and Kazue Sako, eds), Springer, Lecture Notes in Computer Science, vol. 11442, pp. 314–343 (2019).
    doi
  9. Decentralized Evaluation of Quadratic Polynomials on Encrypted Data
    Chloé Hébant, Duong Hieu Phan, and David Pointcheval
    In Information Security - 22nd International Conference, ISC 2019, New York City, NY, USA, September 16-18, 2019, Proceedings (Zhiqiang Lin, Charalampos Papamanthou, and Michalis Polychronakis, eds), Springer, Lecture Notes in Computer Science, vol. 11723, pp. 87–106 (2019).
    doi

2018

  1. Secure Outsourcing in Discrete-Logarithm-Based and Pairing-Based Cryptography (Invited Talk)
    Damien Vergnaud
    In Information Security Theory and Practice - 12th IFIP WG 11.2 International Conference, WISTP 2018, Brussels, Belgium, December 10-11, 2018, Revised Selected Papers (Olivier Blazy, and Chan Yeob Yeun, eds), Springer, Lecture Notes in Computer Science, vol. 11469, pp. 7–11 (2018).
    doi
  2. Compact IBBE and Fuzzy IBE from Simple Assumptions
    Junqing Gong, Benoı̂t Libert, and Somindu C. Ramanna
    In Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5-7, 2018, Proceedings (Dario Catalano, and Roberto De Prisco, eds), Springer, vol. 11035, pp. 563–582 (2018).
    doi
  3. Analysis and Improvement of an Authentication Scheme in Incremental Cryptography
    Louiza Khati, and Damien Vergnaud
    In Selected Areas in Cryptography - SAC 2018 - 25th International Conference, Calgary, AB, Canada, August 15-17, 2018, Revised Selected Papers (Carlos Cid, and Michael J. Jacobson Jr., eds), Springer, Lecture Notes in Computer Science, vol. 11349, pp. 50–70 (2018).
    doi
  4. Adaptively Secure Distributed PRFs from LWE
    Benoı̂t Libert, Damien Stehlé, and Radu Titiu
    In Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part II (Amos Beimel, and Stefan Dziembowski, eds), Springer, Lecture Notes in Computer Science, vol. 11240, pp. 391–421 (2018).
    doi
  5. Improved Anonymous Broadcast Encryptions - Tight Security and Shorter Ciphertext
    Jiangtao Li, and Junqing Gong
    In Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Leuven, Belgium, July 2-4, 2018, Proceedings (Bart Preneel, and Frederik Vercauteren, eds), Springer, Lecture Notes in Computer Science, vol. 10892, pp. 497–515 (2018).
    doi
  6. Improved Inner-Product Encryption with Adaptive Security and Full Attribute-Hiding
    Jie Chen, Junqing Gong, and Hoeteck Wee
    In Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II (Thomas Peyrin, and Steven D. Galbraith, eds), Springer, Lecture Notes in Computer Science, vol. 11273, pp. 673–702 (2018).
    doi
  7. Practical Fully Secure Unrestricted Inner Product Functional Encryption Modulo p
    Guilhem Castagnos, Fabien Laguillaumie, and Ida Tucker
    In Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II (Thomas Peyrin, and Steven D. Galbraith, eds), Springer, Lecture Notes in Computer Science, vol. 11273, pp. 733–764 (2018).
    doi
  8. Lattice-Based Zero-Knowledge Arguments for Integer Relations
    Benoı̂t Libert, San Ling, Khoa Nguyen, and Huaxiong Wang
    In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II (Hovav Shacham, and Alexandra Boldyreva, eds), Springer, Lecture Notes in Computer Science, vol. 10992, pp. 700–732 (2018).
    doi
  9. Unbounded ABE via Bilinear Entropy Expansion, Revisited
    Jie Chen, Junqing Gong, Lucas Kowalczyk, and Hoeteck Wee
    In Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29 - May 3, 2018 Proceedings, Part I (Jesper Buus Nielsen, and Vincent Rijmen, eds), Springer, Lecture Notes in Computer Science, vol. 10820, pp. 503–534 (2018).
    doi
  10. Spreading Alerts Quietly: New Insights from Theory and Practice
    Olivier Blazy, and Céline Chevalier
    In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, Hamburg, Germany, August 27-30, 2018 (Sebastian Doerr, Mathias Fischer, Sebastian Schrittwieser, and Dominik Herrmann, eds), ACM, pp. 30:1–30:6 (2018).
    doi
  11. Decentralized Multi-Client Functional Encryption for Inner Product
    Jérémy Chotard, Edouard Dufour Sans, Romain Gay, Duong Hieu Phan, and David Pointcheval
    In Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II (Thomas Peyrin, and Steven D. Galbraith, eds), Springer, Lecture Notes in Computer Science, vol. 11273, pp. 703–732 (2018).
    doi
  12. Logarithmic-Size Ring Signatures with Tight Security from the DDH Assumption
    Benoı̂t Libert, Thomas Peters, and Chen Qian
    In Computer Security - 23rd European Symposium on Research in Computer Security, ESORICS 2018, Barcelona, Spain, September 3-7, 2018, Proceedings, Part II (Javier López, Jianying Zhou, and Miguel Soriano, eds), Springer, Lecture Notes in Computer Science, vol. 11099, pp. 288–308 (2018).
    doi

2017

  1. Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves
    Marc Joye, and Benoı̂t Libert
    In Topics in Cryptology - CT-RSA 2017 - The Cryptographers’ Track at the RSA Conference 2017, San Francisco, CA, USA, February 14-17, 2017, Proceedings (Helena Handschuh, ed), Springer, Lecture Notes in Computer Science, vol. 10159, pp. 19–35 (2017).
    doi
  2. Access Control Encryption for Equality, Comparison, and More
    Georg Fuchsbauer, Romain Gay, Lucas Kowalczyk, and Claudio Orlandi
    In Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part II (Serge Fehr, ed), Springer, Lecture Notes in Computer Science, vol. 10175, pp. 88–118 (2017).
    doi
  3. Adaptive Oblivious Transfer with Access Control from Lattice Assumptions
    Benoı̂t Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, and Huaxiong Wang
    In Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I (Tsuyoshi Takagi, and Thomas Peyrin, eds), Springer, Lecture Notes in Computer Science, vol. 10624, pp. 533–563 (2017).
    doi
  4. All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE
    Benoı̂t Libert, Amin Sakzad, Damien Stehlé, and Ron Steinfeld
    In Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III (Jonathan Katz, and Hovav Shacham, eds), Springer, Lecture Notes in Computer Science, vol. 10403, pp. 332–364 (2017).
    doi
  5. Tightly Secure IBE Under Constant-Size Master Public Key
    Jie Chen, Junqing Gong, and Jian Weng
    In Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part I (Serge Fehr, ed), Springer, Lecture Notes in Computer Science, vol. 10174, pp. 207–231 (2017).
    doi
  6. Encryption Switching Protocols Revisited: Switching Modulo p
    Guilhem Castagnos, Laurent Imbert, and Fabien Laguillaumie
    In Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part I (Jonathan Katz, and Hovav Shacham, eds), Springer, Lecture Notes in Computer Science, vol. 10401, pp. 255–287 (2017).
    doi
  7. Homomorphic-Policy Attribute-Based Key Encapsulation Mechanisms
    Jérémy Chotard, Duong Hieu Phan, and David Pointcheval
    In Information Security - 20th International Conference, ISC 2017, Ho Chi Minh City, Vietnam, November 22-24, 2017, Proceedings (Phong Q. Nguyen, and Jianying Zhou, eds), Springer, Lecture Notes in Computer Science, vol. 10599, pp. 155–172 (2017).
    doi
  8. Zero-Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash
    Benoı̂t Libert, San Ling, Khoa Nguyen, and Huaxiong Wang
    In Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part III (Tsuyoshi Takagi, and Thomas Peyrin, eds), Springer, Lecture Notes in Computer Science, vol. 10626, pp. 304–335 (2017).
    doi
  9. ABE with Tag Made Easy - Concise Framework and New Instantiations in Prime-Order Groups
    Jie Chen, and Junqing Gong
    In Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II (Tsuyoshi Takagi, and Thomas Peyrin, eds), Springer, Lecture Notes in Computer Science, vol. 10625, pp. 35–65 (2017).
    doi
  10. Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
    Benoı̂t Libert, Thomas Peters, and Chen Qian
    In Public-Key Cryptography - PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, March 28-31, 2017, Proceedings, Part I (Serge Fehr, ed), Springer, Lecture Notes in Computer Science, vol. 10174, pp. 247–276 (2017).
    doi
  11. Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract
    Shweta Agrawal, Sanjay Bhattacherjee, Duong Hieu Phan, Damien Stehlé, and Shota Yamada
    In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017 (Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, eds), ACM, pp. 2277–2293 (2017).
    doi
  12. Comment on ’Attribute-Based Signatures for Supporting Anonymous Certification’ by N. Kaaniche and M. Laurent (ESORICS 2016)
    Damien Vergnaud
    Comput. J. 60, 12, pp. 1801–1808 (2017).
    open access doi



(pictures credit: upklyak / Freepik)