Nigel P. Smart

J. Cryptol., April, 2023

Computing on Encrypted Data.

[BibT_eX]

[DOI]

IEEE Secur. Priv., 2023

Practical and Efficient FHE-based MPC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Lightweight Asynchronous Verifiable Secret Sharing with Optimal Resilience.

[BibT_eX]

[DOI]

Victor Shoup

IACR Cryptol. ePrint Arch., 2023

MPC With Delayed Parties Over Star-Like Networks.

[BibT_eX]

[DOI]

Mariana Botelho da Gama

IACR Cryptol. ePrint Arch., 2023

Noah's Ark: Efficient Threshold-FHE Using Noise Flooding.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for ℤ2k.

[BibT_eX]

[DOI]

Lennart Braun

IACR Cryptol. ePrint Arch., 2023

Trivial Transciphering With Trivium and TFHE.

[BibT_eX]

[DOI]

Thibault Balenbois

Jean-Baptiste Orfila

IACR Cryptol. ePrint Arch., 2023

ZK-for-Z2K: MPC-in-the-Head Zero-Knowledge Proofs for $\mathbb {Z}_{2^k}$.

[BibT_eX]

[DOI]

Lennart Braun

Proceedings of the Cryptography and Coding - 19th IMA International Conference, 2023

2022

Actively Secure Setup for SPDZ.

[BibT_eX]

[DOI]

J. Cryptol., 2022

All for one and one for all: Fully decentralised privacy-preserving dark pool trading using multi-party computation.

[BibT_eX]

[DOI]

Mariana Botelho da Gama

IACR Cryptol. ePrint Arch., 2022

The Key Lattice Framework for Concurrent Group Messaging.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

FINAL: Faster FHE instantiated with NTRU and LWE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

2021

High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer.

[BibT_eX]

[DOI]

Sai Sheshank Burra

Enrique Larraia

Jesper Buus Nielsen

Peter Sebastian Nordholt

J. Cryptol., 2021

Multi-party computation mechanism for anonymous equity block trading: A secure implementation of turquoise plato uncross.

[BibT_eX]

[DOI]

Intell. Syst. Account. Finance Manag., 2021

Thresholdizing HashEdDSA: MPC to the Rescue.

[BibT_eX]

[DOI]

Charlotte Bonte

Titouan Tanguy

Int. J. Inf. Sec., 2021

History of Cryptographic Key Sizes.

[BibT_eX]

[DOI]

Emmanuel Thomé

IACR Cryptol. ePrint Arch., 2021

MPC for Q2 Access Structures over Rings and Fields.

[BibT_eX]

[DOI]

Robin Jadoul

Barry Van Leeuwen

IACR Cryptol. ePrint Arch., 2021

Kicking-the-Bucket: Fast Privacy-Preserving Trading Using Buckets.

[BibT_eX]

[DOI]

Mariana Botelho da Gama

Antigoni Polychroniadou

IACR Cryptol. ePrint Arch., 2021

Secure Fast Evaluation of Iterative Methods: With an Application to Secure PageRank.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Optimizing Registration Based Encryption.

[BibT_eX]

[DOI]

Kelong Cong

Karim Eldefrawy

IACR Cryptol. ePrint Arch., 2021

Gladius: LWR based efficient hybrid public key encryption with distributed decryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits.

[BibT_eX]

[DOI]

Eduardo Soria-Vazquez

IACR Cryptol. ePrint Arch., 2021

Compilation of Function Representations for Secure Computing Paradigms.

[BibT_eX]

[DOI]

Karim Baghery

Titouan Tanguy

IACR Cryptol. ePrint Arch., 2021

Private Liquidity Matching using MPC.

[BibT_eX]

[DOI]

Shahla Atapoor

IACR Cryptol. ePrint Arch., 2021

The Cost of IEEE Arithmetic in Secure Computation.

[BibT_eX]

[DOI]

David W. Archer

Shahla Atapoor

IACR Cryptol. ePrint Arch., 2021

MPC for Q2 Access Structures over Rings and Fields.

[BibT_eX]

[DOI]

Robin Jadoul

Barry Van Leeuwen

Proceedings of the Selected Areas in Cryptography - 28th International Conference, 2021

2020

Decentralized Privacy-Preserving Proximity Tracing.

[BibT_eX]

[DOI]

IEEE Data Eng. Bull., 2020

Decentralized Privacy-Preserving Proximity Tracing.

[BibT_eX]

[DOI]

CoRR, 2020

Overdrive2k: Efficient Secure MPC over $\mathbb {Z}_{2^k}$ from Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT.

[BibT_eX]

[DOI]

Christophe Petit

Proceedings of the Cryptology and Network Security - 19th International Conference, 2020

2019

Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ.

[BibT_eX]

[DOI]

J. Cryptol., 2019

TaaS: Commodity MPC via Triples-as-a-Service.

[BibT_eX]

[DOI]

Titouan Tanguy

IACR Cryptol. ePrint Arch., 2019

Distributing any Elliptic Curve Based Protocol: With an Application to MixNets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Overdrive2k: Efficient Secure MPC over Z2k from Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

BBQ: Using AES in Picnic Signatures.

[BibT_eX]

[DOI]

Lauren De Meyer

IACR Cryptol. ePrint Arch., 2019

Sashimi: Cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Sharing the LUOV: Threshold Post-Quantum Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ.

[BibT_eX]

[DOI]

Carsten Baum

IACR Cryptol. ePrint Arch., 2019

Benchmarking Privacy Preserving Scientific Operations.

[BibT_eX]

[DOI]

Abdelrahaman Aly

IACR Cryptol. ePrint Arch., 2019

Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Round-optimal Verifiable Oblivious Pseudorandom Functions From Ideal Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Distributing Any Elliptic Curve Based Protocol.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding - 17th IMA International Conference, 2019

Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation.

[BibT_eX]

[DOI]

Tim Wood

Proceedings of the Topics in Cryptology - CT-RSA 2019, 2019

EPIC: Efficient Private Image Classification (or: Learning from the Masters).

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2019, 2019

2018

Error-Detecting in Monotone Span Programs with Application to Communication Efficient Multi-Party Computation.

[BibT_eX]

[DOI]

Tim Wood

IACR Cryptol. ePrint Arch., 2018

Adding Distributed Decryption and Key Generation to a Ring-LWE Based CCA Encryption Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Secure Oblivious Transfer from Semi-Commutative Masking.

[BibT_eX]

[DOI]

Christophe Petit

IACR Cryptol. ePrint Arch., 2018

Using the Cloud to Determine Key Strengths - Triennial Update.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

MPC Joins the Dark Side.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

From Keys to Databases - Real-World Applications of Secure Multi-Party Computation.

[BibT_eX]

[DOI]

Jakob Illeborg Pagter

Rebecca N. Wright

IACR Cryptol. ePrint Arch., 2018

2017

When It's All Just Too Much: Outsourcing MPC-Preprocessing.

[BibT_eX]

[DOI]

Peter Scholl

Tim Wood

IACR Cryptol. ePrint Arch., 2017

Modes of Operation Suitable for Computing on Encrypted Data.

[BibT_eX]

[DOI]

Dragos Rotaru

Martijn Stam

IACR Cryptol. ePrint Arch., 2017

CAPA: The Spirit of Beaver against Physical Attacks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

PICS: Private Image Classification with SVM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Multi-Rate Threshold FlipThem.

[BibT_eX]

[DOI]

David S. Leslie

Chris Sherfield

IACR Cryptol. ePrint Arch., 2017

Reducing Communication Channels in MPC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Generic Forward-Secure Key Agreement Without Signatures.

[BibT_eX]

[DOI]

Cyprien de Saint Guilhem

IACR Cryptol. ePrint Arch., 2017

Homomorphic Encryption without Gaussian Noise.

[BibT_eX]

[DOI]

Anamaria Costache

IACR Cryptol. ePrint Arch., 2017

Image Classification using non-linear Support Vector Machines on Encrypted Data.

[BibT_eX]

[DOI]

Charlie Stainton-Bygrave

Srinivas Vivek

Adrian Waller

IACR Cryptol. ePrint Arch., 2017

Tightly Secure Ring-LWE Based Key Encapsulation with Short Ciphertexts.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

Cryptography Made Simple

[BibT_eX]

[DOI]

Information Security and Cryptography, Springer, ISBN: 978-3-319-21936-3, 2016

Bootstrapping BGV ciphertexts with a wider choice of p and q.

[BibT_eX]

[DOI]

IET Inf. Secur., 2016

Building a Community of Real-World Cryptographers.

[BibT_eX]

[DOI]

Dan Boneh

Kenny Paterson

IEEE Secur. Priv., 2016

More Efficient Constant-Round Multi-Party Computation from BMR and SHE.

[BibT_eX]

[DOI]

Yehuda Lindell

Eduardo Soria-Vazquez

IACR Cryptol. ePrint Arch., 2016

MPC-Friendly Symmetric Key Primitives.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Fixed Point Arithmetic in SHE Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Faster Homomorphic Evaluation of Discrete Fourier Transforms.

[BibT_eX]

[DOI]

Anamaria Costache

Srinivas Vivek

IACR Cryptol. ePrint Arch., 2016

Modern Cryptography and Security: An Inter-Community Dialogue (Dagstuhl Seminar 16051).

[BibT_eX]

[DOI]

Kristin E. Lauter

Radu Sion

Dagstuhl Reports, 2016

An IBE-based Signcryption Scheme for Group Key Management.

[BibT_eX]

[DOI]

CoRR, 2016

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Fixed-Point Arithmetic in SHE Schemes.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - SAC 2016, 2016

Masking and MPC: When Crypto Theory Meets Crypto Practice.

[BibT_eX]

[DOI]

Proceedings of the ACM Workshop on Theory of Implementation Security, 2016

2015

Threshold FlipThem: When the winner does not need to take all.

[BibT_eX]

[DOI]

David S. Leslie

Chris Sherfield

IACR Cryptol. ePrint Arch., 2015

Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?

[BibT_eX]

[DOI]

Anamaria Costache

IACR Cryptol. ePrint Arch., 2015

Linear Overhead Robust MPC with Honest Majority Using Preprocessing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

What Is Computer Science? - An Information Security Perspective

[BibT_eX]

[DOI]

Daniel Page

Undergraduate Topics in Computer Science, Springer, ISBN: 978-3-319-04041-7, 2014

Anonymity guarantees of the UMTS/LTE authentication and connection protocol.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2014

Just a Little Bit More.

[BibT_eX]

[DOI]

Yuval Yarom

IACR Cryptol. ePrint Arch., 2014

Bootstrapping BGV Ciphertexts With A Wider Choice of p and q.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Actively Secure Private Function Evaluation.

[BibT_eX]

[DOI]

Payman Mohassel

Seyed Saeed Sadeghian

IACR Cryptol. ePrint Arch., 2014

Dishonest Majority Multi-Party Computation for Binary Circuits.

[BibT_eX]

[DOI]

Enrique Larraia

IACR Cryptol. ePrint Arch., 2014

Reducing the Overhead of Cloud MPC.

[BibT_eX]

[DOI]

Ashish Choudhury

Arpita Patra

IACR Cryptol. ePrint Arch., 2014

"Ooh Aah... Just a Little Bit" : A small amount of side channel can go a long way.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Fully homomorphic SIMD operations.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

Reducing the Overhead of MPC over a Large Population.

[BibT_eX]

[DOI]

Ashish Choudhury

Arpita Patra

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

2013

Field switching in BGV-style homomorphic encryption.

[BibT_eX]

[DOI]

J. Comput. Secur., 2013

Less is more: relaxed yet composable security notions for key exchange.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2013

Anonymous attestation with user-controlled linkability.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2013

Estimating Key Sizes For High Dimensional Lattice Based Systems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

An architecture for practical actively secure MPC with dishonest majority.

[BibT_eX]

[DOI]

Marcel Keller

Peter Scholl

IACR Cryptol. ePrint Arch., 2013

Between a Rock and a Hard Place: Interpolating Between MPC and FHE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

An Analysis of the EMV Channel Establishment Protocol.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

A brief history of practical multi-party computation.

[BibT_eX]

[DOI]

Proceedings of the PETShop'13, 2013

2012

Relations between the security models for certificateless encryption and ID-based key agreement.

[BibT_eX]

[DOI]

Dario Fiore

Rosario Gennaro

Int. J. Inf. Sec., 2012

Ring Switching in BGV-Style Homomorphic Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Homomorphic Evaluation of the AES Circuit.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

The low-call diet: Authenticated Encryption for call counting HSM users.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Ring Switching in BGV-Style Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

2011

Wildcarded Identity-Based Encryption.

[BibT_eX]

[DOI]

J. Cryptol., 2011

Improved Key Generation For Gentry's Fully Homomorphic Encryption Scheme.

[BibT_eX]

[DOI]

Peter Scholl

IACR Cryptol. ePrint Arch., 2011

Using the Cloud to Determine Key Strengths.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Better Bootstrapping in Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Fully Homomorphic Encryption with Polylog Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

On the Joint Security of Encryption and Signature in EMV.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Multiparty Computation from Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Secure Computing in the Cloud (Dagstuhl Seminar 11491).

[BibT_eX]

[DOI]

Benny Pinkas

Ahmad-Reza Sadeghi

Dagstuhl Reports, 2011

On CCA-Secure Somewhat Homomorphic Encryption.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - 18th International Workshop, 2011

Secure Outsourced Computation.

[BibT_eX]

[DOI]

Jake Loftus

Proceedings of the Progress in Cryptology - AFRICACRYPT 2011, 2011

2010

The TLS Handshake Protocol: A Modular Analysis.

[BibT_eX]

[DOI]

J. Cryptol., 2010

On CCA-Secure Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

The Fiat-Shamir Transform for Group and Ring Signature Schemes.

[BibT_eX]

[DOI]

Ming-Feng Lee

IACR Cryptol. ePrint Arch., 2010

Efficient Two-Move Blind Signatures in the Common Reference String Model.

[BibT_eX]

[DOI]

Essam Ghadafi

IACR Cryptol. ePrint Arch., 2010

Get Shorty via Group Signatures without Encryption.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Errors Matter: Breaking RSA-Based PIN Encryption with Thirty Ciphertext Validity Queries.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2010

2009

Hash function requirements for Schnorr signatures.

[BibT_eX]

[DOI]

Gregory Neven

J. Math. Cryptol., 2009

Identity Based Group Signatures from Hierarchical Identity-Based Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Breaking RSA-based PIN Encryption with thirty ciphertext validity queries.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Secure Two-Party Computation is Practical.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Groth-Sahai proofs revisited.

[BibT_eX]

[DOI]

Essam Ghadafi

IACR Cryptol. ePrint Arch., 2009

Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement.

[BibT_eX]

[DOI]

Dario Fiore

Rosario Gennaro

IACR Cryptol. ePrint Arch., 2009

On the Design and Implementation of an Efficient DAA Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Security Notions and Generic Constructions for Client Puzzles.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Practical Zero-Knowledge Proofs for Circuit Evaluation.

[BibT_eX]

[DOI]

Essam Ghadafi

Proceedings of the Cryptography and Coding, 2009

Distributing the Key Distribution Centre in Sakai-Kasahara Based Systems.

[BibT_eX]

[DOI]

Martin Geisler

Proceedings of the Cryptography and Coding, 2009

2008

Cryptography in Computer System Security.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2008

Generic Constructions of Identity-Based and Certificateless KEMs.

[BibT_eX]

[DOI]

J. Cryptol., 2008

Randomised representations.

[BibT_eX]

[DOI]

Elisabeth Oswald

Daniel Page

IET Inf. Secur., 2008

A Modular Security Analysis of the TLS Handshake Protocol.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Pairings for cryptographers.

[BibT_eX]

[DOI]

Kenneth G. Paterson

Discret. Appl. Math., 2008

Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries.

[BibT_eX]

[DOI]

Yehuda Lindell

Benny Pinkas

Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

On Proofs of Security for DAA Schemes.

[BibT_eX]

[DOI]

Proceedings of the Provable Security, Second International Conference, 2008

Pairings in Trusted Computing.

[BibT_eX]

[DOI]

Proceedings of the Pairing-Based Cryptography, 2008

2007

Nondeterministic Multithreading.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2007

A multidimensional continued fraction based on a high-order recurrence relation.

[BibT_eX]

[DOI]

