Sciweavers

773 search results - page 26 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
CRYPTO
2009
Springer
105views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Privacy-Enhancing Auctions Using Rational Cryptography
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Tr...
SCN
2004
Springer
123views Communications» more  SCN 2004»
14 years 3 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros
TKDE
2010
272views more  TKDE 2010»
13 years 8 months ago
P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains
—Peer-to-peer (P2P) networks are vulnerable to peers who cheat, propagate malicious code, leech on the network, or simply do not cooperate. The traditional security techniques de...
Prashant Dewan, Partha Dasgupta
LOGCOM
2007
74views more  LOGCOM 2007»
13 years 9 months ago
On Independence of Variants of the Weak Pigeonhole Principle
The principle sPHPa b (PV (α)) states that no oracle circuit can compute a surjection of a onto b. We show that sPHP (a) P (a)(PV (α)) is independent of PV1(α)+sPHP π(a) Π(a)...
Emil Jerábek
ASIACRYPT
2010
Springer
13 years 7 months ago
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...
Jens Groth