scientific article
From MaRDI portal
Publication:2743964
zbMath0968.90527MaRDI QIDQ2743964
Mihir Bellare, Phillip Rogaway
Publication date: 18 September 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)
Related Items (24)
Fiat-Shamir for highly sound protocols is instantiable ⋮ Efficient discrete logarithm based multi-signature scheme in the plain public key model ⋮ On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ The complexity of approximating a nonlinear program ⋮ Identity based identification from algebraic coding theory ⋮ On the leakage-resilient key exchange ⋮ PFLM: privacy-preserving federated learning with membership proof ⋮ A new technique for compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption ⋮ Sequential aggregate signatures with lazy verification from trapdoor permutations ⋮ Immunization against complete subversion without random oracles ⋮ Tightly secure ring signatures in the standard model ⋮ Non-adaptive programmability of random oracle ⋮ A new framework for the design and analysis of identity-based identification schemes ⋮ A well-characterized approximation problem ⋮ Sound and complete computational interpretation of symbolic hashes in the standard model ⋮ On complexity of unconstrained hyperbolic 0--1 programming problems ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ On approximation algorithms for concave mixed-integer quadratic programming ⋮ A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model ⋮ Direct chosen-ciphertext secure identity-based key encapsulation without random oracles ⋮ Unnamed Item ⋮ Improving the exact security of digital signature schemes ⋮ Pseudorandom Functions: Three Decades Later
This page was built for publication:
