| Title/Authors | Title | Research Artifacts
[?] A research
artifact is any by-product of a research project that is not
directly included in the published research paper. In Computer
Science research this is often source code and data sets, but
it could also be media, documentation, inputs to proof
assistants, shell-scripts to run experiments, etc.
|
Details |
|---|
|
The First Collision for Full SHA-1 Marc Stevens, Elie Bursztein, Pierre Karpman, Ange Albertini, Yarik Markov |
The First Collision for Full SHA-1 Details |
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
|
Robust Non-interactive Multiparty Computation Against Constant-Size Collusion Fabrice Benhamouda, Hugo Krawczyk, Tal Rabin |
Robust Non-interactive Multiparty Computation Against Constant-Size Collusion Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan |
Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Conditional Disclosure of Secrets via Non-linear Reconstruction Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee |
Conditional Disclosure of Secrets via Non-linear Reconstruction Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs Huijia Lin |
Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Be Adaptive, Avoid Overcommitting Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs |
Be Adaptive, Avoid Overcommitting Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The Bitcoin Backbone Protocol with Chains of Variable Difficulty Juan A. Garay, Aggelos Kiayias, Nikos Leonardos |
The Bitcoin Backbone Protocol with Chains of Variable Difficulty Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Structure vs. Hardness Through the Obfuscation Lens Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan |
Structure vs. Hardness Through the Obfuscation Lens Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions Sam Kim, David J. Wu |
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Benedikt Auerbach, David Cash, Manuel Fersch, Eike Kiltz |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic Yashvanth Kondi, Arpita Patra |
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
A New Approach to Round-Optimal Secure Multiparty Computation Prabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain |
A New Approach to Round-Optimal Secure Multiparty Computation Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Encryption Switching Protocols Revisited: Switching Modulo p Guilhem Castagnos, Laurent Imbert, Fabien Laguillaumie |
Encryption Switching Protocols Revisited: Switching Modulo p Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption Carmen Elisabetta Zaira Baltico, Dario Catalano, Dario Fiore, Romain Gay |
Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Generic Transformations of Predicate Encodings: Constructions and Applications Miguel Ambrona, Gilles Barthe, Benedikt Schmidt |
Generic Transformations of Predicate Encodings: Constructions and Applications Details |
Author Comments:
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
|
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci |
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Identity-Based Encryption from the Diffie-Hellman Assumption Nico Döttling, Sanjam Garg |
Identity-Based Encryption from the Diffie-Hellman Assumption Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed |
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks Shweta Agrawal |
Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol Aggelos Kiayias, Alexander Russell, Bernardo David, Roman Oliynykov |
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs Huijia Lin, Stefano Tessaro |
Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Secure Arithmetic Computation with Constant Computational Overhead Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron |
Secure Arithmetic Computation with Constant Computational Overhead Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Bitcoin as a Transaction Ledger: A Composable Treatment Christian Badertscher, Ueli Maurer, Daniel Tschudi, Vassilis Zikas |
Bitcoin as a Transaction Ledger: A Composable Treatment Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
The Price of Low Communication in Secure Multi-party Computation Juan A. Garay, Yuval Ishai, Rafail Ostrovsky, Vassilis Zikas |
The Price of Low Communication in Secure Multi-party Computation Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Topology-Hiding Computation on All Graphs Adi Akavia, Rio LaVigne, Tal Moran |
Topology-Hiding Computation on All Graphs Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Secure Computation Based on Leaky Correlations: High Resilience Setting Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen |
Secure Computation Based on Leaky Correlations: High Resilience Setting Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Distinguisher-Dependent Simulation in Two Rounds and its Applications Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum |
Distinguisher-Dependent Simulation in Two Rounds and its Applications Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Black-Box Parallel Garbled RAM Steve Lu, Rafail Ostrovsky |
Black-Box Parallel Garbled RAM Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti |
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Proving Resistance Against Invariant Attacks: How to Choose the Round Constants Christof Beierle, Anne Canteaut, Gregor Leander, Yann Rotella |
Proving Resistance Against Invariant Attacks: How to Choose the Round Constants Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Laconic Oblivious Transfer and Its Applications Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Antigoni Polychroniadou |
Laconic Oblivious Transfer and Its Applications Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Incremental Program Obfuscation Sanjam Garg, Omkant Pandey |
Incremental Program Obfuscation Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time Daniele Micciancio, Michael Walter |
Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization Prabhanjan Ananth, Abhishek Jain, Amit Sahai |
Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
New Security Notions and Feasibility Results for Authentication of Quantum Data Sumegha Garg, Henry Yuen, Mark Zhandry |
New Security Notions and Feasibility Results for Authentication of Quantum Data Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample Fuchun Guo, Rongmao Chen, Willy Susilo, Jianchang Lai, Guomin Yang, Yi Mu |
Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Non-Malleable Codes for Space-Bounded Tampering Sebastian Faust, Kristina Hostáková, Pratyay Mukherjee, Daniele Venturi |
Non-Malleable Codes for Space-Bounded Tampering Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Quantum Non-malleability and Authentication Gorjan Alagic, Christian Majenz |
Quantum Non-malleability and Authentication Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme Itai Dinur, Niv Nadler |
Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
From Obfuscation to the Security of Fiat-Shamir for Proofs Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum |
From Obfuscation to the Security of Fiat-Shamir for Proofs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Compact Structure-Preserving Signatures with Almost Tight Security Masayuki Abe, Dennis Hofheinz, Ryo Nishimaki, Miyako Ohkubo, Jiaxin Pan |
Compact Structure-Preserving Signatures with Almost Tight Security Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Fast Secure Two-Party ECDSA Signing Yehuda Lindell |
Fast Secure Two-Party ECDSA Signing Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Breaking the FF3 Format-Preserving Encryption Standard over Small Domains F. Betül Durak, Serge Vaudenay |
Breaking the FF3 Format-Preserving Encryption Standard over Small Domains Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners Zhenzhen Bao, Lei Wang, Jian Guo, Dawu Gu |
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Non-full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak Ling Song, Guohong Liao, Jian Guo |
Non-full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Andre Esser, Robert Kübler, Alexander May |
Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security Bart Mennink |
Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Quantum Security of NMAC and Related Constructions - PRF Domain Extension Against Quantum attacks Fang Song, Aaram Yun |
Quantum Security of NMAC and Related Constructions - PRF Domain Extension Against Quantum attacks Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs Jens Groth, Mary Maller |
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Boosting Authenticated Encryption Robustness with Minimal Modifications Tomer Ashur, Orr Dunkelman, Atul Luykx |
Boosting Authenticated Encryption Robustness with Minimal Modifications Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Hedging Public-Key Encryption in the Real World Alexandra Boldyreva, Christopher Patton, Thomas Shrimpton |
Hedging Public-Key Encryption in the Real World Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Message Franking via Committing Authenticated Encryption Paul Grubbs, Jiahui Lu, Thomas Ristenpart |
Message Franking via Committing Authenticated Encryption Details |
|
Author Comments:
The ePrint paper is the full version.
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE Benoît Libert, Amin Sakzad, Damien Stehlé, Ron Steinfeld |
All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
All-But-Many Lossy Trapdoor Functions from Lattices and Applications Xavier Boyen, Qinyi Li |
All-But-Many Lossy Trapdoor Functions from Lattices and Applications Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Kurosawa-Desmedt Meets Tight Security Romain Gay, Dennis Hofheinz, Lisa Kohl |
Kurosawa-Desmedt Meets Tight Security Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
A Formal Treatment of Multi-key Channels Felix Günther, Sogol Mazaheri |
A Formal Treatment of Multi-key Channels Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication Tetsu Iwata, Kazuhiko Minematsu, Thomas Peyrin, Yannick Seurin |
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam |
Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Private Multiplication over Finite Fields Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud |
Private Multiplication over Finite Fields Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Middle-Product Learning with Errors Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld |
Middle-Product Learning with Errors Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Amortization with Fewer Equations for Proving Knowledge of Small Secrets Rafaël del Pino, Vadim Lyubashevsky |
Amortization with Fewer Equations for Proving Knowledge of Small Secrets Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing Joanne Woodage, Rahul Chatterjee, Yevgeniy Dodis, Ari Juels, Thomas Ristenpart |
A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Anonymous Attestation with Subverted TPMs Jan Camenisch, Manu Drijvers, Anja Lehmann |
Anonymous Attestation with Subverted TPMs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Identity-Based Encryption from Codes with Rank Metric Philippe Gaborit, Adrien Hauteville, Duong Hieu Phan, Jean-Pierre Tillich |
Identity-Based Encryption from Codes with Rank Metric Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Cube Attacks on Non-Blackbox Polynomials Based on Division Property Yosuke Todo, Takanori Isobe, Yonglin Hao, Willi Meier |
Cube Attacks on Non-Blackbox Polynomials Based on Division Property Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Information-Theoretic Indistinguishability via the Chi-Squared Method Wei Dai, Viet Tung Hoang, Stefano Tessaro |
Information-Theoretic Indistinguishability via the Chi-Squared Method Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
PRF-ODH: Relations, Instantiations, and Impossibility Results Jacqueline Brendel, Marc Fischlin, Felix Günther, Christian Janson |
PRF-ODH: Relations, Instantiations, and Impossibility Results Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Shota Yamada |
Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Key Rotation for Authenticated Encryption Adam Everspaugh, Kenneth G. Paterson, Thomas Ristenpart, Samuel Scott |
Key Rotation for Authenticated Encryption Details |
Author Comments:
The original version of this work that appeared at Advances in Cryptology – Crypto 2017 had a number of flaws. While the majority of the core concepts remain unaltered, the eprint version constitutes a significant rewrite. We highlight the most significant changes with footnotes throughout the paper.
Discussion Comments:
0
Sharing:
Research produced artifacts
Verification:
Authors have
verified
information
|
|
|
Degree Evaluation of NFSR-Based Cryptosystems Meicheng Liu |
Degree Evaluation of NFSR-Based Cryptosystems Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Ratcheted Encryption and Key Exchange: The Security of Messaging Mihir Bellare, Asha Camper Singh, Joseph Jaeger, Maya Nyayapati, Igors Stepanovs |
Ratcheted Encryption and Key Exchange: The Security of Messaging Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory Bart Mennink, Samuel Neves |
Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|