Efficient set operations in the presence of malicious adversaries (Q434343): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-011-9098-x / rank
Normal rank
 
Property / author
 
Property / author: Kobbi Nissim / rank
Normal rank
 
Property / author
 
Property / author: Kobbi Nissim / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6054130 / rank
 
Normal rank
Property / zbMATH Keywords
 
secure two-party protocols
Property / zbMATH Keywords: secure two-party protocols / rank
 
Normal rank
Property / zbMATH Keywords
 
set intersection
Property / zbMATH Keywords: set intersection / rank
 
Normal rank
Property / zbMATH Keywords
 
set union
Property / zbMATH Keywords: set union / rank
 
Normal rank
Property / zbMATH Keywords
 
malicious parties
Property / zbMATH Keywords: malicious parties / rank
 
Normal rank
Property / zbMATH Keywords
 
constant-round protocols
Property / zbMATH Keywords: constant-round protocols / rank
 
Normal rank
Property / zbMATH Keywords
 
oblivious pseudorandom function evaluation protocol
Property / zbMATH Keywords: oblivious pseudorandom function evaluation protocol / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-011-9098-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167485997 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59379655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security and composition of multiparty cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private Intersection of Certified Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multiparty computation of approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to construct constant-round zero-knowledge proof systems for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Linear Algebra Using Linearly Recurrent Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy-Preserving Set Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Privacy preserving data mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication preserving protocols for secure function evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number-theoretic constructions of efficient pseudo-random functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How asymmetry helps load balancing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-011-9098-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:26, 9 December 2024

scientific article
Language Label Description Also known as
English
Efficient set operations in the presence of malicious adversaries
scientific article

    Statements

    Efficient set operations in the presence of malicious adversaries (English)
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    secure two-party protocols
    0 references
    set intersection
    0 references
    set union
    0 references
    malicious parties
    0 references
    constant-round protocols
    0 references
    oblivious pseudorandom function evaluation protocol
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers