Sciweavers

400 search results - page 49 / 80
» Cryptography and computer security for undergraduates
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
15 years 10 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim
TCC
2010
Springer
166views Cryptology» more  TCC 2010»
15 years 6 months ago
Public-Key Encryption Schemes with Auxiliary Inputs
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one t...
Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kala...

Publication
152views
15 years 1 months ago
Expected loss analysis of thresholded authentication protocols in noisy conditions
A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting $n$ rounds, with no error corr...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
CASES
2010
ACM
14 years 8 months ago
Implementing virtual secure circuit using a custom-instruction approach
Although cryptographic algorithms are designed to resist at least thousands of years of cryptoanalysis, implementing them with either software or hardware usually leaks additional...
Zhimin Chen, Ambuj Sinha, Patrick Schaumont
STACS
1992
Springer
15 years 2 months ago
Secure Commitment Against A Powerful Adversary
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yun...