Better MPC Protocols in Theory and in Practice

An Incentive-Compatible Smart Contract for Decentralized Commerce

Author(s): Nikolaj Ignatieff Schwartzbach
Published in: Issue abs 2008.10326, 2020
Publisher: CORR

YOSO: You Only Speak Once / Secure MPC with Stateless Ephemeral Roles

Author(s): Craig Gentry and Shai Halevi and Hugo Krawczyk and Bernardo Magri and Jesper Buus Nielsen and Tal Rabin and Sophia Yakoubov
Published in: 2021
Publisher: Cryptology ePrint Archive, Report 2021/210

On Sufficient Oracles for Secure Computation with Identifiable Abort

Author(s): Mark Simkin and Luisa Siniscalchi and and Sophia Yakoubov
Published in: 2021
Publisher: Cryptology ePrint Archive, Report 2021/151

The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT.

Author(s): Claudio Orlandi and Peter Scholl and Sophia Yakoubov
Published in: 2021
Publisher: Cryptology ePrint Archive

(Public) Verifiability For Composable Protocols Without Adaptivity Or Zero-Knowledge

Author(s): Carsten Baum and Bernardo David and Rafael Dowsley
Published in: Issue Report 2020/207, 2020
Publisher: Cryptology ePrint Archive

LSS Homomorphisms and Applications to Secure Signatures, Proactive Secret Sharing and Input Certification

Author(s): Diego F. Aranha and Anders P. K. Dalskov and Daniel Escudero and Claudio Orlandi
Published in: IACR Cryptology ePrint Archive, Issue 2020, 2020, Page(s) 691
Publisher: IACR Cryptology ePrint Archive

Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security

Author(s): Anders Dalskov and Daniel Escudero and Marcel Keller
Published in: 2020, Page(s) Report 2020/1330
Publisher: Cryptology ePrint Archive

Broadcast Secret-Sharing, Bounds and Applications

Author(s): Ivan Damgård and Kasper Green Larsen and Sophia Yakoubov
Published in: 2020, Page(s) Cryptology ePrint Archive: Report 2020/618
Publisher: Cryptology ePrint Archive

Random-index PIR and Applications

Author(s): Craig Gentry and Shai Halevi and Bernardo Magri and Jesper Buus Nielsen and Sophia Yakoubov
Published in: 2020, Page(s) Report 2020/1248
Publisher: Cryptology ePrint Archive

Improved single-round secure multiplication using regenerating codes.

Author(s): Mark Abspoel and Ronald Cramer and Daniel Escudero and Ivan Damgård and Chaoping Xing
Published in: 2021
Publisher: Cryptology ePrint Archive, Report 2021/253

TARDIS: A Foundation of Time-Lock Puzzles in UC

Author(s): Carsten Baum and Bernardo David and Rafael Dowsley and Jesper Buus Nielsen and Sabine Oechsner
Published in: Issue Report 2020/537, 2020
Publisher: Cryptology ePrint Archive

Inception Makes Non-malleable Codes Stronger

Author(s): Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Published in: Theory of Cryptography (TCC 2017) Proceedings, Issue Part II, 2017, Page(s) 319-343
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-70503-3_10

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Author(s): Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges
Published in: Advances in Cryptology - ASIACRYPT 2017, proceedings, Issue LNCS, volume 10624, 2017, Page(s) 629-659
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-70694-8_22

TinyOLE - Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation

Author(s): Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti
Published in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17, Issue Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS, 2017, Page(s) 2263-2276, ISBN 9781450349468
Publisher: ACM Press
DOI: 10.1145/3133956.3134024

Adaptively Indistinguishable Garbled Circuits

Author(s): Zahra Jafargholi, Alessandra Scafuro, Daniel Wichs
Published in: TCC 2017, Issue Proceedings, Part II, 2017, Page(s) 40-71
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-70503-3_2

Be Adaptive, Avoid Overcommitting

Author(s): Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs
Published in: CRYPTO 2017, Issue Proceedings, Part 1, 2017, Page(s) 133-163
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-63688-7_5

Compact Zero-Knowledge Proofs of Small Hamming Weight

Author(s): Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin
Published in: PKC 2018, Issue Proceedings, Part II, 2018, Page(s) 530-560
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-76581-5_18

Inverted Leftover Hash Lemma

