Encryption Switching Protocols
From MaRDI portal
Publication:2835592
DOI10.1007/978-3-662-53018-4_12zbMath1378.94033OpenAlexW2402219606WikidataQ56920946 ScholiaQ56920946MaRDI QIDQ2835592
No author found.
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
Related Items
Similarity Based Interactive Private Information Retrieval ⋮ Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ An improvement of multi-exponentiation with encrypted bases argument: smaller and faster ⋮ Universal proxy re-encryption ⋮ Blind polynomial evaluation and data trading
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Private Database Access with HE-over-ORAM Architecture
- Oblivious evaluation of multivariate polynomials
- Publicly Verifiable Secret Sharing
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract)
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer
- Efficient Disjointness Tests for Private Datasets
- Improved Garbled Circuit: Free XOR Gates and Applications
- Oblivious Multi-variate Polynomial Evaluation
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A Fast Monte-Carlo Test for Primality
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- Fully homomorphic encryption using ideal lattices
- Secure Equality and Greater-Than Tests with Sublinear Online Complexity
- Group Encryption
- Advances in Cryptology - CRYPTO 2003
- Oblivious Polynomial Evaluation
- Advances in Cryptology - ASIACRYPT 2003
