Sciweavers

AFRICACRYPT
2009
Springer
14 years 18 days ago
Certified Encryption Revisited
The notion of certified encryption had recently been suggested as a suitable setting for analyzing the security of encryption against adversaries that tamper with the key-registrat...
Pooya Farshim, Bogdan Warinschi
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
14 years 18 days ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue
ACNS
2007
Springer
91views Cryptology» more  ACNS 2007»
14 years 18 days ago
Efficient Content Authentication in Peer-to-Peer Networks
ed Abstract
Roberto Tamassia, Nikos Triandopoulos
ACNS
2009
Springer
150views Cryptology» more  ACNS 2009»
14 years 18 days ago
How to Compare Profiled Side-Channel Attacks?
Side-channel attacks are an important class of attacks against cryptographic devices and profiled side-channel attacks are the most powerful type of side-channel attacks. In this s...
François-Xavier Standaert, François ...
ACNS
2009
Springer
113views Cryptology» more  ACNS 2009»
14 years 18 days ago
Fast Packet Classification Using Condition Factorization
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
Alok Tongaonkar, R. Sekar, Sreenaath Vasudevan
ACNS
2009
Springer
118views Cryptology» more  ACNS 2009»
14 years 18 days ago
Efficient Robust Private Set Intersection
Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustnes...
Dana Dachman-Soled, Tal Malkin, Mariana Raykova, M...
ACNS
2009
Springer
121views Cryptology» more  ACNS 2009»
14 years 18 days ago
Efficient Deniable Authentication for Signatures
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicio...
Jean Monnerat, Sylvain Pasini, Serge Vaudenay
EUROCRYPT
1990
Springer
14 years 20 days ago
Propagation Characteristics of Boolean Functions
The relation between the Walsh-Hadamard transform and the autocorrelation function of Boolean functions is used to study propagation characteristics of these functions. The Strict...
Bart Preneel, Werner Van Leekwijck, Luc Van Linden...
EUROCRYPT
1990
Springer
14 years 20 days ago
A Known Plaintext Attack on Two-Key Triple Encryption
A chosen-plaintext attack on two-key triple encryption noted by Merkle and Hellman is extended to a known-plaintext attack. The known-plaintext attack has lower memory requirements...
Paul C. van Oorschot, Michael J. Wiener