Author(s): Maciej Obremski, Maciej Skorski
Published in: 2018 IEEE International Symposium on Information Theory (ISIT), 2018, Page(s) 1834-1838, ISBN 978-1-5386-4781-3
Publisher: IEEE
DOI: 10.1109/isit.2018.8437654

Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters

Author(s): Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Published in: 2018 IEEE International Symposium on Information Theory (ISIT), 2018, Page(s) 1131-1135, ISBN 978-1-5386-4781-3
Publisher: IEEE
DOI: 10.1109/isit.2018.8437762

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement

Author(s): Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci
Published in: Lecture Notes in Computer Science, Issue Vol. 9985, 2016, Page(s) 204-234
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-53641-4_9

How to Prove Knowledge of Small Secrets

Author(s): Carsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen
Published in: Lecture Notes in Computer Science, Issue Vol. 9816, 2016, Page(s) 478-498
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-53015-3_17

On Public Key Encryption from Noisy Codewords

Author(s): Eli Ben-Sasson, Iddo Ben-Tov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi
Published in: Lecture Notes in Computer Science, Issue Vol. 9615, 2016, Page(s) 417-446
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-49387-8_16

Rate-1, Linear Time and Additively Homomorphic UC Commitments

Author(s): Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen
Published in: Lecture Notes in Computer Science, Issue Vol. 9816, 2016, Page(s) 179-207
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-53015-3_7

DUPLO - Unifying Cut-and-Choose for Garbled Circuits

Author(s): Vladimir Kolesnikov, Jesper Buus Nielsen, Mike Rosulek, Ni Trieu, Roberto Trifiletti
Published in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017, Page(s) 3-20, ISBN 9781450349468
Publisher: ACM
DOI: 10.1145/3133956.3133991

New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning

Author(s): Ivan Damgard, Daniel Escudero, Tore Frederiksen, Marcel Keller, Peter Scholl, Nikolaj Volgushev
Published in: 2019 IEEE Symposium on Security and Privacy (SP), 2019, Page(s) 1102-1120, ISBN 978-1-5386-6660-9
Publisher: IEEE
DOI: 10.1109/sp.2019.00078

Computer-Aided Proofs for Multiparty Computation with Active Security

Author(s): Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, Pierre-Yves Strub
Published in: 2018 IEEE 31st Computer Security Foundations Symposium (CSF), 2018, Page(s) 119-131, ISBN 978-1-5386-6680-7
Publisher: IEEE
DOI: 10.1109/csf.2018.00016

Broadcast-Optimal Two Round MPC with an Honest Majority

Author(s): Ivan Damgård and Bernardo Magri and Luisa Siniscalchi and Sophia Yakoubov
Published in: Issue Report 2020/1254, 2020
Publisher: Cryptology ePrint Archive

More Communication Lower Bounds for Information-Theoretic MPC

Author(s): Ivan Damgård, Boyang Li, Nikolaj I. Schwartzbach:
Published in: 2021
Publisher: Cryptology ePrint Archive, Report 2021/278

CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time

Author(s): Carsten Baum and Bernardo David and Rafael Dowsley and Jesper Buus Nielsen and Sabine Oechsner
Published in: Issue Report 2020/784, 2020
Publisher: Cryptology ePrint Archive

Honest Majority MPC with Abort with Minimal Online Communication

Author(s): Daniel Escudero and Anders Dalskov
Published in: 2020, Page(s) Report 2020/1556
Publisher: Cryptology ePrint Archive

Black-Box Transformations from Passive to Covert Security with Public Verifiability

Author(s): Ivan Damgård, Claudio Orlandi, Mark Simkin
Published in: Advances in Cryptology – CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II, Issue 12171, 2020, Page(s) 647-676, ISBN 978-3-030-56879-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-56880-1_23

Fast Threshold ECDSA with Honest Majority

Author(s): Ivan Damgård, Thomas Pelle Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, Michael Bæksvang Østergaard
Published in: Security and Cryptography for Networks - 12th International Conference, SCN 2020, Amalfi, Italy, September 14–16, 2020, Proceedings, Issue 12238, 2020, Page(s) 382-400, ISBN 978-3-030-57989-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-57990-6_19

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography

Author(s): Carsten Baum, Ariel Nof
Published 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, Issue 12110, 2020, Page(s) 495-526, ISBN 978-3-030-45373-2
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-45374-9_17

Oblivious TLS via Multi-party Computation

