Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more

DOI10.1007/978-3-032-25317-0_11MaRDI QIDQ7299800zbMATH OpenFDO

Authors Pierre-Jean Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl

Publication date 20 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25317-0_11

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A unified framework for succinct garbling from homomorphic secret sharing
• An algebraic framework for silent preprocessing with trustless setup and active security
• Attribute-based encryption for circuits of unbounded depth from lattices
• Breaking the circuit size barrier for secure computation under DDH
• Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
• Constrained pseudorandom functions and their applications
• Constrained pseudorandom functions from homomorphic secret sharing
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Evaluating Branching Programs on Encrypted Data
• Fully homomorphic encryption using ideal lattices
• Fully homomorphic encryption with polylog overhead
• Functional signatures and pseudorandom functions
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• Laconic function evaluation and ABE for RAMs from (Ring-)LWE
• Laconic function evaluation and applications
• Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation
• Large message homomorphic secret sharing from DCR and applications
• Optimal Rearrangeable Multistage Connecting Networks
• Partial garbling schemes and their applications
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Privately constraining and programming PRFs, the LWE way
• Rate-1 arithmetic garbling from homomorphic secret sharing
• Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
• Somewhat homomorphic encryption from linear homomorphism and sparse LPN
• Succinct homomorphic secret sharing
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Theory of Cryptography
• Trapdoor hash functions and their applications
• Universal circuits (Preliminary Report)

This page was built for publication: Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299800)