Yves Tourigny

Math. Comput., 2007

Identity-based key agreement protocols from pairings.

[BibT_eX]

[DOI]

Zhaohui Cheng

Int. J. Inf. Sec., 2007

Executing Modular Exponentiation on a Graphics Accelerator.

[BibT_eX]

[DOI]

Andrew Moss

IACR Cryptol. ePrint Arch., 2007

On computable isomorphisms in efficient asymmetric pairing-based systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Identity-Based Traitor Tracing.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2007

Toward Acceleration of RSA Using 3D Graphics Hardware.

[BibT_eX]

[DOI]

Andrew Moss

Proceedings of the Cryptography and Coding, 2007

Efficient KEMs with Partial Message Recovery.

[BibT_eX]

[DOI]

Tor E. Bjørstad

Alexander W. Dent

Proceedings of the Cryptography and Coding, 2007

Efficient 15, 360-bit RSA Using Woop-Optimised Montgomery Arithmetic.

[BibT_eX]

[DOI]

Kamel Bentahar

Proceedings of the Cryptography and Coding, 2007

2006

The Eta Pairing Revisited.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Escrow-free encryption supporting cryptographic workflow.

[BibT_eX]

[DOI]

Sattam S. Al-Riyami

John Malone-Lee

Int. J. Inf. Sec., 2006

On Computing Products of Pairings.

[BibT_eX]

[DOI]

Robert Granger

IACR Cryptol. ePrint Arch., 2006

High Security Pairing-Based Cryptography Revisited.

[BibT_eX]

[DOI]

Robert Granger

IACR Cryptol. ePrint Arch., 2006

Identity-Based Encryption Gone Wild.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2006

The Number Field Sieve in the Medium Prime Case.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2006

2005

An Efficient ID-KEM Based On The Sakai-Kasahara Key Construction.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

First Steps Toward a Cryptography-Aware Language and Compiler.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Hash Based Digital Signature Schemes.

[BibT_eX]

[DOI]

C. Dods

Martijn Stam

Proceedings of the Cryptography and Coding, 2005

Further Hidden Markov Model Cryptanalysis.

[BibT_eX]

[DOI]

P. J. Green

Richard Noad

Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29, 2005

2004

Parallel Cryptographic Arithmetic Using a Redundant Montgomery Representation.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2004

The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications.

[BibT_eX]

[DOI]

A. Muzereau

LMS J. Comput. Math., 2004

A comparison of MNT curves and supersingular curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

Security of Signature Schemes in a Multi-User Setting.

[BibT_eX]

[DOI]

Alfred Menezes

Des. Codes Cryptogr., 2004

Efficient Key Encapsulation to Multiple Parties.

[BibT_eX]

[DOI]

Proceedings of the Security in Communication Networks, 4th International Conference, 2004

An Algebraic Approach to NTRU (q = 2n) via Witt Vectors and Overdetermined Systems of Nonlinear Equations.

[BibT_eX]

[DOI]

Joseph H. Silverman

Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Attacking DSA Under a Repeated Bits Assumption.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems, 2004

Function Field Sieve in Characteristic Three.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003

Projective Coordinates Leak.

[BibT_eX]

[DOI]

David Naccache

Jacques Stern

IACR Cryptol. ePrint Arch., 2003

Point Multiplication on Ordinary Elliptic Curves over Fields of Characteristic Three.

[BibT_eX]

[DOI]

E. J. Westwood

Appl. Algebra Eng. Commun. Comput., 2003

Analysis of the Insecurity of ECMQV with Partially Known Nonces.

[BibT_eX]

[DOI]

Proceedings of the Information Security, 6th International Conference, 2003

Computing the M = U Ut Integer Matrix Decomposition.

[BibT_eX]

[DOI]

Katharina Geißler

Proceedings of the Cryptography and Coding, 2003

Mental Poker Revisited.

[BibT_eX]

[DOI]

Adam Barnett

Proceedings of the Cryptography and Coding, 2003

Access Control Using Pairing Based Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2003

An Analysis of Goubin's Refined Power Analysis Attack.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems, 2003

2002

Arithmetic on superelliptic curves.

[BibT_eX]

[DOI]

Sachar M. Paulus

