scientific article; zbMATH DE number 5009201
From MaRDI portal
Publication:3374910
zbMATH Open1082.94522MaRDI QIDQ3374910FDOQ3374910
Authors: Stanislaw Jarecki, Anna Lysyanskaya 
Publication date: 1 March 2006
Title of this publication is not available (Why is that?)
Recommendations
- Adaptively secure non-interactive threshold cryptosystems
- Adaptively secure non-interactive threshold cryptosystems
- Threshold garbled circuits and ad hoc secure computation
- Adaptively secure forward-secure non-interactive threshold cryptosystems
- Publication:4941850
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Provably secure threshold public-key encryption with adaptive security and short ciphertexts
- Adaptively secure computation with partial erasures
- Adaptively Secure Two-Party Computation with Erasures
- scientific article; zbMATH DE number 2081074
Cited In (33)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Provably secure threshold password-authenticated key exchange
- Adaptively secure distributed public-key systems.
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
- GNUC: a new universal composability framework
- Title not available (Why is that?)
- Practical public key encryption with selective opening security for receivers
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Revocable cryptography from learning with errors
- Signcryption schemes with threshold unsigncryption, and applications
- Adaptively secure distributed PRFs from LWE
- Title not available (Why is that?)
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Memory erasability amplification
- Advances in Cryptology – CRYPTO 2004
- 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
- Fully adaptive Schnorr threshold signatures
- Publicly-verifiable deletion via target-collapsing functions
- Adaptively secure non-interactive threshold cryptosystems
- Efficient oblivious transfer from lossy threshold homomorphic encryption
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Adaptively Secure Two-Party Computation with Erasures
- Twinkle: threshold signatures from DDH with full adaptive security
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Adaptively secure computation with partial erasures
- An improved threshold homomorphic cryptosystem based on class groups
- Tag-KEM/DEM: A new framework for hybrid encryption
- Efficient one-sided adaptively secure computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374910)
