Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security (Q5492131): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10207-006-0004-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063635907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Encryption and Proof of Knowledge in the Random Oracle Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of a Universally Verifiable Electronic Voting Scheme Based on Shuffling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography – PKC 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: Optimistic Mixing for Exit-Polls / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Verifiable Secret Shuffe of Homomorphic Encryptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flash mixing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimally robust hybrid mix network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applied Cryptography and Network Security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707413 / 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: Q4934714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of the Hash Functions MD4 and RIPEMD / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Break MD5 and Other Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Collision Search Attacks on SHA-0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Collisions in the Full SHA-1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417420 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:43, 24 June 2024

scientific article; zbMATH DE number 5063472
Language Label Description Also known as
English
Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
scientific article; zbMATH DE number 5063472

    Statements

    Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security (English)
    0 references
    13 October 2006
    0 references
    privacy
    0 references
    verifiable shuffles
    0 references
    formal security model
    0 references
    mix-nets
    0 references
    Paillier public-key system
    0 references

    Identifiers