scientific article; zbMATH DE number 2081087

Mihir Bellare, David Pointcheval, Alexandra Boldyreva, Anand Desai

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2248/22480566.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (71)

Security analysis of a password-based authentication protocol proposed to IEEE 1363 ⋮ Relations between robustness and RKA security under public-key encryption ⋮ Private authentication ⋮ A secure anonymous proxy signcryption scheme ⋮ Hidden shift quantum cryptanalysis and implications ⋮ Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved ⋮ KHAPE: Asymmetric PAKE from key-hiding key exchange ⋮ Group-Based Source-Destination Verifiable Encryption with Blacklist Checking ⋮ Semantic Security and Key-Privacy with Random Split of St-Gen Codes ⋮ Multi-designated receiver signed public key encryption ⋮ Anonymous, robust post-quantum public key encryption ⋮ Anonymity of NIST PQC round 3 KEMs ⋮ Reconciling non-malleability with homomorphic encryption ⋮ How to Leak a Secret and Reap the Rewards Too ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Randomized half-ideal cipher on groups with applications to UC (a)PAKE ⋮ One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity ⋮ Post-quantum anonymity of Kyber ⋮ On access control encryption without sanitization ⋮ Anonymous authenticated communication ⋮ Strongly anonymous ratcheted key exchange ⋮ Privacy-preserving authenticated key exchange in the standard model ⋮ Anonymous public key encryption under corruptions ⋮ Key-oblivious encryption from isogenies with application to accountable tracing signatures ⋮ Protego: efficient, revocable and auditable anonymous credentials with applications to hyperledger fabric ⋮ Epoch confidentiality in updatable encryption ⋮ Relations between semantic security and anonymity in identity-based encryption ⋮ Simulatable channels: extended security that is universally composable and easier to prove ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more ⋮ Transforming Hidden Vector Encryption Schemes from Composite to Prime Order Groups ⋮ On the Key-Privacy Issue of McEliece Public-Key Encryption ⋮ Group Encryption ⋮ Extended Galbraith's test on the anonymity of IBE schemes from higher residuosity ⋮ Anonymous spatial encryption under affine space delegation functionality with full security ⋮ Robust encryption ⋮ Robust Encryption, Revisited ⋮ Access Control Encryption for Equality, Comparison, and More ⋮ Generic construction of designated tester public-key encryption with keyword search ⋮ Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities ⋮ Broadcast Authenticated Encryption with Keyword Search ⋮ A general compiler for password-authenticated group key exchange protocol ⋮ Revocable IBE with En-DKER from lattices: a novel approach for lattice basis delegation ⋮ Code-based secret handshake scheme, revisited ⋮ Covercrypt: an efficient early-abort KEM for hidden access policies with traceability from the DDH and LWE ⋮ ACE with Compact Ciphertext Size and Decentralized Sanitizers ⋮ Short concurrent covert authenticated key exchange (short cAKE) ⋮ CASE: a new frontier in public-key authenticated encryption ⋮ A secure hierarchical deterministic wallet with stealth address from lattices ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Public Key Encryption with Searchable Keywords Based on Jacobi Symbols ⋮ Match me if you can: matchmaking encryption and its applications ⋮ The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application ⋮ Universally Anonymous IBE Based on the Quadratic Residuosity Assumption ⋮ Key-Private Proxy Re-encryption ⋮ Anamorphic encryption, revisited ⋮ Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption ⋮ Generic Anonymous Identity-Based Broadcast Encryption with Chosen-Ciphertext Security ⋮ Topology-hiding computation for networks with unknown delays ⋮ Building Key-Private Public-Key Encryption Schemes ⋮ Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions ⋮ New RSA-Based (Selectively) Convertible Undeniable Signature Schemes ⋮ Anonymity from Public Key Encryption to Undeniable Signatures ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ New Anonymity Notions for Identity-Based Encryption ⋮ New Anonymity Notions for Identity-Based Encryption ⋮ Robust Encryption ⋮ KEMTLS with delayed forward identity protection in (almost) a single round trip ⋮ Anonymous protocols: notions and equivalence ⋮ A public key cryptosystem and a signature scheme based on discrete logarithms

This page was built for publication: