Encryption switching protocols

DOI10.1007/978-3-662-53018-4_12MaRDI QIDQ2835592zbMATH OpenOpenAlexWikidataFDO

Authors Geoffroy Couteau, T. J. Peters, David Pointcheval

Publication date 30 November 2016

Published in Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53018-4_12

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Encryption switching protocols revisited: switching modulo \(p\)
• An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
• Fully homomorphic encryption using ideal lattices
• Semi-homomorphic encryption and multiparty computation
• Ring switching in BGV-style homomorphic encryption

Cites work

• scientific article; zbMATH DE number 2085426 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• A new approach to practical active-secure two-party computation
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - ASIACRYPT 2003
• Advances in Cryptology - CRYPTO 2003
• Constant-overhead secure computation of Boolean circuits using preprocessing
• Efficient Disjointness Tests for Private Datasets
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Efficient generic zero-knowledge proofs from commitments (extended abstract)
• Efficient proofs that a committed number lies in an interval
• Fully homomorphic encryption using ideal lattices
• Group Encryption
• Improved Garbled Circuit: Free XOR Gates and Applications
• More efficient oblivious transfer extensions with security for malicious adversaries
• Multiparty Computation from Somewhat Homomorphic Encryption
• Oblivious Polynomial Evaluation
• Oblivious evaluation of multivariate polynomials
• Oblivious multi-variate polynomial evaluation
• Privacy-free garbled circuits with applications to efficient zero-knowledge
• Private database access with HE-over-ORAM architecture
• Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Publicly verifiable secret sharing
• Secure equality and greater-than tests with sublinear online complexity
• Secure two-party computation via cut-and-choose oblivious transfer

Cited in

(8)

• Blind polynomial evaluation and data trading
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
• Removing the strong RSA assumption from arguments over the integers
• An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
• Encryption switching protocols revisited: switching modulo \(p\)
• Universal proxy re-encryption
• Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
• Similarity Based Interactive Private Information Retrieval

Describes a project that uses

Uses Software

• ABY
• TASTY

This page was built for publication: Encryption switching protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835592)