Math. Comput., 2002

Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems.

[BibT_eX]

[DOI]

Keith Harrison

LMS J. Comput. Math., 2002

Constructive and Destructive Facets of Weil Descent on Elliptic Curves.

[BibT_eX]

[DOI]

Pierrick Gaudry

J. Cryptol., 2002

Public key signatures in the multi-user setting.

[BibT_eX]

[DOI]

John Malone-Lee

Inf. Process. Lett., 2002

Cryptanalysis of MQV with partially known nonces.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Modifications of ECDSA.

[BibT_eX]

[DOI]

John Malone-Lee

Proceedings of the Selected Areas in Cryptography, 2002

Certification of Public Keys within an Identity Based System.

[BibT_eX]

[DOI]

Proceedings of the Information Security, 5th International Conference, 2002

Applications of Multiple Trust Authorities in Pairing Based Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Infrastructure Security, International Conference, 2002

Flaws in Applying Proof Methodologies to Signature Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2002

Hardware Implementation of Finite Fields of Characteristic Three.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems, 2002

Instruction Stream Mutation for Non-Deterministic Processors.

[BibT_eX]

[DOI]

James Irwin

Proceedings of the 13th IEEE International Conference on Application-Specific Systems, 2002

2001

A note on the x-coordinate of points on an elliptic curve in characteristic two.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

An Identity Based Authenticated Key Agreement Protocol Based on the Weil Pairing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

Extending the GHS Weil Descent Attack.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

Lattice Attacks on Digital Signature Schemes.

[BibT_eX]

Nick Howgrave-Graham

Des. Codes Cryptogr., 2001

Two Topics in Hyperelliptic Cryptography.

[BibT_eX]

[DOI]

Gadiel Seroussi

Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

The Exact Security of ECIES in the Generic Group Model.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2001

How Secure Are Elliptic Curves over Composite Extension Fields?

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

The Hessian Form of an Elliptic Curve.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

Random Register Renaming to Foil DPA.

[BibT_eX]

[DOI]

David May

Henk L. Muller

Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

Preventing SPA/DPA in ECC Systems Using the Jacobi Form.

[BibT_eX]

[DOI]

Pierre-Yvan Liardet

Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

Non-deterministic Processors.

[BibT_eX]

[DOI]

David May

Henk L. Muller

Proceedings of the Information Security and Privacy, 6th Australasian Conference, 2001

2000

Physical side-channel attacks on cryptographic systems.

[BibT_eX]

[DOI]

Softw. Focus, 2000

A Wearable Public Key Infrastructure (WPKI).

[BibT_eX]

[DOI]

Henk L. Muller

Proceedings of the Fourth International Symposium on Wearable Computers (ISWC 2000), 2000

1999

Determining the small solutions to S-unit equations.

[BibT_eX]

[DOI]

Math. Comput., 1999

A Fast Diffie-Hellman Protocol in Genus 2.

[BibT_eX]

[DOI]

Samir Siksek

J. Cryptol., 1999

The Discrete Logarithm Problem on Elliptic Curves of Trace One.

[BibT_eX]

[DOI]

J. Cryptol., 1999

Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic.

[BibT_eX]

[DOI]

J. Cryptol., 1999

A Cryptographic Application of Weil Descent.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 1999

On the Performance of Hyperelliptic Cryptosystems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

1998

Exceptional units in a family of quartic number fields.

[BibT_eX]

[DOI]

Gerhard Niklasch

Math. Comput., 1998

p-adic Chaos and Random Number Generation.

[BibT_eX]

[DOI]

Christopher F. Woodcock

Exp. Math., 1998

A Comparison of Direct and Indirect Methods for Computing Selmer Groups of an Elliptic Curve.

[BibT_eX]

[DOI]

Z. Djabri

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

The algorithmic resolution of diophantine equations - a computational cookbook.

[BibT_eX]

London Mathematical Society student texts 41, Cambridge University Press, ISBN: 978-0-521-64633-8, 1998

1996

Solving Discriminant Form Equations Via Unit Equations.

[BibT_eX]

[DOI]

J. Symb. Comput., 1996

How Difficult Is It to Solve a Thue Equation?

[BibT_eX]

[DOI]