Searching for authors named "Aggelos Kiayias" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

25 documents found, showing 1 through 10. Next 10 →

Traitor Tracing with Constant Transmission Rate
by Aggelos Kiayias, Moti Yung — 2002
…Abstract. An important open problem in the area of Traitor Tracing is designing a scheme with constant expansion of the size of keys (users’ keys and the encryption key) and of the size of ciphertexts with respect to the size of the plaintext. This problem is known from the introduction of Traitor T…
Cited by 16 (3 self) – Add To MetaCart

Testing Disjointness of Private Datasets
by Aggelos Kiayias, Antonina Mitrofanova — 2005 — In Financial Cryptography (2005
…Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we consider the above problem in the setting where Alice and Bob wish to disclose no information to each other about th…
Cited by 6 (0 self) – Add To MetaCart

Group Signatures: Provable Security, Efficient Constructions and Anonymity from Trapdoor-Holders
by Aggelos Kiayias, Moti Yung — 2004
…To date, a group signature construction which is both efficient and proven secure in a formal model has not been suggested. In this work we give the first such construction. To this end we present a new formal model for group signatures capturing the state-of-the-art requirements in the area. We t…
Cited by 11 (0 self) – Add To MetaCart

Extracting Group Signatures from Traitor Tracing Schemes
by Aggelos Kiayias, Moti Yung — 2003 — In Eurocrypt 2003, LNCS
…Abstract. Digital Signatures emerge naturally from Public-Key Encryption based on trapdoor permutations, and the “duality ” of the two primitives was noted as early as Diffie-Hellman’s seminal work. The present work is centered around the crucial observation that two well known cryptographic primiti…
Cited by 9 (0 self) – Add To MetaCart

Cryptanalysis of the Polynomial Reconstruction Based Public-Key Cryptosystem of Eurocrypt'03 in the Optimal Parameter Setting
by Aggelos Kiayias, Moti Yung — 2003
…In Eurocrypt 2003, Augot and Finiasz presented a novel Public-key Cryptosystem based on the Polynomial Reconstruction Problem. While there is no immediate way to use coding theoretic techniques to break their system, it has been subsequently broken by Coron who presented a ciphertext-only attack …
Cited by 2 (0 self) – Add To MetaCart

Breaking and Repairing Asymmetric Public-Key Traitor Tracing
by Aggelos Kiayias, Moti Yung — 2003 — Proceedings of the ACM Workshop on Digital Rights Management
…Traitor tracing schemes are a very useful tool for preventing piracy in digital content distribution systems. A traitor tracing procedure allows the system-manager to reveal the identities of the subscribers that were implicated in the construction of a pirate-device that illegally receives the digi…
Cited by 12 (2 self) – Add To MetaCart

Two-Round Concurrent Blind Signatures without Random Oracles
by Aggelos Kiayias, Hong-sheng Zhou — 2005
…We present the first blind signature scheme that is efficient and provably secure without random oracles under concurrent attacks utilizing only two rounds of short communication. The scheme is based on elliptic curve groups for which a bilinear map exists and on extractable and equivocable commitme…
Cited by 3 (0 self) – Add To MetaCart

Copyrighting Public-key Functions and Applications to Black-box Traitor Tracing, Full revised version of [KY02b]. Available at: http://eprint.iacr.org/2006/458
by Aggelos Kiayias, Moti Yung — 2006
…Copyrighting a function is the process of embedding hard-to-remove marks in the function’s implementation while retaining its original functionality. Here we consider the above problem in the context of public-key encryption and we parallel the process of copyrighting a function to the process of de…
Cited by 1 (0 self) – Add To MetaCart

Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes with Applications
by Aggelos Kiayias, Moti Yung — 2002 — Proceedings of ICALP 2002, LNCS 2380
…We investigate the decoding problem of Reed-Solomon Codes (aka: the Polynomial Reconstruction Problem -- PR) from a cryptographic hardness perspective. First, following the standard methodology for constructing cryptographically strong primitives, we formulate a decisional intractability assumpti…
Cited by 9 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB