Encryption switching protocols
From MaRDI portal
Publication:2835592
DOI10.1007/978-3-662-53018-4_12zbMATH Open1378.94033OpenAlexW2402219606WikidataQ56920946 ScholiaQ56920946MaRDI QIDQ2835592FDOQ2835592
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
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
- Fully homomorphic encryption using ideal lattices
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Multiparty Computation from Somewhat Homomorphic Encryption
- A new approach to practical active-secure two-party computation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Title not available (Why is that?)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Constant-overhead secure computation of Boolean circuits using preprocessing
- A Fast Monte-Carlo Test for Primality
- Title not available (Why is that?)
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Secure two-party computation via cut-and-choose oblivious transfer
- Oblivious Polynomial Evaluation
- Publicly verifiable secret sharing
- Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
- Title not available (Why is that?)
- Efficient proofs that a committed number lies in an interval
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
- Advances in Cryptology - ASIACRYPT 2003
- Advances in Cryptology - CRYPTO 2003
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Efficient Disjointness Tests for Private Datasets
- Oblivious evaluation of multivariate polynomials
- Efficient generic zero-knowledge proofs from commitments (extended abstract)
- More efficient oblivious transfer extensions with security for malicious adversaries
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Group Encryption
- Private database access with HE-over-ORAM architecture
- Oblivious multi-variate polynomial evaluation
- Secure equality and greater-than tests with sublinear online complexity
- Title not available (Why is that?)
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
Uses Software
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)
