cover_image

【论文速递】Crypto 2024 （143篇）

Kurt Pan XPTY
2024年06月09日 03:37
  1. Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions

    Noga Amit, Guy Rothblum
    UC Berkeley; Apple

  2. Loquat: A SNARK-Friendly Post-Quantum Signature based on the Legendre PRF with Applications in Ring and Aggregate Signatures

    Xinyu Zhang, Ron Steinfeld, Muhammed F. Esgin, Joseph K. Liu, Dongxi Liu, Sushmita Ruj
    Monash University & CSIRO Data61; Monash University; CSIRO Data61; University of New South Wales

  3. Adaptively Secure BLS Threshold Signatures from DDH and co-CDH

    Sourav Das, Ling Ren
    University of Illinois at Urbana Champaign

  4. Sometimes You Can't Distribute Random Oracle Based Proofs

    Jack Doerner, Yashvanth Kondi, Leah Namisa Rosenbloom
    Brown University, Technion, Reichman University; Silence Labs (Deel); Brown University

  5. Adaptively Sound Zero Knowledge SNARKs for UP

    Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan
    MIT; Cornell University

  6. Feistel-like Structures Revisited: Classification and Cryptanalysis

    Bing Sun, Zejun Xiang, Zhengyi Dai, Guoqiang Liu, Xuan Shen, Longjiang Qu, Shaojing Fu
    National University of Defense Technology; Hubei University

  7. MPC in the head using the subfield bilinear collision problem

    Janik Huth, Antoine Joux
    CISPA Helmholtz Center for Information Security, Saarland University; CISPA Helmholtz Center for Information Security

  8. Oblivious issuance of proofs

    Michele Orrù, Stefano Tessaro, Greg Zaverucha, Chenzhi Zhu
    CNRS; University of Washington; Microsoft Research

  9. Adaptive Security in SNARGs via iO and Lossy Functions

    Brent Waters, Mark Zhandry
    UT Austin and NTT Research; NTT Research

  10. On the practical CPAD security of "exact" and threshold FHE schemes and libraries

    Marina Checri, Renaud Sirdey, Aymen Boudguiga, Jean-Paul Bultel
    Université Paris-Saclay, CEA LIST, France

  11. Lossy Cryptography from Code-Based Assumptions

    Quang Dao, Aayush Jain
    Carnegie Mellon University

  12. The One-Wayness of Jacobi Signatures

    Henry Corrigan-Gibbs, David J. Wu
    MIT; UT Austin

  13. Resettable Statistical Zero-Knowledge for NP

    Susumu Kiyoshima
    NTT Social Informatics Laboratories

  14. Round-Optimal Fully Secure Distributed Key Generation

    Jonathan Katz
    Google and University of Maryland

  15. FRIDA: Data Availability Sampling from FRI

    Mathias Hall-Andersen, Mark Simkin, Benedikt Wagner
    ZkSecurity; Ethereum Foundation; CISPA Helmholtz Center for Information Security, Saarland University

  16. Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation

    Giuseppe Ateniese, Foteini Baldimtsi, Matteo Campanelli, Danilo Francati, Ioanna Karantaidou
    George Mason University; Matter Labs

  17. Succinctly-Committing Authenticated Encryption

    Mihir Bellare, Viet Tung Hoang
    University of California San Diego; Florida State University

  18. Formal Security Proofs via Doeblin Coefficients: Optimal Side-channel Factorization from Noisy Leakage to Random Probing

    Julien Béguinot, Wei Cheng, Sylvain Guilley, Olivier Rioul
    LTCI, Télécom Paris, Institut Polytechnique de Paris, France; LTCI, Télécom Paris, Institut Polytechnique de Paris, France and Secure-IC S.A.S., France

  19. $k$-SUM in the Sparse Regime: Complexity and Applications

    Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan
    IIT Madras; Carnegie Mellon University; Aarhus University; National University of Singapore

  20. HAWKEYE – Recovering Symmetric Cryptography From Hardware Circuits

    Gregor Leander, Christof Paar, Julian Speith, Lukas Stennes
    Ruhr University Bochum; Max Planck Institute for Security and Privacy

  21. Towards Permissionless Consensus in the Standard Model via Fine-Grained Complexity

    Marshall Ball, Juan Garay, Peter Hall, Aggelos Kiayias, Giorgos Panagiotakos
    New York University; Texas A&M University; University of Edinburgh and IOG; IOG

  22. Non-Interactive Zero-Knowledge from LPN and MQ

    Quang Dao, Aayush Jain, Zhengzhong Jin
    Carnegie Mellon University; Carnegie Mellon Universtiy; MIT

  23. A Modular Approach to Unclonable Cryptography

    Prabhanjan Ananth, Amit Behera
    UCSB; Ben-Gurion University

  24. Unconditionally secure quantum commitments with preprocessing

    Luowen Qian
    Boston University & NTT Research

  25. Generic MitM Attack Frameworks on Sponge Constructions

    Xiaoyang Dong, Boxin Zhao, Lingyue Qin, Qingliang Hou, Shun Zhang, Xiaoyun Wang
    Tsinghua University; Zhongguancun Laboratory; Shandong University; PLA Strategic Support Force Information Engineering University

  26. Quantum Advantage from One-Way Functions

    Tomoyuki Morimae, Takashi Yamakawa
    Kyoto University; NTT Social Informatics Laboratories

  27. Zero-knowledge IOPs Approaching Witness Length

    Noga Ron-Zewi, Mor Weiss
    University of Haifa; Bar-Ilan University

  28. Revisiting Differential-Linear Attacks via a Boomerang Perspective With Application to AES, Ascon, CLEFIA, SKINNY, PRESENT, KNOT, TWINE, WARP, LBlock, Simeck and SERPENT

    Hosein Hadipour, Patrick Derbez, Maria Eichlseder
    Graz University of Technology; Univ Rennes, Inria, CNRS, IRISA

  29. Bare PAKE: Universally Composable Key Exchange from just Passwords

    Manuel Barbosa, Kai Gellert, Julia Hesse, Stanislaw Jarecki
    University of Porto, INESC TEC, Max Planck Institute for Security and Privacy; University of Wuppertal; IBM Research Europe - Zurich; UC Irvine

  30. Unconditionally Secure Commitments with Quantum Auxiliary Inputs

    Barak Nehoran, Tomoyuki Morimae, Takashi Yamakawa
    Princeton University; Yukawa Institute for Theoretical Physics, Kyoto University; NTT Social Informatics Laboratories

  31. Malicious Security for SCALES: Outsourced Computation with Ephemeral Servers

    Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran
    Bar-Ilan University; Georgia Institute of Technology; Indian Institute of Technology Bombay

  32. Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions

    Fuyuki Kitagawa, Tomoyuki Morimae, Ryo Nishimaki, Takashi Yamakawa
    NTT Social Informatics Laboratories; Kyoto University

  33. Exploring the Advantages and Challenges of Fermat NTT in FHE Acceleration

    Andrey Kim, Ahmet Can Mert, Anisha Mukherjee, Aikata Aikata, Maxim Deryabin, Sunmin Kwon, HyungChul Kang, Sujoy Sinha Roy
    Samsung Advanced Institute of Technology; Graz University of Technology

  34. Reusable Online-Efficient Commitments

    Nir Bitansky, Omer Paneth, Dana Shamir
    New York University and Tel Aviv University; Tel Aviv University

  35. Robust Quantum Public-Key Encryption with Applications to Quantum Key Distribution

    Giulio Malavolta, Michael Walter
    Bocconi University; Ruhr University Bochum

  36. Amplification of Non-Interactive Zero Knowledge, Revisited

    Nir Bitansky, Nathan Geier
    New York University and Tel Aviv University; Tel Aviv University

  37. Aggregating Falcon Signatures With LaBRADOR

    Marius A. Aardal, Diego F. Aranha, Katharina Boudgoust, Sebastian Kolby, Akira Takahashi
    Aarhus University; CNRS, Univ Montpellier, LIRMM; J.P.Morgan AI Research & AlgoCRYPT CoE

  38. Quantum Complexity for Discrete Logarithms and Related Problems

    Minki Hhan, Takashi Yamakawa, Aaram Yun
    KIAS; NTT Social Informatics Laboratories; Ewha Womans University

  39. On Sequential Functions and Fine-Grained Cryptography

    Jiaxin Guan, Hart Montgomery
    New York University; Linux Foundation

  40. That’s not my signature! Fail-stop signatures for a post-quantum world

    Cecilia Boschini, Hila Dahari, Moni Naor, Eyal Ronen
    ETH Zurich; Weizmann Institute; Tel-Aviv University

  41. Limits of Black-Box Anamorphic Encryption

    Dario Catalano, Emanuele Giunta, Francesco Migliaro
    Università di Catania, Italy; IMDEA Software Institute, Spain

  42. Pseudorandom Error-Correcting Codes

    Miranda Christ, Sam Gunn
    Columbia University; UC Berkeley

  43. A Formal Treatment of End-to-End Encrypted Cloud Storage

    Matilda Backendal, Hannah Davis, Felix Günther, Miro Haller, Kenneth G. Paterson
    ETH Zurich, Switzerland; Seagate Technology, USA; IBM Research Europe - Zurich, Switzerland; UC San Diego, USA

  44. Generic and Algebraic Computation Models: When AGM Proofs Transfer to the GGM

    Joseph Jaeger, Deep Inder Mohan
    Georgia Institute of Technology

  45. BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes

    Hadas Zeilberger, Binyi Chen, Ben Fisch
    Yale University; Stanford University

  46. Collision Resistance from Multi-Collision Resistance for all Constant Parameters

    Jan Buzek, Stefano Tessaro
    University of Washington

  47. Certifying Private Probabilistic Mechanisms

    Zoë Ruha Bell, Shafi Goldwasser, Michael P. Kim, Jean-Luc Watson
    University of California, Berkeley; Cornell University

  48. CDS Composition of Multi-Round Protocols

    Masayuki Abe, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen, Zehua Shang, Mehdi Tibouchi
    NTT Social Informatics Laboratories; University of Ottawa; NICT; Bocconi University and Reichman University; Kyoto University

  49. Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions

    George Lu, Mark Zhandry
    UT Austin; NTT Research

  50. Secure Multiparty Computation with Identifiable Abort from Vindicating Release

    Ran Cohen, Jack Doerner, Yashvanth Kondi, abhi shelat
    Reichman University; Brown University, Technion, Reichman University; Silence Labs (Deel); Northeastern University

  51. How (not) to Build Quantum PKE in Minicrypt

    Longcheng Li, Qian Li, Xingjian Li, Qipeng Liu
    Institute of Computing Technology, Chinese Academy of Sciences; Shenzhen Research Institute of Big Data; Tsinghua University; University of California San Diego

  52. LATKE: A Framework for Constructing Identity-Binding PAKEs

    Jonathan Katz, Michael Rosenberg
    Google and University of Maryland; University of Maryland

  53. QFESTA: Efficient Algorithms and Parameters for FESTA using Quaternion Algebras

    Kohei Nakagawa, Hiroshi Onuki
    NTT Social Informatics Laboratories; University of Tokyo

  54. MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably

    Bar Alon, Moni Naor, Eran Omri, Uri Stemmer
    Ben-Gurion University; Weizmann Institute of Science; Ariel University; Tel Aviv University

  55. Solving the Tensor Isomorphism Problem for special orbits with low rank points: Cryptanalysis and repair of an Asiacrypt 2023 commitment scheme

    Valerie Gilchrist, Laurane Marco, Christophe Petit, Gang Tang
    Université Libre de Bruxelles; EPFL; Université Libre de Bruxelles, University of Birmingham; University of Technology Sydney, University of Birmingham

  56. Pairing-Free Blind Signatures from CDH Assumptions

    Rutchathon Chairattana-apirom, Stefano Tessaro, Chenzhi Zhu
    University of Washington

  57. Pairing-Free Blind Signatures from Standard Assumptions in the ROM

    Julia Kastner, Ky Nguyen, Michael Reichle
    ETH Zurich; ENS Paris

  58. Speeding up Preimage and Key-Recovery Attacks with Highly Biased Differential-Linear Approximations

    Zhongfeng Niu, Kai Hu, Siwei Sun, Zhiyu Zhang, Meiqin Wang
    University of Chinese Academy of Sciences; Shandong University

  59. Fine-Grained Non-Interactive Key-Exchange without Idealized Assumptions

    Yuyu Wang, Chuanjie Su, Jiaxin Pan
    University of Electronic Science and Technology of China; University of Kassel, Germany

  60. Leakage Certification Made Simple

    Aakash Chowdhury, Carlo Brunetta, Arnab Roy, Elisabeth Oswald
    University of Klagenfurt; Independent Researcher; University of Innsbruck; University of Klagenfurt and University of Birmingham

  61. Formally Verifying Kyber Episode V: Machine-checked IND-CCA security and correctness of ML-KEM in EasyCrypt

    José Bacelar Almeida, Santiago Arranz Olmos, Manuel Barbosa, Gilles Barthe, Francois Dupressoir, Benjamin Gregoire, Vincent Laporte, Jean-Christophe Léchenet, Cameron Low, Tiago Oliveira, Hugo Pacheco, Miguel Quaresma, Peter Schwabe, Pierre-Yves Strub
    Universidade do Minho and INESC TEC; Max Planck Institute for Security and Privacy; University of Porto (FCUP) and INESC TEC and Max Planck Institute for Security and Privacy; Max Planck Institute for Security and Privacy and IMDEA Software Institute; University of Bristol; Université Côte d’Azur, Inria, France; Université de Lorraine, CNRS, Inria, LORIA, Nancy, France; SandboxAQ; University of Porto (FCUP) and INESC TEC; Max Planck Institute for Security and Privacy and Radboud University; PQShield SAS

  62. Improving Generic Attacks Using Exceptional Functions

    Xavier Bonnetain, Rachelle Heim Boissier, Gaëtan Leurent, André Schrottenloher
    Université de Lorraine, Inria, LORIA, Nancy, France; Université Paris-Saclay, UVSQ, Laboratoire de mathématiques de Versailles, Versailles, France; Inria, Paris, France; Univ Rennes, Inria, CNRS, IRISA, Rennes, France

  63. The Algebraic Freelunch: Efficient Gröbner Basis Attacks Against Arithmetization-Oriented Primitives

    Augustin Bariant, Aurélien Bœuf, Axel Lemoine, Irati Manterola Ayala, Morten Øygarden, Léo Perrin, Håvard Raddum
    ANSSI, Inria; Inria; Inria, DGA; Simula UiB

  64. Robust Additive Randomized Encodings from IO and Pseudo Non-Linear Codes

    Nir Bitansky, Sapir Freizeit
    New York University and Tel Aviv University; Tel Aviv University

  65. Polymath: Groth16 Is Not The Limit

    Helger Lipmaa
    University of Tartu

  66. Time-Lock Puzzles from Lattices

    Shweta Agrawal, Giulio Malavolta, Tianwei Zhang
    IIT Madras, Chennai, India; Bocconi University, Max Planck Institute for Security and Privacy; Max Planck Institute for Security and Privacy, Ruhr University Bochum

  67. Public-Key Anamorphism in (CCA-secure) Public-Key Encryption and Beyond

    Giuseppe Persiano, Duong Hieu Phan, Moti Yung
    Università di Salerno and Google; Telecom Paris; Google and Columbia University

  68. Fully Malicious Authenticated PIR

    Marian Dietz, Stefano Tessaro
    University of Washington

  69. Tight Characterizations for Preprocessing against Cryptographic Salting

    Fangqi Dong, Qipeng Liu, Kewen Wu
    IIIS, Tsinghua University; University of California San Diego; University of California Berkeley

  70. On the (In)Security of the BUFF Transform

    Jelle Don, Serge Fehr, Yu-Hsuan Huang, Patrick Struck
    Centrum Wiskunde & Informatica, the Netherlands; Centrum Wiskunde & Informatica and Leiden University, the Netherlands; University of Konstanz, Germany

  71. More Efficient Zero-Knowledge Protocols over $\mathbb{Z}_{2^k}$ via Galois Rings

    Fuchun Lin, Chaoping Xing, Yizhou Yao
    Shanghai Jiao Tong University

  72. Fully Secure MPC and zk-FLIOP Over Rings: New Constructions, Improvements and Extensions

    Anders Dalskov, Daniel Escudero, Ariel Nof
    Partisia; J.P. Morgan AI Research & J.P. Morgan AlgoCRYPT CoE; Bar Ilan University

  73. Secret Sharing with Certified Deletion

    James Bartusek, Justin Raizes
    UC Berkeley; Carnegie Mellon University

  74. Accountability in Threshold Decryption via Threshold Traitor Tracing

    Dan Boneh, Aditi Partap, Lior Rotem
    Stanford University

  75. Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience

    Vipul Goyal, Chen-Da Liu-Zhang, Yifan Song
    NTT Research; Luzern University of Applied Sciences and Arts & Web3 Foundation; Tsinghua University and Shanghai Qi Zhi Institute

  76. Algebraic Structure of the Iterates of $\chi$

    Björn Kriepke, Gohar Kyureghyan
    University of Rostock

  77. Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup

    Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee
    NTT Research; Bocconi University and MPI Security and Privacy; King's College London

  78. Traceable Secret Sharing: Strong Security and Efficient Constructions

    Dan Boneh, Aditi Partap, Lior Rotem
    Stanford University

  79. Game-Theoretically Fair Distributed Sampling

    Ke Wu, Pratik Soni, Sri AravindaKrishnan Thyagarajan
    Carnegie Mellon University; University of Utah; University of Sydney

  80. Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods

    Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev, Stefano Tessaro
    Hebrew University; Harvard University; Cornell Tech; University of Washington

  81. Laconic Function Evaluation and ABE for RAMs from (Ring-)LWE

    Fangqi Dong, Zihan Hao, Ethan Mook, Hoeteck Wee, Daniel Wichs
    IIIS, Tsinghua University; Northeastern University; NTT Research and ENS, Paris; Northeastern University and NTT Research

  82. Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC

    Wei-Kai Lin, Ethan Mook, Daniel Wichs
    University of Virginia; Northeastern University; Northeastern University, NTT Research

  83. PIR with Client-Side Preprocessing: Information-Theoretic Constructions and Lower Bounds

    Yuval Ishai, Elaine Shi, Daniel Wichs
    Technion; CMU; Northeastern and NTT Research

  84. Threshold Encryption with Silent Setup

    Sanjam Garg, Dimitris Kolonelos, Guru Vamsi Policharla, Mingyuan Wang
    UC Berkeley; IMDEA Software Institute, Universidad Politécnica de Madrid

  85. Accelerating SLH-DSA by Two Orders of Magnitude with a Single Hash Unit

    Markku-Juhani Saarinen
    Tampere University

  86. Two-Round Threshold Signature from Algebraic One-More Learning with Errors

    Shuichi Katsumata, Kaoru Takemure, Thomas Espitau
    PQShield and AIST; PQShield

  87. Reducing the CRS Size in Registered ABE Systems

    Rachit Garg, George Lu, Brent Waters, David J. Wu
    UT Austin; UT Austin and NTT Research

  88. Greyhound: Fast Polynomial Commitments from Lattices

    Ngoc Khanh Nguyen, Gregor Seiler
    King's College London; IBM Research Europe - Zurich

  89. Quantum Lattice Enumeration in Limited Depth

    Nina Bindel, Xavier Bonnetain, Marcel Tiepelt, Fernando Virdia
    SandboxAQ, Palo Alto, CA, USA; Université de Lorraine, CNRS, Inria, Nancy, France; KASTEL, Karlsruhe Institute of Technology, Karlsruhe, Germany; NOVA LINCS, Univerisdade NOVA de Lisboa, Portugal

  90. Space-Efficient and Noise-Robust Quantum Factoring

    Seyoon Ragavan, Vinod Vaikuntanathan
    MIT

  91. Provable security against decryption failure attacks from LWE

    Christian Majenz, Fabrizio Sisinni
    Danmarks Tekniske Universitet

  92. Field-Agnostic SNARKs from Expand-Accumulate Codes

    Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang
    Georgetown University and University of Maryland; Texas A&M University; Google and University of Maryland; a16z crypto research and Georgetown University; University of Maryland; University of Illinois Urbana Champaign

  93. Radical Vélu Isogeny Formulae

    Thomas Decru
    ULB

  94. On cycles of pairing-friendly abelian varieties

    Maria Corte-Real Santos, Craig Costello, Michael Naehrig
    University College London; Microsoft Research

  95. Black-Box (and Fast) Non-Malleable Zero Knowledge

    Vincenzo Botta, Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi, Ivan Visconti
    University of Warsaw; University of Edinburgh; Bocconi University; Technical University of Denmark; University of Salerno

  96. Fine-Grained Non-Interactive Key Exchange, Revisited

    Geoffroy Couteau, Elahe Sadeghi, Balthazar Bauer
    CNRS, IRIF, Université Paris Cité; University of Texas; UVSQ

  97. Hintless Single-Server Private Information Retrieval

    Baiyu Li, Daniele Micciancio, Mariana Raykova, Mark Schultz-Wu
    Google; UCSD

  98. Cryptanalysis of Lattice-Based Sequentiality Assumptions and Proofs of Sequential Work

    Chris Peikert, Yi Tang
    University of Michigan

  99. Compact Key Storage: A Modern Approach to Key Backup and Delegation

    Yevgeniy Dodis, Daniel Jost, Antonio Marcedone
    New York University; Zoom Video Communications

  100. Cryptanalysis of Algebraic Verifiable Delay Functions

    Alex Biryukov, Ben Fisch, Gottfried Herold, Dmitry Khovratovich, Gaëtan Leurent, María Naya-Plasencia, Benjamin Wesolowski
    University of Luxembourg; Yale, USA; Ethereum Foundation; INRIA, France; ENS Lyon, France

  101. Mangrove: A Scalable Framework for Folding-based SNARKs

    Wilson Nguyen, Trisha Datta, Dan Boneh, Nirvan Tyagi, Binyi Chen
    Stanford University

  102. Circuit ABE with poly(depth, λ)-sized Ciphertexts and Keys from Lattices

    Hoeteck Wee
    NTT Research

  103. The Committing Security of MACs with Applications to Generic Composition

    Ritam Bhaumik, Bishwajit Chakraborty, Wonseok Choi, Avijit Dutta, Jérôme Govinden, Yaobin Shen
    EPFL; Nanyang Technological University; Purdue University; Institute for Advancing Intelligence, TCG CREST; TU Darmstadt; Xiamen University

  104. Memory-Sample Lower Bounds for LWE

    Junzhao Yang, Mingqi Lu
    Tsinghua University

  105. HyperNova: Recursive arguments for customizable constraint systems

    Abhiram Kothapalli, Srinath Setty
    CMU; Microsoft Research

  106. 10-Party Sublinear Secure Computation from Standard Assumptions

    Geoffroy Couteau, Naman Kumar
    CNRS, IRIF, Université Paris Cité; Oregon State University

  107. Improved Alternating-Moduli PRFs and Post-Quantum Signatures

    Navid Alamati, Guru-Vamsi Policharla, Srinivasan Raghuraman, Peter Rindal
    VISA Research; University of California, Berkeley; VISA Research and MIT

  108. CryptAttackTester: high-assurance attack analysis

    Daniel J. Bernstein, Tung Chou
    University of Illinois at Chicago; Academia Sinica

  109. Computation Efficient Structure-Aware PSI From Incremental Function Secret Sharing

    Gayathri Garimella, Benjamin Goff, Peihan Miao
    Brown University

  110. A Systematic Study of Sparse LWE

    Aayush Jain, Huijia Lin, Sagnik Saha
    Carnegie Mellon University; University of Washington

  111. Information-theoretic security with asymmetries

    Tim Beyne, Yu Long Chen
    COSIC, KU Leuven, Leuven, Belgium

  112. Flood and submerse: Verifiable short secret sharing and application to robust threshold signatures on lattices

    Thomas Espitau, Thomas Prest, Guilhem Niot
    PQShield

  113. Compressing Unit-Vector Correlations via Sparse Pseudorandom Generators

    Amit Agarwal, Elette Boyle, Niv Gilboa, Yuval Ishai, Mahimna Kelkar, Yiping Ma
    University of Illinois Urbana-Champaign; NTT Research and Reichman University; Ben-Gurion University; Technion; Cornell Tech; University of Pennsylvania

  114. Not Just Regular Decoding: Asymptotics and Improvements of Regular Syndrome Decoding Attacks

    Andre Esser, Paolo Santini
    Technology Innovation Institute; Marche Polytechnic University

  115. Towards Breaking the Half-barrier of Local Leakage-resilient Shamir's Secret Sharing

    Hai Nguyen
    ETH Zurich

  116. Privacy-Preserving Dijkstra

    Benjamin Ostrovsky
    Unaffiliated

  117. Scalable Multiparty Computation from Non-linear Secret Sharing

    Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Mingyuan Wang
    UC Berkeley; Johns Hopkins University; Supra Research

  118. How to Construct Quantum FHE, Generically

    Aparna Gupte, Vinod Vaikuntanathan
    MIT

  119. STIR: Reed–Solomon Proximity Testing with Fewer Queries

    Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
    Weizmann Institute; EPFL; Bar-Ilan University

  120. Adaptively Secure 5 Round Threshold Signatures from MLWE/MSIS and DL with Rewinding

    Shuichi Katsumata, Michael Reichle, Kaoru Takemure
    PQShield and AIST; ETH Zurich

  121. Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions

    Amos Beimel, Tal Malkin, Noam Mazor
    Ben-Gurion University; Columbia University; Tel Aviv University

  122. A Modular Approach to Registered ABE for Unbounded Predicates

    Nuttapong Attrapadung, Junichi Tomida
    AIST; NTT Social Informatics Laboratories

  123. Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves

    Benjamin Benčina, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Miha Stopar, Charlotte Weitkämper
    Royal Holloway, University of London; University of Birmingham and Eötvös Loránd University; ETH Zürich; University of Birmingham and Université Libre de Bruxelles; Ethereum Foundation and Université Libre de Bruxelles

  124. New Approaches for Estimating the Bias of Differential-Linear Distinguishers

    ting peng, wentao zhang, Jingsui Weng, Tianyou Ding
    Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, CAS

  125. Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations

    Joseph Carolan, Alexander Poremba
    University of Maryland; MIT

  126. Ring Signatures for Deniable AKEM: Gandalf's Fellowship

    Phillip Gajland, Jonas Janneck, Eike Kiltz
    Max Planck Institute for Security and Privacy & Ruhr-Universität Bochum; Ruhr-Universität Bochum

  127. Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences

    Maciej Obremski, João Ribeiro, Lawrence Roy, François-Xavier Standaert, Daniele Venturi
    CQT and National University of Singapore; Instituto Superior Técnico, Universidade de Lisboa; Aarhus University; UCLouvain; Sapienza University of Rome

  128. Fully-Succinct Multi-Key Homomorphic Signatures from Standard Assumptions

    Gaspard Anthoine, David Balbás, Dario Fiore
    IMDEA Software Institute, Universidad Politécnica de Madrid; IMDEA Software Institute

  129. On Central Primitives for Quantum Cryptography with Classical Communication

    Matthew Gray, Eli Goldin, Kai Min Chung
    University of Oxford; NYU; Academia Sinica

  130. Attribute Based Encryption for Turing Machines from Lattices

    Shweta Agrawal, Simran Kumari, Shota Yamada
    IIT Madras, Chennai, India; AIST, Japan

  131. Concretely Efficient Lattice-based Polynomial Commitment from Standard Assumptions

    Intak Hwang, Jinyeong Seo, Yongsoo Song
    Seoul National University

  132. Stochastic Secret Sharing with 1-Bit Shares and Applications to MPC

    Benny Applebaum, Eliran Kachlon
    Tel Aviv University

  133. Time-memory Trade-offs Sound the Death Knell for GPRS and GSM

    Tristan Claverie, Gildas Avoine, Diane Leblanc-Albarel, Xavier Carpent, Christophe Devine
    ANSSI, IRISA, INSA de Rennes; INSA de Rennes, IRISA; Cosic Group, KU Leuven; University of Nottingham; ANSSI

  134. Linear-Communication Asynchronous Complete Secret Sharing with Optimal Resilience

    Xiaoyu Ji, Junru Li, Yifan Song
    Tsinghua University; ShanghaiTech University; Tsinghua University and Shanghai Qi Zhi Institute

  135. FuLeakage: Breaking FuLeeca by Learning Attacks

    Wessel van Woerden, Felicitas Hörmann
    Institut de Mathématiques de Bordeaux, University of Bordeaux & Inria; Institute of Communications and Navigation, German Aerospace Center (DLR) & School of Computer Science, University of St. Gallen

  136. Polytopes in the Fiat-Shamir with Aborts Paradigm

    Henry Bambury, Hugo Beguinet, Thomas Ricosset, Eric Sageloli
    DIENS, École Normale Supérieure, CNRS, PSL University, Inria Paris (France), DGA; DIENS, École Normale Supérieure, CNRS, PSL University, Thales (France); Thales (France); DIENS, École Normale Supérieure, CNRS, PSL University, Polytechnique Institute, Thales (France)

  137. On round elimination for special-sound multi-round identification and the generality of the hypercube for MPCitH

    Andreas Hülsing, Christian Majenz, David Joseph, Anand Kumar Narayanan
    Eindhoven University of Technology & SandboxAQ; Technical University of Denmark; SandboxAQ

  138. How to Prove Statements Obliviously?

    Sanjam Garg, Aarushi Goel, Mingyuan Wang
    UC Berkeley; NTT Research

  139. Universal Composable Transaction Serialization with Order Fairness

    Michele Ciampi, Aggelos Kiayias, Yu Shen
    University of Edinburgh; University of Edinburgh and IOG

  140. Probabilistic Linearization: Internal Differential Collisions in up to 6 Rounds of SHA-3

    Zhongyi Zhang, Chengan Hou, Meicheng Liu
    Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, Chinese Academy of Sciences, China

  141. Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs

    Carsten Baum, Nikolas Melissaris, Rahul Rachuri, Peter Scholl
    DTU Compute; Aarhus University; Visa Research

  142. Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused

    Youngjin Bae, Jung Hee Cheon, Guillaume Hanrot, Jai Hyun Park, Damien Stehlé
    CryptoLab Inc.; Seoul National University / CryptoLab Inc.; Seoul National University

  143. Raccoon: A Masking-Friendly Signature Proven in the Probing Model

    Shuichi Katsumata, Melissa Rossi, Rafael del Pino, Thomas Prest
    PQShield and AIST; ANSSI; PQShield