Algebraic restriction codes and their applications

DOI10.1007/s00453-023-01150-yOpenAlexW3202895739MaRDI QIDQ6066762

Giulio Malavolta, Jesko Dujmovic, Maciej Obremski, Mohammad Hajiabadi, Divesh Aggarwal, Nico Döttling

Publication date: 13 December 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-023-01150-y

zbMATH Keywords

Diffie-Hellmanoblivious transferDDHOTrate 1algebraic restriction codesstatistically sender private

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (1)

A framework for statistically sender private OT with optimal rate

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth projective hashing and two-message oblivious transfer
• Non-malleable coding against bit-wise and split-state tampering
• Definitions and properties of zero-knowledge proof systems
• Two-message statistically sender-private OT from LWE
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Statistical ZAP arguments
• Statistical Zaps and new oblivious transfer protocols
• Constant ciphertext-rate non-committing encryption from standard assumptions
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Compressible FHE with applications to PIR
• A quantum-proof non-malleable extractor. With application to privacy amplification against active quantum adversaries
• Trapdoor hash functions and their applications
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Non-malleable Codes from Two-Source Extractors
• Maliciously Circuit-Private FHE
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Evaluating Branching Programs on Encrypted Data
• New directions in cryptography
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Non-Malleable Codes
• Fully homomorphic encryption using ideal lattices
• Non-malleable extractors and symmetric key cryptography from weak secrets
• Non-malleable codes from additive combinatorics
• Privacy Amplification and Nonmalleable Extractors Via Character Sums
• Efficient Fully Homomorphic Encryption from (Standard) LWE

This page was built for publication: Algebraic restriction codes and their applications