scientific article
From MaRDI portal
Publication:3374910
zbMath1082.94522MaRDI QIDQ3374910
Stanislaw Jarecki, Anna Lysyanskaya
Publication date: 1 March 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Adaptively secure distributed PRFs from LWE ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Optimal resilient threshold GQ signatures ⋮ Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication ⋮ Fully adaptive Schnorr threshold signatures ⋮ Publicly-verifiable deletion via target-collapsing functions ⋮ Signcryption schemes with threshold unsigncryption, and applications ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Adaptively Secure Non-interactive Threshold Cryptosystems ⋮ Efficient one-sided adaptively secure computation ⋮ Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption ⋮ Tag-KEM/DEM: A new framework for hybrid encryption ⋮ Practical public key encryption with selective opening security for receivers ⋮ Provably secure threshold password-authenticated key exchange ⋮ GNUC: a new universal composability framework ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Adaptively Secure Two-Party Computation with Erasures ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Memory Erasability Amplification ⋮ Adaptively secure distributed public-key systems.
This page was built for publication:
