Sciweavers

212 search results - page 22 / 43
» Universally Composable Commitments
Sort
View
IFIP
2010
Springer
13 years 2 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
EUROCRYPT
2006
Springer
13 years 11 months ago
Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol
We propose simple, realistic protocols for polling that allow the responder to plausibly repudiate his response, while at the same time allow accurate statistical analysis of poll ...
Tal Moran, Moni Naor
ASIACRYPT
2008
Springer
13 years 10 months ago
Towards Robust Computation on Encrypted Data
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...
Manoj Prabhakaran, Mike Rosulek
CRYPTO
2007
Springer
109views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
We derive a new entropic quantum uncertainty relation involving min-entropy. The relation is tight and can be applied in various quantum-cryptographic settings. Protocols for quant...
Ivan Damgård, Serge Fehr, Renato Renner, Lou...
GPCE
2008
Springer
13 years 9 months ago
Polymorphic embedding of dsls
The influential pure embedding methodology of embedding domainspecific languages (DSLs) as libraries into a general-purpose host language forces the DSL designer to commit to a ...
Christian Hofer, Klaus Ostermann, Tillmann Rendel,...