Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
From MaRDI portal
Publication:4250764
DOI10.1007/3-540-48910-X_16zbMath0933.94027WikidataQ56287504 ScholiaQ56287504MaRDI QIDQ4250764
Publication date: 17 June 1999
Published in: Advances in Cryptology — EUROCRYPT ’99 (Search for Journal in Brave)
encryption schemespublic-key cryptographytrapdoor permutationprobabilistic encryption schemescomposite residuosity class problemtrapdoor mechanism
Related Items
Privacy-Preserving and yet Robust Collaborative Filtering Recommender as a Service ⋮ Round-Efficient Anonymous Password-Authenticated Key Exchange Protocol in the Standard Model ⋮ On the security of RSA textbook signature scheme on Paillier ciphertext ⋮ Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More ⋮ A new distribution version of Boneh-Goh-Nissim cryptosystem : Security and performance analysis ⋮ New Ideas to Build Noise-Free Homomorphic Cryptosystems ⋮ Similarity Based Interactive Private Information Retrieval ⋮ Privacy-Preserving Extraction of HOG Features Based on Integer Vector Homomorphic Encryption ⋮ Compact Lossy and All-but-One Trapdoor Functions from Lattice ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ Enhancement for Secure Multiple Matrix Multiplications over Ring-LWE Homomorphic Encryption ⋮ Outsourced Privacy-Preserving Random Decision Tree Algorithm Under Multiple Parties for Sensor-Cloud Integration ⋮ Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications ⋮ Cubic spline curve public key cryptography ⋮ SAMBA: A Generic Framework for Secure Federated Multi-Armed Bandits ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Hiding the input-size in multi-party private set intersection ⋮ Efficient and privacy-preserving tree-based inference via additive homomorphic encryption ⋮ Robust Threshold Schemes Based on the Chinese Remainder Theorem ⋮ A new public key cryptosystem over ℤn2* ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Public-Key Cryptosystems with Primitive Power Roots of Unity ⋮ Fully-Simulatable Oblivious Set Transfer ⋮ Efficient Disjointness Tests for Private Datasets ⋮ Practical Secure Naïve Bayesian Classification Over Encrypted Big Data in Cloud ⋮ Asynchronous Multi-Party Computation with Quadratic Communication ⋮ Lossy Identification Schemes from Decisional RSA ⋮ Two Generic Constructions of Probabilistic Cryptosystems and Their Applications ⋮ Simplified Submission of Inputs to Protocols ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Homomorphic Encryptions of Sums of Groups ⋮ Group Encryption ⋮ PAChain: Private, Authenticated and Auditable Consortium Blockchain ⋮ Improved Multiplication Triple Generation over Rings via RLWE-Based AHE ⋮ When Is a Semi-honest Secure Multiparty Computation Valuable? ⋮ Mathematical analysis and simulation of multiple keys and S-Boxes in a multinode network for secure transmission ⋮ An applications of signed quadratic residues in public key cryptography ⋮ Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ New Constructions and Applications of Trapdoor DDH Groups ⋮ CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions ⋮ Scalable Multi-party Private Set-Intersection ⋮ Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges ⋮ Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability ⋮ On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ⋮ A Framework for Constructing Convertible Undeniable Signatures ⋮ Efficient Confirmer Signatures from the “Signature of a Commitment” Paradigm ⋮ Formal and Precise Analysis of Soundness of Several Shuffling Schemes ⋮ Efficient Binary Conversion for Paillier Encrypted Values ⋮ Unclonable Group Identification ⋮ The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries ⋮ A Watermarking Scheme in the Encrypted Domain for Watermarking Protocol ⋮ Hash Functions from Sigma Protocols and Improvements to VSH ⋮ Privacy Preserving Sequential Pattern Mining in Data Stream ⋮ Fair Traceable Multi-Group Signatures ⋮ Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Fast secure two-party ECDSA signing ⋮ Round-optimal secure multi-party computation ⋮ Provably Secure (Broadcast) Homomorphic Signcryption ⋮ Privacy-Preserving Subgraph Matching Protocol for Two Parties ⋮ RSA Moduli with a Predetermined Portion: Techniques and Applications ⋮ Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications ⋮ Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering ⋮ On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis ⋮ A New Randomness Extraction Paradigm for Hybrid Encryption ⋮ Minicrypt primitives with algebraic structure and applications ⋮ A Commitment-Consistent Proof of a Shuffle ⋮ Privacy-Friendly Forecasting for the Smart Grid Using Homomorphic Encryption and the Group Method of Data Handling ⋮ New RSA-Based (Selectively) Convertible Undeniable Signature Schemes ⋮ Practical Threshold Signatures with Linear Secret Sharing Schemes ⋮ Co-sound Zero-Knowledge with Public Keys ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions ⋮ Public Verifiability from Pairings in Secret Sharing Schemes ⋮ Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures ⋮ Round-Optimal Blind Signatures from Waters Signatures ⋮ Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library ⋮ Round Optimal Universally Composable Oblivious Transfer Protocols ⋮ A Tamper-Evident Voting Machine Resistant to Covert Channels ⋮ SecGDB: Graph Encryption for Exact Shortest Distance Queries with Efficient Updates ⋮ Optimally Sound Sigma Protocols Under DCRA ⋮ Faster Homomorphic Evaluation of Discrete Fourier Transforms ⋮ A Simpler Rate-Optimal CPIR Protocol ⋮ Cryptographic Voting — A Gentle Introduction ⋮ VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets ⋮ Augmented Oblivious Polynomial Evaluation Protocol and Its Applications ⋮ Homomorphic Encryption ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ Adaptive Partitioning ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ Some basics on privacy techniques, anonymization and their big data challenges ⋮ Efficient set intersection with simulation-based security ⋮ Information security protocol based system identification with binary-valued observations ⋮ Counterexamples to new circular security assumptions underlying iO ⋮ Large message homomorphic secret sharing from DCR and applications ⋮ SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Trapdoor DDH groups from pairings and isogenies ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Privacy-preserving distributed mining of association rules using elliptic-curve cryptosystem and Shamir's secret sharing scheme ⋮ Privacy-preserving inverse distance weighted interpolation ⋮ White-box ECDSA: challenges and existing solutions ⋮ Generic plaintext equality and inequality proofs ⋮ Practical witness-key-agreement for blockchain-based dark pools financial trading ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ One-more unforgeability of blind ECDSA ⋮ Attacks on a privacy-preserving publish-subscribe system and a ride-hailing service ⋮ When HEAAN meets FV: a new somewhat homomorphic encryption with reduced memory overhead ⋮ Rate-limited secure function evaluation ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Encrypted SQL arithmetic functions processing for secure cloud database ⋮ Chosen ciphertext secure keyed-homomorphic public-key cryptosystems ⋮ Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems ⋮ Paillier's trapdoor function hides \(\Theta(n)\) bits ⋮ Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data ⋮ Dynamic searchable symmetric encryption schemes supporting range queries with forward (and backward) security ⋮ Electronic jury voting protocols ⋮ Private computation of polynomials over networks ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Single-server private information retrieval with sublinear amortized time ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ Paillier-based publicly verifiable (non-interactive) secret sharing ⋮ Secret computation of purchase history data using somewhat homomorphic encryption ⋮ A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ Smooth projective hashing and two-message oblivious transfer ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ Reproducible circularly secure bit encryption: applications and realizations ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Privacy-preserving outsourcing of image feature extraction in cloud computing ⋮ Discrete logarithm based additively homomorphic encryption and secure data aggregation ⋮ Efficient set operations in the presence of malicious adversaries ⋮ A new construction of the server-aided verification signature scheme ⋮ Decentralized multi-client functional encryption for inner product ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Short undeniable signatures based on group homomorphisms ⋮ On the tightness of forward-secure signature reductions ⋮ Lossy trapdoor functions from homomorphic reproducible encryption ⋮ An efficient IND-CCA2 secure Paillier-based cryptosystem ⋮ Privacy preserving distributed optimization using homomorphic encryption ⋮ Restricted adaptive oblivious transfer ⋮ Resource fairness and composability of cryptographic protocols ⋮ Parallel algorithms for modular multi-exponentiation ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ Trusted computing with addition machines. II ⋮ Secure multiparty computation of solid geometric problems and their applications ⋮ All-but-many encryption ⋮ Trusted computing with addition machines. I ⋮ Efficient one-sided adaptively secure computation ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Oblivious access control policies for cloud based data sharing systems ⋮ On RSA moduli with half of the bits prescribed ⋮ Oblivious DFA evaluation on joint input and its applications ⋮ A communication-efficient private matching scheme in client-server model ⋮ On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups ⋮ On RSA moduli with almost half of the bits prescribed ⋮ Security and privacy aspects in MapReduce on clouds: a survey ⋮ Semantic security for the McEliece cryptosystem without random oracles ⋮ Better security for deterministic public-key encryption: the auxiliary-input setting ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Candidate iO from homomorphic encryption schemes ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Boosting verifiable computation on encrypted data ⋮ Aggregatable distributed key generation ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ LPPRS: new location privacy preserving schemes based on ring signature over mobile social networks ⋮ An improvement of multi-exponentiation with encrypted bases argument: smaller and faster ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Multiparty cardinality testing for threshold private intersection ⋮ A geometric approach to homomorphic secret sharing ⋮ BETA: biometric-enabled threshold authentication ⋮ Multi-party threshold private set intersection with sublinear communication ⋮ Sampled-data-based fault-tolerant consensus control for multi-agent systems: a data privacy preserving scheme ⋮ Filling the gap between voters and cryptography in e-voting ⋮ Distributed anonymous data perturbation method for privacy-preserving data mining ⋮ Incompressible encodings ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ PSI-stats: private set intersection protocols supporting secure statistical functions ⋮ Influence maximization in social networks with privacy protection ⋮ CECMLP: new cipher-based evaluating collaborative multi-layer perceptron scheme in federated learning ⋮ Blind polynomial evaluation and data trading ⋮ New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications ⋮ Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Multiparty Proximity Testing with Dishonest Majority from Equality Testing ⋮ An efficient probabilistic public-key cryptosystem over quadratic fields quotients ⋮ Analysis of Gong et al.'s CCA2-secure homomorphic encryption ⋮ A reduction of security notions in designated confirmer signatures ⋮ Cross and Clean: Amortized Garbled Circuits with Constant Overhead ⋮ UC-secure and Contributory Password-Authenticated Group Key Exchange ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ A secure scalar product protocol against malicious adversaries ⋮ Threshold cryptography based on Asmuth-Bloom secret sharing ⋮ Prêt à voter with Paillier encryption ⋮ Privacy Assurances in Multiple Data-Aggregation Transactions ⋮ A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation ⋮ Secure Statistical Analysis Using RLWE-Based Homomorphic Encryption ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Privacy-preserving anomaly detection in cloud with lightweight homomorphic encryption ⋮ Secure \(k\)-skyband computation framework in distributed multi-party databases ⋮ Secure parameterized pattern matching ⋮ An efficient approach for secure multi-party computation without authenticated channel ⋮ Compressible FHE with applications to PIR ⋮ Private set intersection: new generic constructions and feasibility results ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Encryption-decryption-based consensus control for multi-agent systems: handling actuator faults ⋮ Privacy-preserving Krawtchouk moment feature extraction over encrypted image data ⋮ On the Security of Distributed Multiprime RSA ⋮ A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem ⋮ Authentication in Constrained Settings ⋮ A Secure and Efficient Protocol for Electronic Treasury Auctions ⋮ A Signature Scheme for a Dynamic Coalition Defence Environment Without Trusted Third Parties ⋮ Simulation-based selective opening security for receivers under chosen-ciphertext attacks ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Oblivious sampling with applications to two-party \(k\)-means clustering ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Secure Naïve Bayesian Classification over Encrypted Data in Cloud ⋮ A Secure Reverse Multi-Attribute First-Price E-Auction Mechanism Using Multiple Auctioneer Servers (Work in Progress) ⋮ Hiding clinical information in medical images: an enhanced encrypted reversible data hiding algorithm grounded on hierarchical absolute moment block truncation coding ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack ⋮ Differentially private naive Bayes learning over multiple data sources ⋮ Privacy-preserving ridge regression on distributed data ⋮ Outsourcing scalar products and matrix products on privacy-protected unencrypted data stored in untrusted clouds ⋮ Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ Expressive query over outsourced encrypted data ⋮ Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers ⋮ Secure multi-label data classification in cloud by additionally homomorphic encryption ⋮ Homomorphic public-key cryptosystems and encrypting Boolean circuits ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Adaptive security of multi-party protocols, revisited ⋮ Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud ⋮ On Privacy-Preserving Biometric Authentication ⋮ A note on an IND-CCA2 secure paillier-based cryptosystem ⋮ A secure control mechanism for network environments ⋮ Homomorphically encrypted \(k\)-means on cloud-hosted servers with low client-side load ⋮ Hypercubes and Private Information Retrieval ⋮ Secure distributed constraint satisfaction: reaching agreement without revealing private information ⋮ Quadratic Error Minimization in a Distributed Environment with Privacy Preserving ⋮ Privacy Preserving Protocols for Eigenvector Computation ⋮ PC-SyncBB: a privacy preserving collusion secure DCOP algorithm ⋮ Benaloh’s Dense Probabilistic Encryption Revisited ⋮ Secure and privacy preserving consensus for second-order systems based on Paillier encryption ⋮ Threshold circuit lower bounds on cryptographic functions ⋮ On RSA moduli with prescribed bit patterns ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ Cryptographic Assumptions: A Position Paper ⋮ Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ A New Rabin-type Trapdoor Permutation Equivalent to Factoring ⋮ Efficient Secure Two-Party Exponentiation ⋮ A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud ⋮ An efficient privacy-preserving compressive data gathering scheme in WSNs ⋮ Encrypted data processing with homomorphic re-encryption ⋮ A new approach for UC security concurrent deniable authentication ⋮ Identity-Based Group Encryption ⋮ Leakage-resilient biometric-based remote user authentication with fuzzy extractors ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ A novel fully homomorphic encryption scheme bsed on LWE ⋮ A Secure M + 1st Price Auction Protocol Based on Bit Slice Circuits ⋮ Network-Hiding Communication and Applications to Multi-party Protocols ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ On Constructing Homomorphic Encryption Schemes from Coding Theory ⋮ A Secure and Efficient Proof of Integer in an Interval Range ⋮ Self-correctors for Cryptographic Modules ⋮ Encryption Switching Protocols ⋮ Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs ⋮ Solving discrete logarithm problems faster with the aid of pre-computation ⋮ An information theoretically secure e-lottery scheme based on symmetric bivariate polynomials ⋮ Security analysis and improvement of a double-trapdoor encryption scheme ⋮ A public key cryptosystem based on a subgroup membership problem ⋮ Public-key cryptography and invariant theory ⋮ On non-Abelian homomorphic public-key cryptosystems ⋮ The Rabin cryptosystem revisited ⋮ New ways to garble arithmetic circuits ⋮ Black-box reusable NISC with random oracles ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ Algebraic restriction codes and their applications ⋮ Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ On-line/off-line DCR-based homomorphic encryption and applications ⋮ One round threshold ECDSA without roll call ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Privacy-preserving set-based estimation using partially homomorphic encryption ⋮ On Constructing Pairing-Free Identity-Based Encryptions ⋮ A bivariate polynomial-based cryptographic hard problem and its applications ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ Fake information mechanism based privacy-preserving average consensus ⋮ Privacy-enhanced and non-interactive linear regression with dropout-resilience ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Watermarkable public key encryption with efficient extraction under standard assumptions ⋮ Cumulatively all-lossy-but-one trapdoor functions from standard assumptions ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Towards practical topology-hiding computation ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Simulation-based bi-selective opening security for public key encryption ⋮ Faster Privacy-Preserving Location Proximity Schemes ⋮ $$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Generic construction of trace-and-revoke inner product functional encryption ⋮ Towards practical homomorphic time-lock puzzles: applicability and verifiability ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ Privacy-preserving and lossless distributed estimation of high-dimensional generalized additive mixed models ⋮ CORK: a privacy-preserving and lossless federated learning scheme for deep neural network ⋮ Cryptanalysis of a privacy-preserving authentication scheme based on private set intersection ⋮ Factoring integers and oracles for elliptic and hyperelliptic curves ⋮ Toward practical privacy-preserving linear regression ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Candidate iO from homomorphic encryption schemes
Uses Software