Author(s): Damiano Abram, Ivan Damgård, Peter Scholl, Sven Trieflinger
Published in: Topics in Cryptology – CT-RSA 2021 - Cryptographers’ Track at the RSA Conference 2021, Virtual Event, May 17–20, 2021, Proceedings, Issue 12704, 2021, Page(s) 51-74, ISBN 978-3-030-75538-6
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-75539-3_3

Banquet: Short and Fast Signatures from AES

Author(s): Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
Published 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, Issue 12710, 2021, Page(s) 266-297, ISBN 978-3-030-75244-6
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-75245-3_11

Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE

Author(s): Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza
Published in: Security and Cryptography for Networks - 12th International Conference, SCN 2020, Amalfi, Italy, September 14–16, 2020, Proceedings, Issue 12238, 2020, Page(s) 130-149, ISBN 978-3-030-57989-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-57990-6_7

On the Communication Required for Unconditionally Secure Multiplication

Author(s): Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael Raskin
Published in: Advances in Cryptology – CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II, Issue 9815, 2016, Page(s) 459-488, ISBN 978-3-662-53007-8
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-53008-5_16

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $$\mathbb {Z}/p^k\mathbb {Z} $$

Author(s): Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Matthieu Rambaud, Chaoping Xing, Chen Yuan
Published 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, Issue 12493, 2020, Page(s) 151-180, ISBN 978-3-030-64839-8
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-64840-4_6

Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits

Author(s): Daniel Escudero, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, Peter Scholl
Published in: Advances in Cryptology – CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II, Issue 12171, 2020, Page(s) 823-852, ISBN 978-3-030-56879-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-56880-1_29

Insured MPC: Efficient Secure Computation with Financial Penalties

Author(s): Carsten Baum, Bernardo David, Rafael Dowsley
Published in: Financial Cryptography and Data Security - 24th International Conference, FC 2020 , Kota Kinabalu, Malaysia, February 10–14, 2020 Revised Selected Papers, Issue 12059, 2020, Page(s) 404-420, ISBN 978-3-030-51279-8
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-51280-4_22

Renyi Entropy Estimation Revisited

Author(s): Maciej Obremski, Maciej Skorski
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), Issue Volume 81, 2017, Page(s) 20:1--20:15, ISBN 978-3-95977-044-6
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.approx-random.2017.20

An Algebraic Approach to Maliciously Secure Private Set Intersection

Author(s): Satrajit Ghosh, Tobias Nilges
Published in: Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part III, Issue 11478, 2019, Page(s) 154-185, ISBN 978-3-030-17658-7
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-17659-4_6

Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement

Author(s): Bernardo David, Rafael Dowsley, Mario Larangeira
Published in: Financial Cryptography and Data Security - 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 – March 2, 2018, Revised Selected Papers, Issue 10957, 2018, Page(s) 500-519, ISBN 978-3-662-58386-9
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-58387-6_27

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings

Author(s): Ivan Damgård, Claudio Orlandi, Mark Simkin
Published in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Issue 10992, 2018, Page(s) 799-829, ISBN 978-3-319-96880-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-96881-0_27

21 - Bringing Down the Complexity: Fast Composable Protocols for Card Games Without Secret State

Author(s): Bernardo David, Rafael Dowsley, Mario Larangeira
Published in: Information Security and Privacy - 23rd Australasian Conference, ACISP 2018, Wollongong, NSW, Australia, July 11-13, 2018, Proceedings, Issue 10946, 2018, Page(s) 45-63, ISBN 978-3-319-93637-6
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-93638-3_4

Reusing Tamper-Proof Hardware in UC-Secure Protocols

Author(s): Jeremias Mechler, Jörn Müller-Quade, Tobias Nilges
Published in: Public-Key Cryptography – PKC 2018, Issue 10769, 2018, Page(s) 463-493, ISBN 978-3-319-76577-8
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-76578-5_16

Towards Practical Lattice-Based One-Time Linkable Ring Signatures

Author(s): Carsten Baum, Huang Lin, Sabine Oechsner
Published in: Information and Communications Security - 20th International Conference, ICICS 2018, Lille, France, October 29-31, 2018, Proceedings, Issue 11149, 2018, Page(s) 303-322, ISBN 978-3-030-01949-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-01950-1_18

Confidential Benchmarking Based on Multiparty Computation

