Encryption switching protocols
From MaRDI portal
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
- A Fast Monte-Carlo Test for Primality
- A new approach to practical active-secure two-party computation
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- 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 generic zero-knowledge proofs from commitments (extended abstract)
- Efficient proofs that a committed number lies in an interval
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Fully homomorphic encryption using ideal lattices
- Group Encryption
- 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?)
- 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 evaluation of multivariate polynomials
- Oblivious multi-variate polynomial evaluation
- Oblivious 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
(10)- Encryption switching protocols revisited: switching modulo \(p\)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster
- Universal proxy re-encryption
- Blind polynomial evaluation and data trading
- Similarity Based Interactive Private Information Retrieval
- Removing the strong RSA assumption from arguments over the integers
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Zero-knowledge protocols with PVC security: striking the balance between security and efficiency
- Fast secure computations on shared polynomials and applications to private set operations
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)