Author(s): Ivan Damgård, Kasper Damgård, Kurt Nielsen, Peter Sebastian Nordholt, Tomas Toft
Published in: Financial Cryptography and Data Security, Issue 9603, 2017, Page(s) 169-187, ISBN 978-3-662-54969-8
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-54970-4_10

Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)

Author(s): Ivan Damgård, Antigoni Polychroniadou, Vanishree Rao
Published in: Public-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part II, Issue 9615, 2016, Page(s) 208-233, ISBN 978-3-662-49386-1
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-49387-8_9

Unconditionally Secure Computation with Reduced Interaction

Author(s): Ivan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén
Published in: Advances in Cryptology – EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II, Issue 9666, 2016, Page(s) 420-447, ISBN 978-3-662-49895-8
Publisher: Springer Berlin Heidelberg
DOI: 10.1007/978-3-662-49896-5_15

The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited

Author(s): Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci
Published in: Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part I, Issue 10401, 2017, Page(s) 167-187, ISBN 978-3-319-63687-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-63688-7_6

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model

Author(s): Ronald Cramer, Ivan Damgård, Nico Döttling, Irene Giacomelli, Chaoping Xing
Published in: Information Theoretic Security, Issue 10681, 2017, Page(s) 1-25, ISBN 978-3-319-72088-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-72089-0_1

Efficient UC Commitment Extension with Homomorphism for Free (and Applications)

Author(s): Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Rafael Dowsley, Irene Giacomelli
Published 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 II, Issue 11922, 2019, Page(s) 606-635, ISBN 978-3-030-34620-1
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-34621-8_22

Proofs of Replicated Storage Without Timing Assumptions

Author(s): Ivan Damgård, Chaya Ganesh, Claudio Orlandi
Published in: Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part I, Issue 11692, 2019, Page(s) 355-380, ISBN 978-3-030-26947-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-26948-7_13

Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing

Author(s): Ivan Damgård, Kasper Green Larsen, Jesper Buus Nielsen
Published in: Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II, Issue 11693, 2019, Page(s) 61-84, ISBN 978-3-030-26950-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-26951-7_3

Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures

Author(s): Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin
Published in: Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II, Issue 11693, 2019, Page(s) 510-539, ISBN 978-3-030-26950-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-26951-7_18

Commodity-Based 2PC for Arithmetic Circuits

Author(s): Ivan Damgård, Helene Haagh, Michael Nielsen, Claudio Orlandi
Published in: Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Oxford, UK, December 16–18, 2019, Proceedings, Issue 11929, 2019, Page(s) 154-177, ISBN 978-3-030-35198-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-35199-1_8

Efficient Information-Theoretic Secure Multiparty Computation over $$\mathbb {Z}/p^k\mathbb {Z}$$ via Galois Rings

Author(s): Mark Abspoel, Ronald Cramer, Ivan Damgård, Daniel Escudero, Chen Yuan
Published in: Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part I, Issue 11891, 2019, Page(s) 471-501, ISBN 978-3-030-36029-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-36030-6_19

More Efficient Commitments from Structured Lattice Assumptions

Author(s): Carsten Baum, Ivan Damgård, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert
Published in: Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings, Issue 11035, 2018, Page(s) 368-385, ISBN 978-3-319-98112-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-98113-0_20

Using TopGear in Overdrive: A More Efficient ZKPoK for SPDZ

Author(s): Carsten Baum, Daniele Cozzo, Nigel P. Smart
Published in: Selected Areas in Cryptography – SAC 2019 - 26th International Conference, Waterloo, ON, Canada, August 12–16, 2019, Revised Selected Papers, Issue 11959, 2020, Page(s) 274-302, ISBN 978-3-030-38470-8
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-38471-5_12

Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments

Author(s): Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi
Published in: Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11–14, 2018, Proceedings, Part II, Issue 11240, 2018, Page(s) 225-254, ISBN 978-3-030-03809-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-03810-6_9

The Simplest Multi-key Linearly Homomorphic Signature Scheme

Author(s): Diego F. Aranha, Elena Pagnin
Published in: Progress in Cryptology – LATINCRYPT 2019 - 6th International Conference on Cryptology and Information Security in Latin America, Santiago de Chile, Chile, October 2–4, 2019, Proceedings, Issue 11774, 2019, Page(s) 280-300, ISBN 978-3-030-30529-1
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-30530-7_14

Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead

Author(s): Michael Raskin, Mark Simkin
Published 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 II, Issue 11922, 2019, Page(s) 537-563, ISBN 978-3-030-34620-1
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-34621-8_19

The Communication Complexity of Threshold Private Set Intersection

Author(s): Satrajit Ghosh, Mark Simkin
Published in: Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II, Issue 11693, 2019, Page(s) 3-29, ISBN 978-3-030-26950-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-26951-7_1

SPD$$\mathbb {Z}_{2^k}$$: Efficient MPC mod $$2^k$$ for Dishonest Majority

Author(s): Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
Published in: Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part II, Issue 10992, 2018, Page(s) 769-798, ISBN 978-3-319-96880-3
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-96881-0_26

Topology-Hiding Computation Beyond Semi-Honest Adversaries

Author(s): Rio LaVigne, Chen-Da Liu-Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi
Published in: Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11–14, 2018, Proceedings, Part II, Issue 11240, 2018, Page(s) 3-35, ISBN 978-3-030-03809-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-03810-6_1

Secure Arithmetic Computation with Constant Computational Overhead

Author(s): Benny Applebaum, Ivan Damgård, Yuval Ishai, Michael Nielsen, Lior Zichron
Published in: Advances in Cryptology – CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part I, Issue 10401, 2017, Page(s) 223-254, ISBN 978-3-319-63687-0
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-63688-7_8

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

Author(s): Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Published in: Advances in Cryptology – CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II, Issue 12171, 2020, Page(s) 562-592, ISBN 978-3-030-56879-5
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-56880-1_20

Lattice-Based Proof of Shuffle and Applications to Electronic Voting

Author(s): Diego F. Aranha, Carsten Baum, Kristian Gjøsteen, Tjerand Silde, Thor Tunge
Published in: Topics in Cryptology – CT-RSA 2021 - Cryptographers’ Track at the RSA Conference 2021, Virtual Event, May 17–20, 2021, Proceedings, Issue 12704, 2021, Page(s) 227-251, ISBN 978-3-030-75538-6
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-75539-3_10

Secure Evaluation of Quantized Neural Networks

Author(s): Anders Dalskov, Daniel Escudero, Marcel Keller
Published in: Proceedings on Privacy Enhancing Technologies, Issue 2020/4, 2020, Page(s) 355-375, ISSN 2299-0984
Publisher: Sciendo
DOI: 10.2478/popets-2020-0077

On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability

Author(s): Rafael Dowsley, Anderson C. A. Nascimento
Published in: IEEE Transactions on Information Theory, Issue 63/10, 2017, Page(s) 6819-6826, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/TIT.2017.2735423

Commitment and Oblivious Transfer in the Bounded Storage Model With Errors

Author(s): Rafael Dowsley, Felipe Lacerda, Anderson C. A. Nascimento
Published in: IEEE Transactions on Information Theory, Issue 64/8, 2018, Page(s) 5970-5984, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/TIT.2018.2796128

Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models based on Pre-Computation

Author(s): Martine De Cock, Rafael Dowsley, Caleb Horst, Raj Katti, Anderson Nascimento, Wing-Sea Poon, Stacey Truex
Published in: IEEE Transactions on Dependable and Secure Computing, Issue Cryptology ePrint Archive, Report 2016/736, 2017, Page(s) 1-1, ISSN 1545-5971
Publisher: IEEE Computer Society
DOI: 10.1109/TDSC.2017.2679189

TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing

Author(s): Elena Pagnin, Gunnar Gunnarsson, Pedram Talebi, Claudio Orlandi, Andrei Sabelfeld
Published in: Proceedings on Privacy Enhancing Technologies, Issue 2019/4, 2019, Page(s) 93-111, ISSN 2299-0984
Publisher: Sciendo
DOI: 10.2478/popets-2019-0060

Continuously non-malleable codes with split-state refresh

Author(s): Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi
Published in: Theoretical Computer Science, Issue 759, 2019, Page(s) 98-132, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2018.12.028

A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM

Author(s): Paulo S. L. M. Barreto, Bernardo David, Rafael Dowsley, Kirill Morozov, Anderson C. A. Nascimento
Published in: IACR Cryptology ePrint Archive, Issue 2017, 2017, Page(s) 993
Publisher: IACR Cryptology ePrint Archive

Publications

Share this page Share this page on social networks

Download Download the content of the page